{"version":3,"sources":["webpack:///./node_modules/bn.js/lib/bn.js"],"names":["assert","val","msg","Error","inherits","ctor","superCtor","super_","TempCtor","prototype","constructor","BN","number","base","endian","isBN","this","negative","words","length","red","_init","Buffer","module","exports","wordSize","e","parseHex","str","start","end","r","len","Math","min","z","i","b","c","charCodeAt","parseBase","mul","move","dest","src","inspect","toString","num","Array","isArray","max","left","right","cmp","_initNumber","_initArray","replace","_parseHex","_parseBase","_strip","toArray","ceil","j","w","off","limbLen","limbPow","total","mod","word","imuln","_iaddn","pow","copy","_move","clone","_expand","size","_normSign","Symbol","for","zeros","groupSizes","groupBases","padding","out","carry","groupSize","groupBase","isZero","modrn","idivn","toNumber","ret","toJSON","toBuffer","toArrayLike","smallMulTo","self","a","lo","k","ncarry","rword","maxJ","ArrayType","byteLength","reqLength","res","allocUnsafe","allocate","_toArrayLikeLE","position","shift","_toArrayLikeBE","clz32","_countBits","t","_zeroBits","bitLength","hi","zeroBits","toTwos","width","abs","inotn","iaddn","fromTwos","testn","notn","ineg","isNeg","neg","iuor","ior","or","uor","iuand","iand","and","uand","iuxor","ixor","xor","uxor","bytesNeeded","bitsLeft","setn","bit","wbit","iadd","isub","add","sub","comb10MulTo","mid","o","a0","al0","ah0","a1","al1","ah1","a2","al2","ah2","a3","al3","ah3","a4","al4","ah4","a5","al5","ah5","a6","al6","ah6","a7","al7","ah7","a8","al8","ah8","a9","al9","ah9","b0","bl0","bh0","b1","bl1","bh1","b2","bl2","bh2","b3","bl3","bh3","b4","bl4","bh4","b5","bl5","bh5","b6","bl6","bh6","b7","bl7","bh7","b8","bl8","bh8","b9","bl9","bh9","w0","imul","w1","w2","w3","w4","w5","w6","w7","w8","w9","w10","w11","w12","w13","w14","w15","w16","w17","w18","bigMulTo","hncarry","jumboMulTo","FFTM","x","y","mulTo","makeRBT","N","l","revBin","rb","permute","rbt","rws","iws","rtws","itws","transform","s","rtwdf","cos","PI","itwdf","sin","p","rtwdf_","itwdf_","re","ie","ro","io","rx","guessLen13b","n","m","odd","conjugate","normalize13b","ws","round","convert13b","stub","ph","mulp","_","rwst","iwst","nrws","nrwst","niwst","rmws","mulf","isNegNum","muln","sqr","isqr","toBitArray","q","iushln","bits","carryMask","newCarry","ishln","iushrn","hint","extended","h","mask","maskedWords","ishrn","shln","ushln","shrn","ushrn","imaskn","maskn","isubn","addn","subn","iabs","_ishlnsubmul","_wordDiv","mode","bhi","diff","qj","div","divmod","positive","divn","umod","divRound","dm","half","r2","andln","acc","modn","egcd","A","B","C","D","g","isEven","yp","xp","im","isOdd","jm","gcd","_invmp","x1","x2","delta","cmpn","invm","bincn","ucmp","gtn","gt","gten","gte","ltn","lt","lten","lte","eqn","eq","Red","toRed","ctx","convertTo","_forceRed","fromRed","convertFrom","forceRed","redAdd","redIAdd","redSub","redISub","redShl","shl","redMul","_verify2","redIMul","redSqr","_verify1","redISqr","redSqrt","sqrt","redInvm","redNeg","redPow","primes","k256","p224","p192","p25519","MPrime","name","tmp","_tmp","K256","call","P224","P192","P25519","prime","_prime","Mont","imod","rinv","minv","ireduce","rlen","split","imulK","undefined","strip","input","output","outLen","prev","next","mod3","one","nOne","lpow","inv","wnd","current","currentLen","mont","u"],"mappings":"kFAAA,2BACE,aAGA,SAASA,EAAQC,EAAKC,GACpB,IAAKD,EAAK,MAAM,IAAIE,MAAMD,GAAO,oBAKnC,SAASE,EAAUC,EAAMC,GACvBD,EAAKE,OAASD,EACd,IAAIE,EAAW,aACfA,EAASC,UAAYH,EAAUG,UAC/BJ,EAAKI,UAAY,IAAID,EACrBH,EAAKI,UAAUC,YAAcL,EAK/B,SAASM,EAAIC,EAAQC,EAAMC,GACzB,GAAIH,EAAGI,KAAKH,GACV,OAAOA,EAGTI,KAAKC,SAAW,EAChBD,KAAKE,MAAQ,KACbF,KAAKG,OAAS,EAGdH,KAAKI,IAAM,KAEI,OAAXR,IACW,OAATC,GAA0B,OAATA,IACnBC,EAASD,EACTA,EAAO,IAGTG,KAAKK,MAAMT,GAAU,EAAGC,GAAQ,GAAIC,GAAU,OAYlD,IAAIQ,EATkB,iBAAXC,EACTA,EAAOC,QAAUb,EAEjBa,EAAQb,GAAKA,EAGfA,EAAGA,GAAKA,EACRA,EAAGc,SAAW,GAGd,IACEH,EAAS,EAAQ,GAAUA,OAC3B,MAAOI,IAoIT,SAASC,EAAUC,EAAKC,EAAOC,GAI7B,IAHA,IAAIC,EAAI,EACJC,EAAMC,KAAKC,IAAIN,EAAIT,OAAQW,GAC3BK,EAAI,EACCC,EAAIP,EAAOO,EAAIJ,EAAKI,IAAK,CAChC,IAIIC,EAJAC,EAAIV,EAAIW,WAAWH,GAAK,GAE5BL,IAAM,EAiBNA,GAXEM,EADEC,GAAK,IAAMA,GAAK,GACdA,EAAI,GAAK,GAGJA,GAAK,IAAMA,GAAK,GACrBA,EAAI,GAAK,GAITA,EAINH,GAAKE,EAIP,OADArC,IAAa,IAAJmC,GAAW,wBAA0BP,GACvCG,EAiCT,SAASS,EAAWZ,EAAKC,EAAOC,EAAKW,GAInC,IAHA,IAAIV,EAAI,EACJM,EAAI,EACJL,EAAMC,KAAKC,IAAIN,EAAIT,OAAQW,GACtBM,EAAIP,EAAOO,EAAIJ,EAAKI,IAAK,CAChC,IAAIE,EAAIV,EAAIW,WAAWH,GAAK,GAE5BL,GAAKU,EAIHJ,EADEC,GAAK,GACHA,EAAI,GAAK,GAGJA,GAAK,GACVA,EAAI,GAAK,GAITA,EAENtC,EAAOsC,GAAK,GAAKD,EAAII,EAAK,qBAC1BV,GAAKM,EAEP,OAAON,EA0DT,SAASW,EAAMC,EAAMC,GACnBD,EAAKzB,MAAQ0B,EAAI1B,MACjByB,EAAKxB,OAASyB,EAAIzB,OAClBwB,EAAK1B,SAAW2B,EAAI3B,SACpB0B,EAAKvB,IAAMwB,EAAIxB,IA4CjB,SAASyB,IACP,OAAQ7B,KAAKI,IAAM,UAAY,SAAWJ,KAAK8B,SAAS,IAAM,IAlUhEnC,EAAGI,KAAO,SAAegC,GACvB,OAAIA,aAAepC,GAIJ,OAARoC,GAA+B,iBAARA,GAC5BA,EAAIrC,YAAYe,WAAad,EAAGc,UAAYuB,MAAMC,QAAQF,EAAI7B,QAGlEP,EAAGuC,IAAM,SAAcC,EAAMC,GAC3B,OAAID,EAAKE,IAAID,GAAS,EAAUD,EACzBC,GAGTzC,EAAGuB,IAAM,SAAciB,EAAMC,GAC3B,OAAID,EAAKE,IAAID,GAAS,EAAUD,EACzBC,GAGTzC,EAAGF,UAAUY,MAAQ,SAAeT,EAAQC,EAAMC,GAChD,GAAsB,iBAAXF,EACT,OAAOI,KAAKsC,YAAY1C,EAAQC,EAAMC,GAGxC,GAAsB,iBAAXF,EACT,OAAOI,KAAKuC,WAAW3C,EAAQC,EAAMC,GAG1B,QAATD,IACFA,EAAO,IAETb,EAAOa,KAAiB,EAAPA,IAAaA,GAAQ,GAAKA,GAAQ,IAGnD,IAAIgB,EAAQ,EACM,OAFlBjB,EAASA,EAAOkC,WAAWU,QAAQ,OAAQ,KAEhC,IACT3B,IAGW,KAAThB,EACFG,KAAKyC,UAAU7C,EAAQiB,GAEvBb,KAAK0C,WAAW9C,EAAQC,EAAMgB,GAGd,MAAdjB,EAAO,KACTI,KAAKC,SAAW,GAGlBD,KAAK2C,SAEU,OAAX7C,GAEJE,KAAKuC,WAAWvC,KAAK4C,UAAW/C,EAAMC,IAGxCH,EAAGF,UAAU6C,YAAc,SAAsB1C,EAAQC,EAAMC,GACzDF,EAAS,IACXI,KAAKC,SAAW,EAChBL,GAAUA,GAERA,EAAS,UACXI,KAAKE,MAAQ,CAAU,SAATN,GACdI,KAAKG,OAAS,GACLP,EAAS,kBAClBI,KAAKE,MAAQ,CACF,SAATN,EACCA,EAAS,SAAa,UAEzBI,KAAKG,OAAS,IAEdnB,EAAOY,EAAS,kBAChBI,KAAKE,MAAQ,CACF,SAATN,EACCA,EAAS,SAAa,SACvB,GAEFI,KAAKG,OAAS,GAGD,OAAXL,GAGJE,KAAKuC,WAAWvC,KAAK4C,UAAW/C,EAAMC,IAGxCH,EAAGF,UAAU8C,WAAa,SAAqB3C,EAAQC,EAAMC,GAG3D,GADAd,EAAgC,iBAAlBY,EAAOO,QACjBP,EAAOO,QAAU,EAGnB,OAFAH,KAAKE,MAAQ,CAAC,GACdF,KAAKG,OAAS,EACPH,KAGTA,KAAKG,OAASc,KAAK4B,KAAKjD,EAAOO,OAAS,GACxCH,KAAKE,MAAQ,IAAI8B,MAAMhC,KAAKG,QAC5B,IAAK,IAAIiB,EAAI,EAAGA,EAAIpB,KAAKG,OAAQiB,IAC/BpB,KAAKE,MAAMkB,GAAK,EAGlB,IAAI0B,EAAGC,EACHC,EAAM,EACV,GAAe,OAAXlD,EACF,IAAKsB,EAAIxB,EAAOO,OAAS,EAAG2C,EAAI,EAAG1B,GAAK,EAAGA,GAAK,EAC9C2B,EAAInD,EAAOwB,GAAMxB,EAAOwB,EAAI,IAAM,EAAMxB,EAAOwB,EAAI,IAAM,GACzDpB,KAAKE,MAAM4C,IAAOC,GAAKC,EAAO,SAC9BhD,KAAKE,MAAM4C,EAAI,GAAMC,IAAO,GAAKC,EAAQ,UACzCA,GAAO,KACI,KACTA,GAAO,GACPF,UAGC,GAAe,OAAXhD,EACT,IAAKsB,EAAI,EAAG0B,EAAI,EAAG1B,EAAIxB,EAAOO,OAAQiB,GAAK,EACzC2B,EAAInD,EAAOwB,GAAMxB,EAAOwB,EAAI,IAAM,EAAMxB,EAAOwB,EAAI,IAAM,GACzDpB,KAAKE,MAAM4C,IAAOC,GAAKC,EAAO,SAC9BhD,KAAKE,MAAM4C,EAAI,GAAMC,IAAO,GAAKC,EAAQ,UACzCA,GAAO,KACI,KACTA,GAAO,GACPF,KAIN,OAAO9C,KAAK2C,UAmCdhD,EAAGF,UAAUgD,UAAY,SAAoB7C,EAAQiB,GAEnDb,KAAKG,OAASc,KAAK4B,MAAMjD,EAAOO,OAASU,GAAS,GAClDb,KAAKE,MAAQ,IAAI8B,MAAMhC,KAAKG,QAC5B,IAAK,IAAIiB,EAAI,EAAGA,EAAIpB,KAAKG,OAAQiB,IAC/BpB,KAAKE,MAAMkB,GAAK,EAGlB,IAAI0B,EAAGC,EAEHC,EAAM,EACV,IAAK5B,EAAIxB,EAAOO,OAAS,EAAG2C,EAAI,EAAG1B,GAAKP,EAAOO,GAAK,EAClD2B,EAAIpC,EAASf,EAAQwB,EAAGA,EAAI,GAC5BpB,KAAKE,MAAM4C,IAAOC,GAAKC,EAAO,SAE9BhD,KAAKE,MAAM4C,EAAI,IAAMC,IAAO,GAAKC,EAAO,SACxCA,GAAO,KACI,KACTA,GAAO,GACPF,KAGA1B,EAAI,IAAMP,IACZkC,EAAIpC,EAASf,EAAQiB,EAAOO,EAAI,GAChCpB,KAAKE,MAAM4C,IAAOC,GAAKC,EAAO,SAC9BhD,KAAKE,MAAM4C,EAAI,IAAMC,IAAO,GAAKC,EAAO,SAE1ChD,KAAK2C,UA8BPhD,EAAGF,UAAUiD,WAAa,SAAqB9C,EAAQC,EAAMgB,GAE3Db,KAAKE,MAAQ,CAAC,GACdF,KAAKG,OAAS,EAGd,IAAK,IAAI8C,EAAU,EAAGC,EAAU,EAAGA,GAAW,SAAWA,GAAWrD,EAClEoD,IAEFA,IACAC,EAAWA,EAAUrD,EAAQ,EAO7B,IALA,IAAIsD,EAAQvD,EAAOO,OAASU,EACxBuC,EAAMD,EAAQF,EACdnC,EAAMG,KAAKC,IAAIiC,EAAOA,EAAQC,GAAOvC,EAErCwC,EAAO,EACFjC,EAAIP,EAAOO,EAAIN,EAAKM,GAAK6B,EAChCI,EAAO7B,EAAU5B,EAAQwB,EAAGA,EAAI6B,EAASpD,GAEzCG,KAAKsD,MAAMJ,GACPlD,KAAKE,MAAM,GAAKmD,EAAO,SACzBrD,KAAKE,MAAM,IAAMmD,EAEjBrD,KAAKuD,OAAOF,GAIhB,GAAY,IAARD,EAAW,CACb,IAAII,EAAM,EAGV,IAFAH,EAAO7B,EAAU5B,EAAQwB,EAAGxB,EAAOO,OAAQN,GAEtCuB,EAAI,EAAGA,EAAIgC,EAAKhC,IACnBoC,GAAO3D,EAGTG,KAAKsD,MAAME,GACPxD,KAAKE,MAAM,GAAKmD,EAAO,SACzBrD,KAAKE,MAAM,IAAMmD,EAEjBrD,KAAKuD,OAAOF,KAKlB1D,EAAGF,UAAUgE,KAAO,SAAe9B,GACjCA,EAAKzB,MAAQ,IAAI8B,MAAMhC,KAAKG,QAC5B,IAAK,IAAIiB,EAAI,EAAGA,EAAIpB,KAAKG,OAAQiB,IAC/BO,EAAKzB,MAAMkB,GAAKpB,KAAKE,MAAMkB,GAE7BO,EAAKxB,OAASH,KAAKG,OACnBwB,EAAK1B,SAAWD,KAAKC,SACrB0B,EAAKvB,IAAMJ,KAAKI,KAUlBT,EAAGF,UAAUiE,MAAQ,SAAgB/B,GACnCD,EAAKC,EAAM3B,OAGbL,EAAGF,UAAUkE,MAAQ,WACnB,IAAI5C,EAAI,IAAIpB,EAAG,MAEf,OADAK,KAAKyD,KAAK1C,GACHA,GAGTpB,EAAGF,UAAUmE,QAAU,SAAkBC,GACvC,KAAO7D,KAAKG,OAAS0D,GACnB7D,KAAKE,MAAMF,KAAKG,UAAY,EAE9B,OAAOH,MAITL,EAAGF,UAAUkD,OAAS,WACpB,KAAO3C,KAAKG,OAAS,GAAqC,IAAhCH,KAAKE,MAAMF,KAAKG,OAAS,IACjDH,KAAKG,SAEP,OAAOH,KAAK8D,aAGdnE,EAAGF,UAAUqE,UAAY,WAKvB,OAHoB,IAAhB9D,KAAKG,QAAkC,IAAlBH,KAAKE,MAAM,KAClCF,KAAKC,SAAW,GAEXD,MAKa,oBAAX+D,QAAgD,mBAAfA,OAAOC,IACjDrE,EAAGF,UAAUsE,OAAOC,IAAI,+BAAiCnC,EAEzDlC,EAAGF,UAAUoC,QAAUA,EAqCzB,IAAIoC,EAAQ,CACV,GACA,IACA,KACA,MACA,OACA,QACA,SACA,UACA,WACA,YACA,aACA,cACA,eACA,gBACA,iBACA,kBACA,mBACA,oBACA,qBACA,sBACA,uBACA,wBACA,yBACA,0BACA,2BACA,6BAGEC,EAAa,CACf,EAAG,EACH,GAAI,GAAI,GAAI,GAAI,GAAI,EAAG,EACvB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAClB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAClB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAClB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAGhBC,EAAa,CACf,EAAG,EACH,SAAU,SAAU,SAAU,SAAU,SAAU,SAAU,SAC5D,SAAU,IAAU,SAAU,SAAU,SAAU,QAAS,SAC3D,SAAU,SAAU,SAAU,SAAU,KAAU,QAAS,QAC3D,QAAS,QAAS,QAAS,SAAU,SAAU,SAAU,SACzD,MAAU,SAAU,SAAU,SAAU,SAAU,SAAU,UAG9DxE,EAAGF,UAAUqC,SAAW,SAAmBjC,EAAMuE,GAI/C,IAAIC,EACJ,GAHAD,EAAoB,EAAVA,GAAe,EAGZ,MAJbvE,EAAOA,GAAQ,KAIa,QAATA,EAAgB,CACjCwE,EAAM,GAGN,IAFA,IAAIrB,EAAM,EACNsB,EAAQ,EACHlD,EAAI,EAAGA,EAAIpB,KAAKG,OAAQiB,IAAK,CACpC,IAAI2B,EAAI/C,KAAKE,MAAMkB,GACfiC,GAA+B,UAArBN,GAAKC,EAAOsB,IAAmBxC,SAAS,IAGpDuC,EADY,KADdC,EAASvB,IAAO,GAAKC,EAAQ,WACV5B,IAAMpB,KAAKG,OAAS,EAC/B8D,EAAM,EAAIZ,EAAKlD,QAAUkD,EAAOgB,EAEhChB,EAAOgB,GAEfrB,GAAO,IACI,KACTA,GAAO,GACP5B,KAMJ,IAHc,IAAVkD,IACFD,EAAMC,EAAMxC,SAAS,IAAMuC,GAEtBA,EAAIlE,OAASiE,GAAY,GAC9BC,EAAM,IAAMA,EAKd,OAHsB,IAAlBrE,KAAKC,WACPoE,EAAM,IAAMA,GAEPA,EAGT,GAAIxE,KAAiB,EAAPA,IAAaA,GAAQ,GAAKA,GAAQ,GAAI,CAElD,IAAI0E,EAAYL,EAAWrE,GAEvB2E,EAAYL,EAAWtE,GAC3BwE,EAAM,GACN,IAAI/C,EAAItB,KAAK2D,QAEb,IADArC,EAAErB,SAAW,GACLqB,EAAEmD,UAAU,CAClB,IAAI1D,EAAIO,EAAEoD,MAAMF,GAAW1C,SAASjC,GAMlCwE,GALF/C,EAAIA,EAAEqD,MAAMH,IAELC,SAGC1D,EAAIsD,EAFJJ,EAAMM,EAAYxD,EAAEZ,QAAUY,EAAIsD,EAQ5C,IAHIrE,KAAKyE,WACPJ,EAAM,IAAMA,GAEPA,EAAIlE,OAASiE,GAAY,GAC9BC,EAAM,IAAMA,EAKd,OAHsB,IAAlBrE,KAAKC,WACPoE,EAAM,IAAMA,GAEPA,EAGTrF,GAAO,EAAO,oCAGhBW,EAAGF,UAAUmF,SAAW,WACtB,IAAIC,EAAM7E,KAAKE,MAAM,GASrB,OARoB,IAAhBF,KAAKG,OACP0E,GAAuB,SAAhB7E,KAAKE,MAAM,GACO,IAAhBF,KAAKG,QAAkC,IAAlBH,KAAKE,MAAM,GAEzC2E,GAAO,iBAAoC,SAAhB7E,KAAKE,MAAM,GAC7BF,KAAKG,OAAS,GACvBnB,GAAO,EAAO,8CAEU,IAAlBgB,KAAKC,UAAmB4E,EAAMA,GAGxClF,EAAGF,UAAUqF,OAAS,WACpB,OAAO9E,KAAK8B,SAAS,GAAI,IAGvBxB,IACFX,EAAGF,UAAUsF,SAAW,SAAmBjF,EAAQK,GACjD,OAAOH,KAAKgF,YAAY1E,EAAQR,EAAQK,KAI5CR,EAAGF,UAAUmD,QAAU,SAAkB9C,EAAQK,GAC/C,OAAOH,KAAKgF,YAAYhD,MAAOlC,EAAQK,IA4gBzC,SAAS8E,EAAYC,EAAMnD,EAAKsC,GAC9BA,EAAIpE,SAAW8B,EAAI9B,SAAWiF,EAAKjF,SACnC,IAAIe,EAAOkE,EAAK/E,OAAS4B,EAAI5B,OAAU,EACvCkE,EAAIlE,OAASa,EACbA,EAAOA,EAAM,EAAK,EAGlB,IAAImE,EAAoB,EAAhBD,EAAKhF,MAAM,GACfmB,EAAmB,EAAfU,EAAI7B,MAAM,GACda,EAAIoE,EAAI9D,EAER+D,EAAS,SAAJrE,EACLuD,EAASvD,EAAI,SAAa,EAC9BsD,EAAInE,MAAM,GAAKkF,EAEf,IAAK,IAAIC,EAAI,EAAGA,EAAIrE,EAAKqE,IAAK,CAM5B,IAHA,IAAIC,EAAShB,IAAU,GACnBiB,EAAgB,SAARjB,EACRkB,EAAOvE,KAAKC,IAAImE,EAAGtD,EAAI5B,OAAS,GAC3B2C,EAAI7B,KAAKiB,IAAI,EAAGmD,EAAIH,EAAK/E,OAAS,GAAI2C,GAAK0C,EAAM1C,IAAK,CAC7D,IAAI1B,EAAKiE,EAAIvC,EAAK,EAIlBwC,IADAvE,GAFAoE,EAAoB,EAAhBD,EAAKhF,MAAMkB,KACfC,EAAmB,EAAfU,EAAI7B,MAAM4C,IACFyC,GACG,SAAa,EAC5BA,EAAY,SAAJxE,EAEVsD,EAAInE,MAAMmF,GAAa,EAARE,EACfjB,EAAiB,EAATgB,EAQV,OANc,IAAVhB,EACFD,EAAInE,MAAMmF,GAAa,EAARf,EAEfD,EAAIlE,SAGCkE,EAAI1B,SAxiBbhD,EAAGF,UAAUuF,YAAc,SAAsBS,EAAW3F,EAAQK,GAClEH,KAAK2C,SAEL,IAAI+C,EAAa1F,KAAK0F,aAClBC,EAAYxF,GAAUc,KAAKiB,IAAI,EAAGwD,GACtC1G,EAAO0G,GAAcC,EAAW,yCAChC3G,EAAO2G,EAAY,EAAG,+BAEtB,IAAIC,EAfS,SAAmBH,EAAW5B,GAC3C,OAAI4B,EAAUI,YACLJ,EAAUI,YAAYhC,GAExB,IAAI4B,EAAU5B,GAWXiC,CAASL,EAAWE,GAG9B,OADA3F,KAAK,gBADoB,OAAXF,EAAkB,KAAO,OACR8F,EAAKF,GAC7BE,GAGTjG,EAAGF,UAAUsG,eAAiB,SAAyBH,EAAKF,GAI1D,IAHA,IAAIM,EAAW,EACX1B,EAAQ,EAEHlD,EAAI,EAAG6E,EAAQ,EAAG7E,EAAIpB,KAAKG,OAAQiB,IAAK,CAC/C,IAAIiC,EAAQrD,KAAKE,MAAMkB,IAAM6E,EAAS3B,EAEtCsB,EAAII,KAAqB,IAAP3C,EACd2C,EAAWJ,EAAIzF,SACjByF,EAAII,KAAe3C,GAAQ,EAAK,KAE9B2C,EAAWJ,EAAIzF,SACjByF,EAAII,KAAe3C,GAAQ,GAAM,KAGrB,IAAV4C,GACED,EAAWJ,EAAIzF,SACjByF,EAAII,KAAe3C,GAAQ,GAAM,KAEnCiB,EAAQ,EACR2B,EAAQ,IAER3B,EAAQjB,IAAS,GACjB4C,GAAS,GAIb,GAAID,EAAWJ,EAAIzF,OAGjB,IAFAyF,EAAII,KAAc1B,EAEX0B,EAAWJ,EAAIzF,QACpByF,EAAII,KAAc,GAKxBrG,EAAGF,UAAUyG,eAAiB,SAAyBN,EAAKF,GAI1D,IAHA,IAAIM,EAAWJ,EAAIzF,OAAS,EACxBmE,EAAQ,EAEHlD,EAAI,EAAG6E,EAAQ,EAAG7E,EAAIpB,KAAKG,OAAQiB,IAAK,CAC/C,IAAIiC,EAAQrD,KAAKE,MAAMkB,IAAM6E,EAAS3B,EAEtCsB,EAAII,KAAqB,IAAP3C,EACd2C,GAAY,IACdJ,EAAII,KAAe3C,GAAQ,EAAK,KAE9B2C,GAAY,IACdJ,EAAII,KAAe3C,GAAQ,GAAM,KAGrB,IAAV4C,GACED,GAAY,IACdJ,EAAII,KAAe3C,GAAQ,GAAM,KAEnCiB,EAAQ,EACR2B,EAAQ,IAER3B,EAAQjB,IAAS,GACjB4C,GAAS,GAIb,GAAID,GAAY,EAGd,IAFAJ,EAAII,KAAc1B,EAEX0B,GAAY,GACjBJ,EAAII,KAAc,GAKpB/E,KAAKkF,MACPxG,EAAGF,UAAU2G,WAAa,SAAqBrD,GAC7C,OAAO,GAAK9B,KAAKkF,MAAMpD,IAGzBpD,EAAGF,UAAU2G,WAAa,SAAqBrD,GAC7C,IAAIsD,EAAItD,EACJhC,EAAI,EAiBR,OAhBIsF,GAAK,OACPtF,GAAK,GACLsF,KAAO,IAELA,GAAK,KACPtF,GAAK,EACLsF,KAAO,GAELA,GAAK,IACPtF,GAAK,EACLsF,KAAO,GAELA,GAAK,IACPtF,GAAK,EACLsF,KAAO,GAEFtF,EAAIsF,GAIf1G,EAAGF,UAAU6G,UAAY,SAAoBvD,GAE3C,GAAU,IAANA,EAAS,OAAO,GAEpB,IAAIsD,EAAItD,EACJhC,EAAI,EAoBR,OAnBqB,IAAZ,KAAJsF,KACHtF,GAAK,GACLsF,KAAO,IAEU,IAAV,IAAJA,KACHtF,GAAK,EACLsF,KAAO,GAES,IAAT,GAAJA,KACHtF,GAAK,EACLsF,KAAO,GAES,IAAT,EAAJA,KACHtF,GAAK,EACLsF,KAAO,GAES,IAAT,EAAJA,IACHtF,IAEKA,GAITpB,EAAGF,UAAU8G,UAAY,WACvB,IAAIxD,EAAI/C,KAAKE,MAAMF,KAAKG,OAAS,GAC7BqG,EAAKxG,KAAKoG,WAAWrD,GACzB,OAA2B,IAAnB/C,KAAKG,OAAS,GAAUqG,GAiBlC7G,EAAGF,UAAUgH,SAAW,WACtB,GAAIzG,KAAKyE,SAAU,OAAO,EAG1B,IADA,IAAI1D,EAAI,EACCK,EAAI,EAAGA,EAAIpB,KAAKG,OAAQiB,IAAK,CACpC,IAAIC,EAAIrB,KAAKsG,UAAUtG,KAAKE,MAAMkB,IAElC,GADAL,GAAKM,EACK,KAANA,EAAU,MAEhB,OAAON,GAGTpB,EAAGF,UAAUiG,WAAa,WACxB,OAAOzE,KAAK4B,KAAK7C,KAAKuG,YAAc,IAGtC5G,EAAGF,UAAUiH,OAAS,SAAiBC,GACrC,OAAsB,IAAlB3G,KAAKC,SACAD,KAAK4G,MAAMC,MAAMF,GAAOG,MAAM,GAEhC9G,KAAK2D,SAGdhE,EAAGF,UAAUsH,SAAW,SAAmBJ,GACzC,OAAI3G,KAAKgH,MAAML,EAAQ,GACd3G,KAAKiH,KAAKN,GAAOG,MAAM,GAAGI,OAE5BlH,KAAK2D,SAGdhE,EAAGF,UAAU0H,MAAQ,WACnB,OAAyB,IAAlBnH,KAAKC,UAIdN,EAAGF,UAAU2H,IAAM,WACjB,OAAOpH,KAAK2D,QAAQuD,QAGtBvH,EAAGF,UAAUyH,KAAO,WAKlB,OAJKlH,KAAKyE,WACRzE,KAAKC,UAAY,GAGZD,MAITL,EAAGF,UAAU4H,KAAO,SAAetF,GACjC,KAAO/B,KAAKG,OAAS4B,EAAI5B,QACvBH,KAAKE,MAAMF,KAAKG,UAAY,EAG9B,IAAK,IAAIiB,EAAI,EAAGA,EAAIW,EAAI5B,OAAQiB,IAC9BpB,KAAKE,MAAMkB,GAAKpB,KAAKE,MAAMkB,GAAKW,EAAI7B,MAAMkB,GAG5C,OAAOpB,KAAK2C,UAGdhD,EAAGF,UAAU6H,IAAM,SAAcvF,GAE/B,OADA/C,EAA0C,IAAlCgB,KAAKC,SAAW8B,EAAI9B,WACrBD,KAAKqH,KAAKtF,IAInBpC,EAAGF,UAAU8H,GAAK,SAAaxF,GAC7B,OAAI/B,KAAKG,OAAS4B,EAAI5B,OAAeH,KAAK2D,QAAQ2D,IAAIvF,GAC/CA,EAAI4B,QAAQ2D,IAAItH,OAGzBL,EAAGF,UAAU+H,IAAM,SAAczF,GAC/B,OAAI/B,KAAKG,OAAS4B,EAAI5B,OAAeH,KAAK2D,QAAQ0D,KAAKtF,GAChDA,EAAI4B,QAAQ0D,KAAKrH,OAI1BL,EAAGF,UAAUgI,MAAQ,SAAgB1F,GAEnC,IAAIV,EAEFA,EADErB,KAAKG,OAAS4B,EAAI5B,OAChB4B,EAEA/B,KAGN,IAAK,IAAIoB,EAAI,EAAGA,EAAIC,EAAElB,OAAQiB,IAC5BpB,KAAKE,MAAMkB,GAAKpB,KAAKE,MAAMkB,GAAKW,EAAI7B,MAAMkB,GAK5C,OAFApB,KAAKG,OAASkB,EAAElB,OAETH,KAAK2C,UAGdhD,EAAGF,UAAUiI,KAAO,SAAe3F,GAEjC,OADA/C,EAA0C,IAAlCgB,KAAKC,SAAW8B,EAAI9B,WACrBD,KAAKyH,MAAM1F,IAIpBpC,EAAGF,UAAUkI,IAAM,SAAc5F,GAC/B,OAAI/B,KAAKG,OAAS4B,EAAI5B,OAAeH,KAAK2D,QAAQ+D,KAAK3F,GAChDA,EAAI4B,QAAQ+D,KAAK1H,OAG1BL,EAAGF,UAAUmI,KAAO,SAAe7F,GACjC,OAAI/B,KAAKG,OAAS4B,EAAI5B,OAAeH,KAAK2D,QAAQ8D,MAAM1F,GACjDA,EAAI4B,QAAQ8D,MAAMzH,OAI3BL,EAAGF,UAAUoI,MAAQ,SAAgB9F,GAEnC,IAAIoD,EACA9D,EACArB,KAAKG,OAAS4B,EAAI5B,QACpBgF,EAAInF,KACJqB,EAAIU,IAEJoD,EAAIpD,EACJV,EAAIrB,MAGN,IAAK,IAAIoB,EAAI,EAAGA,EAAIC,EAAElB,OAAQiB,IAC5BpB,KAAKE,MAAMkB,GAAK+D,EAAEjF,MAAMkB,GAAKC,EAAEnB,MAAMkB,GAGvC,GAAIpB,OAASmF,EACX,KAAO/D,EAAI+D,EAAEhF,OAAQiB,IACnBpB,KAAKE,MAAMkB,GAAK+D,EAAEjF,MAAMkB,GAM5B,OAFApB,KAAKG,OAASgF,EAAEhF,OAETH,KAAK2C,UAGdhD,EAAGF,UAAUqI,KAAO,SAAe/F,GAEjC,OADA/C,EAA0C,IAAlCgB,KAAKC,SAAW8B,EAAI9B,WACrBD,KAAK6H,MAAM9F,IAIpBpC,EAAGF,UAAUsI,IAAM,SAAchG,GAC/B,OAAI/B,KAAKG,OAAS4B,EAAI5B,OAAeH,KAAK2D,QAAQmE,KAAK/F,GAChDA,EAAI4B,QAAQmE,KAAK9H,OAG1BL,EAAGF,UAAUuI,KAAO,SAAejG,GACjC,OAAI/B,KAAKG,OAAS4B,EAAI5B,OAAeH,KAAK2D,QAAQkE,MAAM9F,GACjDA,EAAI4B,QAAQkE,MAAM7H,OAI3BL,EAAGF,UAAUoH,MAAQ,SAAgBF,GACnC3H,EAAwB,iBAAV2H,GAAsBA,GAAS,GAE7C,IAAIsB,EAAsC,EAAxBhH,KAAK4B,KAAK8D,EAAQ,IAChCuB,EAAWvB,EAAQ,GAGvB3G,KAAK4D,QAAQqE,GAETC,EAAW,GACbD,IAIF,IAAK,IAAI7G,EAAI,EAAGA,EAAI6G,EAAa7G,IAC/BpB,KAAKE,MAAMkB,GAAsB,UAAhBpB,KAAKE,MAAMkB,GAS9B,OALI8G,EAAW,IACblI,KAAKE,MAAMkB,IAAMpB,KAAKE,MAAMkB,GAAM,UAAc,GAAK8G,GAIhDlI,KAAK2C,UAGdhD,EAAGF,UAAUwH,KAAO,SAAeN,GACjC,OAAO3G,KAAK2D,QAAQkD,MAAMF,IAI5BhH,EAAGF,UAAU0I,KAAO,SAAeC,EAAKnJ,GACtCD,EAAsB,iBAARoJ,GAAoBA,GAAO,GAEzC,IAAIpF,EAAOoF,EAAM,GAAM,EACnBC,EAAOD,EAAM,GAUjB,OARApI,KAAK4D,QAAQZ,EAAM,GAGjBhD,KAAKE,MAAM8C,GADT/D,EACgBe,KAAKE,MAAM8C,GAAQ,GAAKqF,EAExBrI,KAAKE,MAAM8C,KAAS,GAAKqF,GAGtCrI,KAAK2C,UAIdhD,EAAGF,UAAU6I,KAAO,SAAevG,GACjC,IAAIhB,EAkBAoE,EAAG9D,EAfP,GAAsB,IAAlBrB,KAAKC,UAAmC,IAAjB8B,EAAI9B,SAI7B,OAHAD,KAAKC,SAAW,EAChBc,EAAIf,KAAKuI,KAAKxG,GACd/B,KAAKC,UAAY,EACVD,KAAK8D,YAGP,GAAsB,IAAlB9D,KAAKC,UAAmC,IAAjB8B,EAAI9B,SAIpC,OAHA8B,EAAI9B,SAAW,EACfc,EAAIf,KAAKuI,KAAKxG,GACdA,EAAI9B,SAAW,EACRc,EAAE+C,YAKP9D,KAAKG,OAAS4B,EAAI5B,QACpBgF,EAAInF,KACJqB,EAAIU,IAEJoD,EAAIpD,EACJV,EAAIrB,MAIN,IADA,IAAIsE,EAAQ,EACHlD,EAAI,EAAGA,EAAIC,EAAElB,OAAQiB,IAC5BL,GAAkB,EAAboE,EAAEjF,MAAMkB,KAAwB,EAAbC,EAAEnB,MAAMkB,IAAUkD,EAC1CtE,KAAKE,MAAMkB,GAAS,SAAJL,EAChBuD,EAAQvD,IAAM,GAEhB,KAAiB,IAAVuD,GAAelD,EAAI+D,EAAEhF,OAAQiB,IAClCL,GAAkB,EAAboE,EAAEjF,MAAMkB,IAAUkD,EACvBtE,KAAKE,MAAMkB,GAAS,SAAJL,EAChBuD,EAAQvD,IAAM,GAIhB,GADAf,KAAKG,OAASgF,EAAEhF,OACF,IAAVmE,EACFtE,KAAKE,MAAMF,KAAKG,QAAUmE,EAC1BtE,KAAKG,cAEA,GAAIgF,IAAMnF,KACf,KAAOoB,EAAI+D,EAAEhF,OAAQiB,IACnBpB,KAAKE,MAAMkB,GAAK+D,EAAEjF,MAAMkB,GAI5B,OAAOpB,MAITL,EAAGF,UAAU+I,IAAM,SAAczG,GAC/B,IAAI6D,EACJ,OAAqB,IAAjB7D,EAAI9B,UAAoC,IAAlBD,KAAKC,UAC7B8B,EAAI9B,SAAW,EACf2F,EAAM5F,KAAKyI,IAAI1G,GACfA,EAAI9B,UAAY,EACT2F,GACmB,IAAjB7D,EAAI9B,UAAoC,IAAlBD,KAAKC,UACpCD,KAAKC,SAAW,EAChB2F,EAAM7D,EAAI0G,IAAIzI,MACdA,KAAKC,SAAW,EACT2F,GAGL5F,KAAKG,OAAS4B,EAAI5B,OAAeH,KAAK2D,QAAQ2E,KAAKvG,GAEhDA,EAAI4B,QAAQ2E,KAAKtI,OAI1BL,EAAGF,UAAU8I,KAAO,SAAexG,GAEjC,GAAqB,IAAjBA,EAAI9B,SAAgB,CACtB8B,EAAI9B,SAAW,EACf,IAAIc,EAAIf,KAAKsI,KAAKvG,GAElB,OADAA,EAAI9B,SAAW,EACRc,EAAE+C,YAGJ,GAAsB,IAAlB9D,KAAKC,SAId,OAHAD,KAAKC,SAAW,EAChBD,KAAKsI,KAAKvG,GACV/B,KAAKC,SAAW,EACTD,KAAK8D,YAId,IAWIqB,EAAG9D,EAXHgB,EAAMrC,KAAKqC,IAAIN,GAGnB,GAAY,IAARM,EAIF,OAHArC,KAAKC,SAAW,EAChBD,KAAKG,OAAS,EACdH,KAAKE,MAAM,GAAK,EACTF,KAKLqC,EAAM,GACR8C,EAAInF,KACJqB,EAAIU,IAEJoD,EAAIpD,EACJV,EAAIrB,MAIN,IADA,IAAIsE,EAAQ,EACHlD,EAAI,EAAGA,EAAIC,EAAElB,OAAQiB,IAE5BkD,GADAvD,GAAkB,EAAboE,EAAEjF,MAAMkB,KAAwB,EAAbC,EAAEnB,MAAMkB,IAAUkD,IAC7B,GACbtE,KAAKE,MAAMkB,GAAS,SAAJL,EAElB,KAAiB,IAAVuD,GAAelD,EAAI+D,EAAEhF,OAAQiB,IAElCkD,GADAvD,GAAkB,EAAboE,EAAEjF,MAAMkB,IAAUkD,IACV,GACbtE,KAAKE,MAAMkB,GAAS,SAAJL,EAIlB,GAAc,IAAVuD,GAAelD,EAAI+D,EAAEhF,QAAUgF,IAAMnF,KACvC,KAAOoB,EAAI+D,EAAEhF,OAAQiB,IACnBpB,KAAKE,MAAMkB,GAAK+D,EAAEjF,MAAMkB,GAU5B,OANApB,KAAKG,OAASc,KAAKiB,IAAIlC,KAAKG,OAAQiB,GAEhC+D,IAAMnF,OACRA,KAAKC,SAAW,GAGXD,KAAK2C,UAIdhD,EAAGF,UAAUgJ,IAAM,SAAc1G,GAC/B,OAAO/B,KAAK2D,QAAQ4E,KAAKxG,IA+C3B,IAAI2G,EAAc,SAAsBxD,EAAMnD,EAAKsC,GACjD,IAIIe,EACAuD,EACAnC,EANArB,EAAID,EAAKhF,MACTmB,EAAIU,EAAI7B,MACR0I,EAAIvE,EAAInE,MACRoB,EAAI,EAIJuH,EAAY,EAAP1D,EAAE,GACP2D,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP7D,EAAE,GACP8D,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPhE,EAAE,GACPiE,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPnE,EAAE,GACPoE,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPtE,EAAE,GACPuE,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPzE,EAAE,GACP0E,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP5E,EAAE,GACP6E,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP/E,EAAE,GACPgF,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPlF,EAAE,GACPmF,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPrF,EAAE,GACPsF,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPtJ,EAAE,GACPuJ,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPzJ,EAAE,GACP0J,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP5J,EAAE,GACP6J,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP/J,EAAE,GACPgK,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPlK,EAAE,GACPmK,EAAW,KAALD,EACNE,GAAMF,IAAO,GACbG,GAAY,EAAPrK,EAAE,GACPsK,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAPxK,EAAE,GACPyK,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAP3K,EAAE,GACP4K,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAP9K,EAAE,GACP+K,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAPjL,EAAE,GACPkL,GAAW,KAALD,GACNE,GAAMF,KAAO,GAEjBjI,EAAIpE,SAAWiF,EAAKjF,SAAW8B,EAAI9B,SACnCoE,EAAIlE,OAAS,GAMb,IAAIsM,IAAQnL,GAJZ8D,EAAKnE,KAAKyL,KAAK5D,EAAK8B,IAIE,KAAa,MAFnCjC,GADAA,EAAM1H,KAAKyL,KAAK5D,EAAK+B,IACR5J,KAAKyL,KAAK3D,EAAK6B,GAAQ,KAEU,IAAO,EACrDtJ,IAFAkF,EAAKvF,KAAKyL,KAAK3D,EAAK8B,KAEPlC,IAAQ,IAAO,IAAM8D,KAAO,IAAO,EAChDA,IAAM,SAENrH,EAAKnE,KAAKyL,KAAKzD,EAAK2B,GAEpBjC,GADAA,EAAM1H,KAAKyL,KAAKzD,EAAK4B,IACR5J,KAAKyL,KAAKxD,EAAK0B,GAAQ,EACpCpE,EAAKvF,KAAKyL,KAAKxD,EAAK2B,GAKpB,IAAI8B,IAAQrL,GAJZ8D,EAAMA,EAAKnE,KAAKyL,KAAK5D,EAAKiC,GAAQ,GAIZ,KAAa,MAFnCpC,GADAA,EAAOA,EAAM1H,KAAKyL,KAAK5D,EAAKkC,GAAQ,GACvB/J,KAAKyL,KAAK3D,EAAKgC,GAAQ,KAEU,IAAO,EACrDzJ,IAFAkF,EAAMA,EAAKvF,KAAKyL,KAAK3D,EAAKiC,GAAQ,IAErBrC,IAAQ,IAAO,IAAMgE,KAAO,IAAO,EAChDA,IAAM,SAENvH,EAAKnE,KAAKyL,KAAKtD,EAAKwB,GAEpBjC,GADAA,EAAM1H,KAAKyL,KAAKtD,EAAKyB,IACR5J,KAAKyL,KAAKrD,EAAKuB,GAAQ,EACpCpE,EAAKvF,KAAKyL,KAAKrD,EAAKwB,GACpBzF,EAAMA,EAAKnE,KAAKyL,KAAKzD,EAAK8B,GAAQ,EAElCpC,GADAA,EAAOA,EAAM1H,KAAKyL,KAAKzD,EAAK+B,GAAQ,GACvB/J,KAAKyL,KAAKxD,EAAK6B,GAAQ,EACpCvE,EAAMA,EAAKvF,KAAKyL,KAAKxD,EAAK8B,GAAQ,EAKlC,IAAI4B,IAAQtL,GAJZ8D,EAAMA,EAAKnE,KAAKyL,KAAK5D,EAAKoC,GAAQ,GAIZ,KAAa,MAFnCvC,GADAA,EAAOA,EAAM1H,KAAKyL,KAAK5D,EAAKqC,GAAQ,GACvBlK,KAAKyL,KAAK3D,EAAKmC,GAAQ,KAEU,IAAO,EACrD5J,IAFAkF,EAAMA,EAAKvF,KAAKyL,KAAK3D,EAAKoC,GAAQ,IAErBxC,IAAQ,IAAO,IAAMiE,KAAO,IAAO,EAChDA,IAAM,SAENxH,EAAKnE,KAAKyL,KAAKnD,EAAKqB,GAEpBjC,GADAA,EAAM1H,KAAKyL,KAAKnD,EAAKsB,IACR5J,KAAKyL,KAAKlD,EAAKoB,GAAQ,EACpCpE,EAAKvF,KAAKyL,KAAKlD,EAAKqB,GACpBzF,EAAMA,EAAKnE,KAAKyL,KAAKtD,EAAK2B,GAAQ,EAElCpC,GADAA,EAAOA,EAAM1H,KAAKyL,KAAKtD,EAAK4B,GAAQ,GACvB/J,KAAKyL,KAAKrD,EAAK0B,GAAQ,EACpCvE,EAAMA,EAAKvF,KAAKyL,KAAKrD,EAAK2B,GAAQ,EAClC5F,EAAMA,EAAKnE,KAAKyL,KAAKzD,EAAKiC,GAAQ,EAElCvC,GADAA,EAAOA,EAAM1H,KAAKyL,KAAKzD,EAAKkC,GAAQ,GACvBlK,KAAKyL,KAAKxD,EAAKgC,GAAQ,EACpC1E,EAAMA,EAAKvF,KAAKyL,KAAKxD,EAAKiC,GAAQ,EAKlC,IAAI0B,IAAQvL,GAJZ8D,EAAMA,EAAKnE,KAAKyL,KAAK5D,EAAKuC,GAAQ,GAIZ,KAAa,MAFnC1C,GADAA,EAAOA,EAAM1H,KAAKyL,KAAK5D,EAAKwC,GAAQ,GACvBrK,KAAKyL,KAAK3D,EAAKsC,GAAQ,KAEU,IAAO,EACrD/J,IAFAkF,EAAMA,EAAKvF,KAAKyL,KAAK3D,EAAKuC,GAAQ,IAErB3C,IAAQ,IAAO,IAAMkE,KAAO,IAAO,EAChDA,IAAM,SAENzH,EAAKnE,KAAKyL,KAAKhD,EAAKkB,GAEpBjC,GADAA,EAAM1H,KAAKyL,KAAKhD,EAAKmB,IACR5J,KAAKyL,KAAK/C,EAAKiB,GAAQ,EACpCpE,EAAKvF,KAAKyL,KAAK/C,EAAKkB,GACpBzF,EAAMA,EAAKnE,KAAKyL,KAAKnD,EAAKwB,GAAQ,EAElCpC,GADAA,EAAOA,EAAM1H,KAAKyL,KAAKnD,EAAKyB,GAAQ,GACvB/J,KAAKyL,KAAKlD,EAAKuB,GAAQ,EACpCvE,EAAMA,EAAKvF,KAAKyL,KAAKlD,EAAKwB,GAAQ,EAClC5F,EAAMA,EAAKnE,KAAKyL,KAAKtD,EAAK8B,GAAQ,EAElCvC,GADAA,EAAOA,EAAM1H,KAAKyL,KAAKtD,EAAK+B,GAAQ,GACvBlK,KAAKyL,KAAKrD,EAAK6B,GAAQ,EACpC1E,EAAMA,EAAKvF,KAAKyL,KAAKrD,EAAK8B,GAAQ,EAClC/F,EAAMA,EAAKnE,KAAKyL,KAAKzD,EAAKoC,GAAQ,EAElC1C,GADAA,EAAOA,EAAM1H,KAAKyL,KAAKzD,EAAKqC,GAAQ,GACvBrK,KAAKyL,KAAKxD,EAAKmC,GAAQ,EACpC7E,EAAMA,EAAKvF,KAAKyL,KAAKxD,EAAKoC,GAAQ,EAKlC,IAAIwB,IAAQxL,GAJZ8D,EAAMA,EAAKnE,KAAKyL,KAAK5D,EAAK0C,GAAQ,GAIZ,KAAa,MAFnC7C,GADAA,EAAOA,EAAM1H,KAAKyL,KAAK5D,EAAK2C,IAAQ,GACvBxK,KAAKyL,KAAK3D,EAAKyC,GAAQ,KAEU,IAAO,EACrDlK,IAFAkF,EAAMA,EAAKvF,KAAKyL,KAAK3D,EAAK0C,IAAQ,IAErB9C,IAAQ,IAAO,IAAMmE,KAAO,IAAO,EAChDA,IAAM,SAEN1H,EAAKnE,KAAKyL,KAAK7C,EAAKe,GAEpBjC,GADAA,EAAM1H,KAAKyL,KAAK7C,EAAKgB,IACR5J,KAAKyL,KAAK5C,EAAKc,GAAQ,EACpCpE,EAAKvF,KAAKyL,KAAK5C,EAAKe,GACpBzF,EAAMA,EAAKnE,KAAKyL,KAAKhD,EAAKqB,GAAQ,EAElCpC,GADAA,EAAOA,EAAM1H,KAAKyL,KAAKhD,EAAKsB,GAAQ,GACvB/J,KAAKyL,KAAK/C,EAAKoB,GAAQ,EACpCvE,EAAMA,EAAKvF,KAAKyL,KAAK/C,EAAKqB,GAAQ,EAClC5F,EAAMA,EAAKnE,KAAKyL,KAAKnD,EAAK2B,GAAQ,EAElCvC,GADAA,EAAOA,EAAM1H,KAAKyL,KAAKnD,EAAK4B,GAAQ,GACvBlK,KAAKyL,KAAKlD,EAAK0B,GAAQ,EACpC1E,EAAMA,EAAKvF,KAAKyL,KAAKlD,EAAK2B,GAAQ,EAClC/F,EAAMA,EAAKnE,KAAKyL,KAAKtD,EAAKiC,GAAQ,EAElC1C,GADAA,EAAOA,EAAM1H,KAAKyL,KAAKtD,EAAKkC,GAAQ,GACvBrK,KAAKyL,KAAKrD,EAAKgC,GAAQ,EACpC7E,EAAMA,EAAKvF,KAAKyL,KAAKrD,EAAKiC,GAAQ,EAClClG,EAAMA,EAAKnE,KAAKyL,KAAKzD,EAAKuC,GAAQ,EAElC7C,GADAA,EAAOA,EAAM1H,KAAKyL,KAAKzD,EAAKwC,IAAQ,GACvBxK,KAAKyL,KAAKxD,EAAKsC,GAAQ,EACpChF,EAAMA,EAAKvF,KAAKyL,KAAKxD,EAAKuC,IAAQ,EAKlC,IAAIsB,IAAQzL,GAJZ8D,EAAMA,EAAKnE,KAAKyL,KAAK5D,EAAK6C,IAAQ,GAIZ,KAAa,MAFnChD,GADAA,EAAOA,EAAM1H,KAAKyL,KAAK5D,EAAK8C,IAAQ,GACvB3K,KAAKyL,KAAK3D,EAAK4C,IAAQ,KAEU,IAAO,EACrDrK,IAFAkF,EAAMA,EAAKvF,KAAKyL,KAAK3D,EAAK6C,IAAQ,IAErBjD,IAAQ,IAAO,IAAMoE,KAAO,IAAO,EAChDA,IAAM,SAEN3H,EAAKnE,KAAKyL,KAAK1C,EAAKY,GAEpBjC,GADAA,EAAM1H,KAAKyL,KAAK1C,EAAKa,IACR5J,KAAKyL,KAAKzC,EAAKW,GAAQ,EACpCpE,EAAKvF,KAAKyL,KAAKzC,EAAKY,GACpBzF,EAAMA,EAAKnE,KAAKyL,KAAK7C,EAAKkB,GAAQ,EAElCpC,GADAA,EAAOA,EAAM1H,KAAKyL,KAAK7C,EAAKmB,GAAQ,GACvB/J,KAAKyL,KAAK5C,EAAKiB,GAAQ,EACpCvE,EAAMA,EAAKvF,KAAKyL,KAAK5C,EAAKkB,GAAQ,EAClC5F,EAAMA,EAAKnE,KAAKyL,KAAKhD,EAAKwB,GAAQ,EAElCvC,GADAA,EAAOA,EAAM1H,KAAKyL,KAAKhD,EAAKyB,GAAQ,GACvBlK,KAAKyL,KAAK/C,EAAKuB,GAAQ,EACpC1E,EAAMA,EAAKvF,KAAKyL,KAAK/C,EAAKwB,GAAQ,EAClC/F,EAAMA,EAAKnE,KAAKyL,KAAKnD,EAAK8B,GAAQ,EAElC1C,GADAA,EAAOA,EAAM1H,KAAKyL,KAAKnD,EAAK+B,GAAQ,GACvBrK,KAAKyL,KAAKlD,EAAK6B,GAAQ,EACpC7E,EAAMA,EAAKvF,KAAKyL,KAAKlD,EAAK8B,GAAQ,EAClClG,EAAMA,EAAKnE,KAAKyL,KAAKtD,EAAKoC,GAAQ,EAElC7C,GADAA,EAAOA,EAAM1H,KAAKyL,KAAKtD,EAAKqC,IAAQ,GACvBxK,KAAKyL,KAAKrD,EAAKmC,GAAQ,EACpChF,EAAMA,EAAKvF,KAAKyL,KAAKrD,EAAKoC,IAAQ,EAClCrG,EAAMA,EAAKnE,KAAKyL,KAAKzD,EAAK0C,IAAQ,EAElChD,GADAA,EAAOA,EAAM1H,KAAKyL,KAAKzD,EAAK2C,IAAQ,GACvB3K,KAAKyL,KAAKxD,EAAKyC,IAAQ,EACpCnF,EAAMA,EAAKvF,KAAKyL,KAAKxD,EAAK0C,IAAQ,EAKlC,IAAIoB,IAAQ1L,GAJZ8D,EAAMA,EAAKnE,KAAKyL,KAAK5D,EAAKgD,IAAQ,GAIZ,KAAa,MAFnCnD,GADAA,EAAOA,EAAM1H,KAAKyL,KAAK5D,EAAKiD,IAAQ,GACvB9K,KAAKyL,KAAK3D,EAAK+C,IAAQ,KAEU,IAAO,EACrDxK,IAFAkF,EAAMA,EAAKvF,KAAKyL,KAAK3D,EAAKgD,IAAQ,IAErBpD,IAAQ,IAAO,IAAMqE,KAAO,IAAO,EAChDA,IAAM,SAEN5H,EAAKnE,KAAKyL,KAAKvC,EAAKS,GAEpBjC,GADAA,EAAM1H,KAAKyL,KAAKvC,EAAKU,IACR5J,KAAKyL,KAAKtC,EAAKQ,GAAQ,EACpCpE,EAAKvF,KAAKyL,KAAKtC,EAAKS,GACpBzF,EAAMA,EAAKnE,KAAKyL,KAAK1C,EAAKe,GAAQ,EAElCpC,GADAA,EAAOA,EAAM1H,KAAKyL,KAAK1C,EAAKgB,GAAQ,GACvB/J,KAAKyL,KAAKzC,EAAKc,GAAQ,EACpCvE,EAAMA,EAAKvF,KAAKyL,KAAKzC,EAAKe,GAAQ,EAClC5F,EAAMA,EAAKnE,KAAKyL,KAAK7C,EAAKqB,GAAQ,EAElCvC,GADAA,EAAOA,EAAM1H,KAAKyL,KAAK7C,EAAKsB,GAAQ,GACvBlK,KAAKyL,KAAK5C,EAAKoB,GAAQ,EACpC1E,EAAMA,EAAKvF,KAAKyL,KAAK5C,EAAKqB,GAAQ,EAClC/F,EAAMA,EAAKnE,KAAKyL,KAAKhD,EAAK2B,GAAQ,EAElC1C,GADAA,EAAOA,EAAM1H,KAAKyL,KAAKhD,EAAK4B,GAAQ,GACvBrK,KAAKyL,KAAK/C,EAAK0B,GAAQ,EACpC7E,EAAMA,EAAKvF,KAAKyL,KAAK/C,EAAK2B,GAAQ,EAClClG,EAAMA,EAAKnE,KAAKyL,KAAKnD,EAAKiC,GAAQ,EAElC7C,GADAA,EAAOA,EAAM1H,KAAKyL,KAAKnD,EAAKkC,IAAQ,GACvBxK,KAAKyL,KAAKlD,EAAKgC,GAAQ,EACpChF,EAAMA,EAAKvF,KAAKyL,KAAKlD,EAAKiC,IAAQ,EAClCrG,EAAMA,EAAKnE,KAAKyL,KAAKtD,EAAKuC,IAAQ,EAElChD,GADAA,EAAOA,EAAM1H,KAAKyL,KAAKtD,EAAKwC,IAAQ,GACvB3K,KAAKyL,KAAKrD,EAAKsC,IAAQ,EACpCnF,EAAMA,EAAKvF,KAAKyL,KAAKrD,EAAKuC,IAAQ,EAClCxG,EAAMA,EAAKnE,KAAKyL,KAAKzD,EAAK6C,IAAQ,EAElCnD,GADAA,EAAOA,EAAM1H,KAAKyL,KAAKzD,EAAK8C,IAAQ,GACvB9K,KAAKyL,KAAKxD,EAAK4C,IAAQ,EACpCtF,EAAMA,EAAKvF,KAAKyL,KAAKxD,EAAK6C,IAAQ,EAKlC,IAAIkB,IAAQ3L,GAJZ8D,EAAMA,EAAKnE,KAAKyL,KAAK5D,EAAKmD,IAAQ,GAIZ,KAAa,MAFnCtD,GADAA,EAAOA,EAAM1H,KAAKyL,KAAK5D,EAAKoD,IAAQ,GACvBjL,KAAKyL,KAAK3D,EAAKkD,IAAQ,KAEU,IAAO,EACrD3K,IAFAkF,EAAMA,EAAKvF,KAAKyL,KAAK3D,EAAKmD,IAAQ,IAErBvD,IAAQ,IAAO,IAAMsE,KAAO,IAAO,EAChDA,IAAM,SAEN7H,EAAKnE,KAAKyL,KAAKpC,EAAKM,GAEpBjC,GADAA,EAAM1H,KAAKyL,KAAKpC,EAAKO,IACR5J,KAAKyL,KAAKnC,EAAKK,GAAQ,EACpCpE,EAAKvF,KAAKyL,KAAKnC,EAAKM,GACpBzF,EAAMA,EAAKnE,KAAKyL,KAAKvC,EAAKY,GAAQ,EAElCpC,GADAA,EAAOA,EAAM1H,KAAKyL,KAAKvC,EAAKa,GAAQ,GACvB/J,KAAKyL,KAAKtC,EAAKW,GAAQ,EACpCvE,EAAMA,EAAKvF,KAAKyL,KAAKtC,EAAKY,GAAQ,EAClC5F,EAAMA,EAAKnE,KAAKyL,KAAK1C,EAAKkB,GAAQ,EAElCvC,GADAA,EAAOA,EAAM1H,KAAKyL,KAAK1C,EAAKmB,GAAQ,GACvBlK,KAAKyL,KAAKzC,EAAKiB,GAAQ,EACpC1E,EAAMA,EAAKvF,KAAKyL,KAAKzC,EAAKkB,GAAQ,EAClC/F,EAAMA,EAAKnE,KAAKyL,KAAK7C,EAAKwB,GAAQ,EAElC1C,GADAA,EAAOA,EAAM1H,KAAKyL,KAAK7C,EAAKyB,GAAQ,GACvBrK,KAAKyL,KAAK5C,EAAKuB,GAAQ,EACpC7E,EAAMA,EAAKvF,KAAKyL,KAAK5C,EAAKwB,GAAQ,EAClClG,EAAMA,EAAKnE,KAAKyL,KAAKhD,EAAK8B,GAAQ,EAElC7C,GADAA,EAAOA,EAAM1H,KAAKyL,KAAKhD,EAAK+B,IAAQ,GACvBxK,KAAKyL,KAAK/C,EAAK6B,GAAQ,EACpChF,EAAMA,EAAKvF,KAAKyL,KAAK/C,EAAK8B,IAAQ,EAClCrG,EAAMA,EAAKnE,KAAKyL,KAAKnD,EAAKoC,IAAQ,EAElChD,GADAA,EAAOA,EAAM1H,KAAKyL,KAAKnD,EAAKqC,IAAQ,GACvB3K,KAAKyL,KAAKlD,EAAKmC,IAAQ,EACpCnF,EAAMA,EAAKvF,KAAKyL,KAAKlD,EAAKoC,IAAQ,EAClCxG,EAAMA,EAAKnE,KAAKyL,KAAKtD,EAAK0C,IAAQ,EAElCnD,GADAA,EAAOA,EAAM1H,KAAKyL,KAAKtD,EAAK2C,IAAQ,GACvB9K,KAAKyL,KAAKrD,EAAKyC,IAAQ,EACpCtF,EAAMA,EAAKvF,KAAKyL,KAAKrD,EAAK0C,IAAQ,EAClC3G,EAAMA,EAAKnE,KAAKyL,KAAKzD,EAAKgD,IAAQ,EAElCtD,GADAA,EAAOA,EAAM1H,KAAKyL,KAAKzD,EAAKiD,IAAQ,GACvBjL,KAAKyL,KAAKxD,EAAK+C,IAAQ,EACpCzF,EAAMA,EAAKvF,KAAKyL,KAAKxD,EAAKgD,IAAQ,EAKlC,IAAIgB,IAAQ5L,GAJZ8D,EAAMA,EAAKnE,KAAKyL,KAAK5D,EAAKsD,IAAQ,GAIZ,KAAa,MAFnCzD,GADAA,EAAOA,EAAM1H,KAAKyL,KAAK5D,EAAKuD,IAAQ,GACvBpL,KAAKyL,KAAK3D,EAAKqD,IAAQ,KAEU,IAAO,EACrD9K,IAFAkF,EAAMA,EAAKvF,KAAKyL,KAAK3D,EAAKsD,IAAQ,IAErB1D,IAAQ,IAAO,IAAMuE,KAAO,IAAO,EAChDA,IAAM,SAEN9H,EAAKnE,KAAKyL,KAAKjC,EAAKG,GAEpBjC,GADAA,EAAM1H,KAAKyL,KAAKjC,EAAKI,IACR5J,KAAKyL,KAAKhC,EAAKE,GAAQ,EACpCpE,EAAKvF,KAAKyL,KAAKhC,EAAKG,GACpBzF,EAAMA,EAAKnE,KAAKyL,KAAKpC,EAAKS,GAAQ,EAElCpC,GADAA,EAAOA,EAAM1H,KAAKyL,KAAKpC,EAAKU,GAAQ,GACvB/J,KAAKyL,KAAKnC,EAAKQ,GAAQ,EACpCvE,EAAMA,EAAKvF,KAAKyL,KAAKnC,EAAKS,GAAQ,EAClC5F,EAAMA,EAAKnE,KAAKyL,KAAKvC,EAAKe,GAAQ,EAElCvC,GADAA,EAAOA,EAAM1H,KAAKyL,KAAKvC,EAAKgB,GAAQ,GACvBlK,KAAKyL,KAAKtC,EAAKc,GAAQ,EACpC1E,EAAMA,EAAKvF,KAAKyL,KAAKtC,EAAKe,GAAQ,EAClC/F,EAAMA,EAAKnE,KAAKyL,KAAK1C,EAAKqB,GAAQ,EAElC1C,GADAA,EAAOA,EAAM1H,KAAKyL,KAAK1C,EAAKsB,GAAQ,GACvBrK,KAAKyL,KAAKzC,EAAKoB,GAAQ,EACpC7E,EAAMA,EAAKvF,KAAKyL,KAAKzC,EAAKqB,GAAQ,EAClClG,EAAMA,EAAKnE,KAAKyL,KAAK7C,EAAK2B,GAAQ,EAElC7C,GADAA,EAAOA,EAAM1H,KAAKyL,KAAK7C,EAAK4B,IAAQ,GACvBxK,KAAKyL,KAAK5C,EAAK0B,GAAQ,EACpChF,EAAMA,EAAKvF,KAAKyL,KAAK5C,EAAK2B,IAAQ,EAClCrG,EAAMA,EAAKnE,KAAKyL,KAAKhD,EAAKiC,IAAQ,EAElChD,GADAA,EAAOA,EAAM1H,KAAKyL,KAAKhD,EAAKkC,IAAQ,GACvB3K,KAAKyL,KAAK/C,EAAKgC,IAAQ,EACpCnF,EAAMA,EAAKvF,KAAKyL,KAAK/C,EAAKiC,IAAQ,EAClCxG,EAAMA,EAAKnE,KAAKyL,KAAKnD,EAAKuC,IAAQ,EAElCnD,GADAA,EAAOA,EAAM1H,KAAKyL,KAAKnD,EAAKwC,IAAQ,GACvB9K,KAAKyL,KAAKlD,EAAKsC,IAAQ,EACpCtF,EAAMA,EAAKvF,KAAKyL,KAAKlD,EAAKuC,IAAQ,EAClC3G,EAAMA,EAAKnE,KAAKyL,KAAKtD,EAAK6C,IAAQ,EAElCtD,GADAA,EAAOA,EAAM1H,KAAKyL,KAAKtD,EAAK8C,IAAQ,GACvBjL,KAAKyL,KAAKrD,EAAK4C,IAAQ,EACpCzF,EAAMA,EAAKvF,KAAKyL,KAAKrD,EAAK6C,IAAQ,EAClC9G,EAAMA,EAAKnE,KAAKyL,KAAKzD,EAAKmD,IAAQ,EAElCzD,GADAA,EAAOA,EAAM1H,KAAKyL,KAAKzD,EAAKoD,IAAQ,GACvBpL,KAAKyL,KAAKxD,EAAKkD,IAAQ,EACpC5F,EAAMA,EAAKvF,KAAKyL,KAAKxD,EAAKmD,IAAQ,EAKlC,IAAIc,IAAQ7L,GAJZ8D,EAAMA,EAAKnE,KAAKyL,KAAK5D,EAAKyD,IAAQ,GAIZ,KAAa,MAFnC5D,GADAA,EAAOA,EAAM1H,KAAKyL,KAAK5D,EAAK0D,IAAQ,GACvBvL,KAAKyL,KAAK3D,EAAKwD,IAAQ,KAEU,IAAO,EACrDjL,IAFAkF,EAAMA,EAAKvF,KAAKyL,KAAK3D,EAAKyD,IAAQ,IAErB7D,IAAQ,IAAO,IAAMwE,KAAO,IAAO,EAChDA,IAAM,SAEN/H,EAAKnE,KAAKyL,KAAKjC,EAAKM,GAEpBpC,GADAA,EAAM1H,KAAKyL,KAAKjC,EAAKO,IACR/J,KAAKyL,KAAKhC,EAAKK,GAAQ,EACpCvE,EAAKvF,KAAKyL,KAAKhC,EAAKM,GACpB5F,EAAMA,EAAKnE,KAAKyL,KAAKpC,EAAKY,GAAQ,EAElCvC,GADAA,EAAOA,EAAM1H,KAAKyL,KAAKpC,EAAKa,GAAQ,GACvBlK,KAAKyL,KAAKnC,EAAKW,GAAQ,EACpC1E,EAAMA,EAAKvF,KAAKyL,KAAKnC,EAAKY,GAAQ,EAClC/F,EAAMA,EAAKnE,KAAKyL,KAAKvC,EAAKkB,GAAQ,EAElC1C,GADAA,EAAOA,EAAM1H,KAAKyL,KAAKvC,EAAKmB,GAAQ,GACvBrK,KAAKyL,KAAKtC,EAAKiB,GAAQ,EACpC7E,EAAMA,EAAKvF,KAAKyL,KAAKtC,EAAKkB,GAAQ,EAClClG,EAAMA,EAAKnE,KAAKyL,KAAK1C,EAAKwB,GAAQ,EAElC7C,GADAA,EAAOA,EAAM1H,KAAKyL,KAAK1C,EAAKyB,IAAQ,GACvBxK,KAAKyL,KAAKzC,EAAKuB,GAAQ,EACpChF,EAAMA,EAAKvF,KAAKyL,KAAKzC,EAAKwB,IAAQ,EAClCrG,EAAMA,EAAKnE,KAAKyL,KAAK7C,EAAK8B,IAAQ,EAElChD,GADAA,EAAOA,EAAM1H,KAAKyL,KAAK7C,EAAK+B,IAAQ,GACvB3K,KAAKyL,KAAK5C,EAAK6B,IAAQ,EACpCnF,EAAMA,EAAKvF,KAAKyL,KAAK5C,EAAK8B,IAAQ,EAClCxG,EAAMA,EAAKnE,KAAKyL,KAAKhD,EAAKoC,IAAQ,EAElCnD,GADAA,EAAOA,EAAM1H,KAAKyL,KAAKhD,EAAKqC,IAAQ,GACvB9K,KAAKyL,KAAK/C,EAAKmC,IAAQ,EACpCtF,EAAMA,EAAKvF,KAAKyL,KAAK/C,EAAKoC,IAAQ,EAClC3G,EAAMA,EAAKnE,KAAKyL,KAAKnD,EAAK0C,IAAQ,EAElCtD,GADAA,EAAOA,EAAM1H,KAAKyL,KAAKnD,EAAK2C,IAAQ,GACvBjL,KAAKyL,KAAKlD,EAAKyC,IAAQ,EACpCzF,EAAMA,EAAKvF,KAAKyL,KAAKlD,EAAK0C,IAAQ,EAClC9G,EAAMA,EAAKnE,KAAKyL,KAAKtD,EAAKgD,IAAQ,EAElCzD,GADAA,EAAOA,EAAM1H,KAAKyL,KAAKtD,EAAKiD,IAAQ,GACvBpL,KAAKyL,KAAKrD,EAAK+C,IAAQ,EACpC5F,EAAMA,EAAKvF,KAAKyL,KAAKrD,EAAKgD,IAAQ,EAKlC,IAAIe,IAAS9L,GAJb8D,EAAMA,EAAKnE,KAAKyL,KAAKzD,EAAKsD,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM1H,KAAKyL,KAAKzD,EAAKuD,IAAQ,GACvBvL,KAAKyL,KAAKxD,EAAKqD,IAAQ,KAEW,IAAO,EACtDjL,IAFAkF,EAAMA,EAAKvF,KAAKyL,KAAKxD,EAAKsD,IAAQ,IAErB7D,IAAQ,IAAO,IAAMyE,KAAQ,IAAO,EACjDA,IAAO,SAEPhI,EAAKnE,KAAKyL,KAAKjC,EAAKS,GAEpBvC,GADAA,EAAM1H,KAAKyL,KAAKjC,EAAKU,IACRlK,KAAKyL,KAAKhC,EAAKQ,GAAQ,EACpC1E,EAAKvF,KAAKyL,KAAKhC,EAAKS,GACpB/F,EAAMA,EAAKnE,KAAKyL,KAAKpC,EAAKe,GAAQ,EAElC1C,GADAA,EAAOA,EAAM1H,KAAKyL,KAAKpC,EAAKgB,GAAQ,GACvBrK,KAAKyL,KAAKnC,EAAKc,GAAQ,EACpC7E,EAAMA,EAAKvF,KAAKyL,KAAKnC,EAAKe,GAAQ,EAClClG,EAAMA,EAAKnE,KAAKyL,KAAKvC,EAAKqB,GAAQ,EAElC7C,GADAA,EAAOA,EAAM1H,KAAKyL,KAAKvC,EAAKsB,IAAQ,GACvBxK,KAAKyL,KAAKtC,EAAKoB,GAAQ,EACpChF,EAAMA,EAAKvF,KAAKyL,KAAKtC,EAAKqB,IAAQ,EAClCrG,EAAMA,EAAKnE,KAAKyL,KAAK1C,EAAK2B,IAAQ,EAElChD,GADAA,EAAOA,EAAM1H,KAAKyL,KAAK1C,EAAK4B,IAAQ,GACvB3K,KAAKyL,KAAKzC,EAAK0B,IAAQ,EACpCnF,EAAMA,EAAKvF,KAAKyL,KAAKzC,EAAK2B,IAAQ,EAClCxG,EAAMA,EAAKnE,KAAKyL,KAAK7C,EAAKiC,IAAQ,EAElCnD,GADAA,EAAOA,EAAM1H,KAAKyL,KAAK7C,EAAKkC,IAAQ,GACvB9K,KAAKyL,KAAK5C,EAAKgC,IAAQ,EACpCtF,EAAMA,EAAKvF,KAAKyL,KAAK5C,EAAKiC,IAAQ,EAClC3G,EAAMA,EAAKnE,KAAKyL,KAAKhD,EAAKuC,IAAQ,EAElCtD,GADAA,EAAOA,EAAM1H,KAAKyL,KAAKhD,EAAKwC,IAAQ,GACvBjL,KAAKyL,KAAK/C,EAAKsC,IAAQ,EACpCzF,EAAMA,EAAKvF,KAAKyL,KAAK/C,EAAKuC,IAAQ,EAClC9G,EAAMA,EAAKnE,KAAKyL,KAAKnD,EAAK6C,IAAQ,EAElCzD,GADAA,EAAOA,EAAM1H,KAAKyL,KAAKnD,EAAK8C,IAAQ,GACvBpL,KAAKyL,KAAKlD,EAAK4C,IAAQ,EACpC5F,EAAMA,EAAKvF,KAAKyL,KAAKlD,EAAK6C,IAAQ,EAKlC,IAAIgB,IAAS/L,GAJb8D,EAAMA,EAAKnE,KAAKyL,KAAKtD,EAAKmD,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM1H,KAAKyL,KAAKtD,EAAKoD,IAAQ,GACvBvL,KAAKyL,KAAKrD,EAAKkD,IAAQ,KAEW,IAAO,EACtDjL,IAFAkF,EAAMA,EAAKvF,KAAKyL,KAAKrD,EAAKmD,IAAQ,IAErB7D,IAAQ,IAAO,IAAM0E,KAAQ,IAAO,EACjDA,IAAO,SAEPjI,EAAKnE,KAAKyL,KAAKjC,EAAKY,GAEpB1C,GADAA,EAAM1H,KAAKyL,KAAKjC,EAAKa,IACRrK,KAAKyL,KAAKhC,EAAKW,GAAQ,EACpC7E,EAAKvF,KAAKyL,KAAKhC,EAAKY,GACpBlG,EAAMA,EAAKnE,KAAKyL,KAAKpC,EAAKkB,GAAQ,EAElC7C,GADAA,EAAOA,EAAM1H,KAAKyL,KAAKpC,EAAKmB,IAAQ,GACvBxK,KAAKyL,KAAKnC,EAAKiB,GAAQ,EACpChF,EAAMA,EAAKvF,KAAKyL,KAAKnC,EAAKkB,IAAQ,EAClCrG,EAAMA,EAAKnE,KAAKyL,KAAKvC,EAAKwB,IAAQ,EAElChD,GADAA,EAAOA,EAAM1H,KAAKyL,KAAKvC,EAAKyB,IAAQ,GACvB3K,KAAKyL,KAAKtC,EAAKuB,IAAQ,EACpCnF,EAAMA,EAAKvF,KAAKyL,KAAKtC,EAAKwB,IAAQ,EAClCxG,EAAMA,EAAKnE,KAAKyL,KAAK1C,EAAK8B,IAAQ,EAElCnD,GADAA,EAAOA,EAAM1H,KAAKyL,KAAK1C,EAAK+B,IAAQ,GACvB9K,KAAKyL,KAAKzC,EAAK6B,IAAQ,EACpCtF,EAAMA,EAAKvF,KAAKyL,KAAKzC,EAAK8B,IAAQ,EAClC3G,EAAMA,EAAKnE,KAAKyL,KAAK7C,EAAKoC,IAAQ,EAElCtD,GADAA,EAAOA,EAAM1H,KAAKyL,KAAK7C,EAAKqC,IAAQ,GACvBjL,KAAKyL,KAAK5C,EAAKmC,IAAQ,EACpCzF,EAAMA,EAAKvF,KAAKyL,KAAK5C,EAAKoC,IAAQ,EAClC9G,EAAMA,EAAKnE,KAAKyL,KAAKhD,EAAK0C,IAAQ,EAElCzD,GADAA,EAAOA,EAAM1H,KAAKyL,KAAKhD,EAAK2C,IAAQ,GACvBpL,KAAKyL,KAAK/C,EAAKyC,IAAQ,EACpC5F,EAAMA,EAAKvF,KAAKyL,KAAK/C,EAAK0C,IAAQ,EAKlC,IAAIiB,IAAShM,GAJb8D,EAAMA,EAAKnE,KAAKyL,KAAKnD,EAAKgD,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM1H,KAAKyL,KAAKnD,EAAKiD,IAAQ,GACvBvL,KAAKyL,KAAKlD,EAAK+C,IAAQ,KAEW,IAAO,EACtDjL,IAFAkF,EAAMA,EAAKvF,KAAKyL,KAAKlD,EAAKgD,IAAQ,IAErB7D,IAAQ,IAAO,IAAM2E,KAAQ,IAAO,EACjDA,IAAO,SAEPlI,EAAKnE,KAAKyL,KAAKjC,EAAKe,GAEpB7C,GADAA,EAAM1H,KAAKyL,KAAKjC,EAAKgB,KACRxK,KAAKyL,KAAKhC,EAAKc,GAAQ,EACpChF,EAAKvF,KAAKyL,KAAKhC,EAAKe,IACpBrG,EAAMA,EAAKnE,KAAKyL,KAAKpC,EAAKqB,IAAQ,EAElChD,GADAA,EAAOA,EAAM1H,KAAKyL,KAAKpC,EAAKsB,IAAQ,GACvB3K,KAAKyL,KAAKnC,EAAKoB,IAAQ,EACpCnF,EAAMA,EAAKvF,KAAKyL,KAAKnC,EAAKqB,IAAQ,EAClCxG,EAAMA,EAAKnE,KAAKyL,KAAKvC,EAAK2B,IAAQ,EAElCnD,GADAA,EAAOA,EAAM1H,KAAKyL,KAAKvC,EAAK4B,IAAQ,GACvB9K,KAAKyL,KAAKtC,EAAK0B,IAAQ,EACpCtF,EAAMA,EAAKvF,KAAKyL,KAAKtC,EAAK2B,IAAQ,EAClC3G,EAAMA,EAAKnE,KAAKyL,KAAK1C,EAAKiC,IAAQ,EAElCtD,GADAA,EAAOA,EAAM1H,KAAKyL,KAAK1C,EAAKkC,IAAQ,GACvBjL,KAAKyL,KAAKzC,EAAKgC,IAAQ,EACpCzF,EAAMA,EAAKvF,KAAKyL,KAAKzC,EAAKiC,IAAQ,EAClC9G,EAAMA,EAAKnE,KAAKyL,KAAK7C,EAAKuC,IAAQ,EAElCzD,GADAA,EAAOA,EAAM1H,KAAKyL,KAAK7C,EAAKwC,IAAQ,GACvBpL,KAAKyL,KAAK5C,EAAKsC,IAAQ,EACpC5F,EAAMA,EAAKvF,KAAKyL,KAAK5C,EAAKuC,IAAQ,EAKlC,IAAIkB,IAASjM,GAJb8D,EAAMA,EAAKnE,KAAKyL,KAAKhD,EAAK6C,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM1H,KAAKyL,KAAKhD,EAAK8C,IAAQ,GACvBvL,KAAKyL,KAAK/C,EAAK4C,IAAQ,KAEW,IAAO,EACtDjL,IAFAkF,EAAMA,EAAKvF,KAAKyL,KAAK/C,EAAK6C,IAAQ,IAErB7D,IAAQ,IAAO,IAAM4E,KAAQ,IAAO,EACjDA,IAAO,SAEPnI,EAAKnE,KAAKyL,KAAKjC,EAAKkB,IAEpBhD,GADAA,EAAM1H,KAAKyL,KAAKjC,EAAKmB,KACR3K,KAAKyL,KAAKhC,EAAKiB,IAAQ,EACpCnF,EAAKvF,KAAKyL,KAAKhC,EAAKkB,IACpBxG,EAAMA,EAAKnE,KAAKyL,KAAKpC,EAAKwB,IAAQ,EAElCnD,GADAA,EAAOA,EAAM1H,KAAKyL,KAAKpC,EAAKyB,IAAQ,GACvB9K,KAAKyL,KAAKnC,EAAKuB,IAAQ,EACpCtF,EAAMA,EAAKvF,KAAKyL,KAAKnC,EAAKwB,IAAQ,EAClC3G,EAAMA,EAAKnE,KAAKyL,KAAKvC,EAAK8B,IAAQ,EAElCtD,GADAA,EAAOA,EAAM1H,KAAKyL,KAAKvC,EAAK+B,IAAQ,GACvBjL,KAAKyL,KAAKtC,EAAK6B,IAAQ,EACpCzF,EAAMA,EAAKvF,KAAKyL,KAAKtC,EAAK8B,IAAQ,EAClC9G,EAAMA,EAAKnE,KAAKyL,KAAK1C,EAAKoC,IAAQ,EAElCzD,GADAA,EAAOA,EAAM1H,KAAKyL,KAAK1C,EAAKqC,IAAQ,GACvBpL,KAAKyL,KAAKzC,EAAKmC,IAAQ,EACpC5F,EAAMA,EAAKvF,KAAKyL,KAAKzC,EAAKoC,IAAQ,EAKlC,IAAImB,IAASlM,GAJb8D,EAAMA,EAAKnE,KAAKyL,KAAK7C,EAAK0C,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM1H,KAAKyL,KAAK7C,EAAK2C,IAAQ,GACvBvL,KAAKyL,KAAK5C,EAAKyC,IAAQ,KAEW,IAAO,EACtDjL,IAFAkF,EAAMA,EAAKvF,KAAKyL,KAAK5C,EAAK0C,IAAQ,IAErB7D,IAAQ,IAAO,IAAM6E,KAAQ,IAAO,EACjDA,IAAO,SAEPpI,EAAKnE,KAAKyL,KAAKjC,EAAKqB,IAEpBnD,GADAA,EAAM1H,KAAKyL,KAAKjC,EAAKsB,KACR9K,KAAKyL,KAAKhC,EAAKoB,IAAQ,EACpCtF,EAAKvF,KAAKyL,KAAKhC,EAAKqB,IACpB3G,EAAMA,EAAKnE,KAAKyL,KAAKpC,EAAK2B,IAAQ,EAElCtD,GADAA,EAAOA,EAAM1H,KAAKyL,KAAKpC,EAAK4B,IAAQ,GACvBjL,KAAKyL,KAAKnC,EAAK0B,IAAQ,EACpCzF,EAAMA,EAAKvF,KAAKyL,KAAKnC,EAAK2B,IAAQ,EAClC9G,EAAMA,EAAKnE,KAAKyL,KAAKvC,EAAKiC,IAAQ,EAElCzD,GADAA,EAAOA,EAAM1H,KAAKyL,KAAKvC,EAAKkC,IAAQ,GACvBpL,KAAKyL,KAAKtC,EAAKgC,IAAQ,EACpC5F,EAAMA,EAAKvF,KAAKyL,KAAKtC,EAAKiC,IAAQ,EAKlC,IAAIoB,IAASnM,GAJb8D,EAAMA,EAAKnE,KAAKyL,KAAK1C,EAAKuC,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM1H,KAAKyL,KAAK1C,EAAKwC,IAAQ,GACvBvL,KAAKyL,KAAKzC,EAAKsC,IAAQ,KAEW,IAAO,EACtDjL,IAFAkF,EAAMA,EAAKvF,KAAKyL,KAAKzC,EAAKuC,IAAQ,IAErB7D,IAAQ,IAAO,IAAM8E,KAAQ,IAAO,EACjDA,IAAO,SAEPrI,EAAKnE,KAAKyL,KAAKjC,EAAKwB,IAEpBtD,GADAA,EAAM1H,KAAKyL,KAAKjC,EAAKyB,KACRjL,KAAKyL,KAAKhC,EAAKuB,IAAQ,EACpCzF,EAAKvF,KAAKyL,KAAKhC,EAAKwB,IACpB9G,EAAMA,EAAKnE,KAAKyL,KAAKpC,EAAK8B,IAAQ,EAElCzD,GADAA,EAAOA,EAAM1H,KAAKyL,KAAKpC,EAAK+B,IAAQ,GACvBpL,KAAKyL,KAAKnC,EAAK6B,IAAQ,EACpC5F,EAAMA,EAAKvF,KAAKyL,KAAKnC,EAAK8B,IAAQ,EAKlC,IAAIqB,IAASpM,GAJb8D,EAAMA,EAAKnE,KAAKyL,KAAKvC,EAAKoC,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM1H,KAAKyL,KAAKvC,EAAKqC,IAAQ,GACvBvL,KAAKyL,KAAKtC,EAAKmC,IAAQ,KAEW,IAAO,EACtDjL,IAFAkF,EAAMA,EAAKvF,KAAKyL,KAAKtC,EAAKoC,IAAQ,IAErB7D,IAAQ,IAAO,IAAM+E,KAAQ,IAAO,EACjDA,IAAO,SAEPtI,EAAKnE,KAAKyL,KAAKjC,EAAK2B,IAEpBzD,GADAA,EAAM1H,KAAKyL,KAAKjC,EAAK4B,KACRpL,KAAKyL,KAAKhC,EAAK0B,IAAQ,EACpC5F,EAAKvF,KAAKyL,KAAKhC,EAAK2B,IAKpB,IAAIsB,IAASrM,GAJb8D,EAAMA,EAAKnE,KAAKyL,KAAKpC,EAAKiC,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM1H,KAAKyL,KAAKpC,EAAKkC,IAAQ,GACvBvL,KAAKyL,KAAKnC,EAAKgC,IAAQ,KAEW,IAAO,EACtDjL,IAFAkF,EAAMA,EAAKvF,KAAKyL,KAAKnC,EAAKiC,IAAQ,IAErB7D,IAAQ,IAAO,IAAMgF,KAAQ,IAAO,EACjDA,IAAO,SAMP,IAAIC,IAAStM,GAJb8D,EAAKnE,KAAKyL,KAAKjC,EAAK8B,KAIG,KAAa,MAFpC5D,GADAA,EAAM1H,KAAKyL,KAAKjC,EAAK+B,KACRvL,KAAKyL,KAAKhC,EAAK6B,IAAQ,KAEW,IAAO,EA0BtD,OAzBAjL,IAFAkF,EAAKvF,KAAKyL,KAAKhC,EAAK8B,MAEP7D,IAAQ,IAAO,IAAMiF,KAAQ,IAAO,EACjDA,IAAO,SACPhF,EAAE,GAAK6D,GACP7D,EAAE,GAAK+D,GACP/D,EAAE,GAAKgE,GACPhE,EAAE,GAAKiE,GACPjE,EAAE,GAAKkE,GACPlE,EAAE,GAAKmE,GACPnE,EAAE,GAAKoE,GACPpE,EAAE,GAAKqE,GACPrE,EAAE,GAAKsE,GACPtE,EAAE,GAAKuE,GACPvE,EAAE,IAAMwE,GACRxE,EAAE,IAAMyE,GACRzE,EAAE,IAAM0E,GACR1E,EAAE,IAAM2E,GACR3E,EAAE,IAAM4E,GACR5E,EAAE,IAAM6E,GACR7E,EAAE,IAAM8E,GACR9E,EAAE,IAAM+E,GACR/E,EAAE,IAAMgF,GACE,IAANtM,IACFsH,EAAE,IAAMtH,EACR+C,EAAIlE,UAECkE,GAQT,SAASwJ,EAAU3I,EAAMnD,EAAKsC,GAC5BA,EAAIpE,SAAW8B,EAAI9B,SAAWiF,EAAKjF,SACnCoE,EAAIlE,OAAS+E,EAAK/E,OAAS4B,EAAI5B,OAI/B,IAFA,IAAImE,EAAQ,EACRwJ,EAAU,EACLzI,EAAI,EAAGA,EAAIhB,EAAIlE,OAAS,EAAGkF,IAAK,CAGvC,IAAIC,EAASwI,EACbA,EAAU,EAGV,IAFA,IAAIvI,EAAgB,SAARjB,EACRkB,EAAOvE,KAAKC,IAAImE,EAAGtD,EAAI5B,OAAS,GAC3B2C,EAAI7B,KAAKiB,IAAI,EAAGmD,EAAIH,EAAK/E,OAAS,GAAI2C,GAAK0C,EAAM1C,IAAK,CAC7D,IAAI1B,EAAIiE,EAAIvC,EAGR/B,GAFoB,EAAhBmE,EAAKhF,MAAMkB,KACI,EAAfW,EAAI7B,MAAM4C,IAGdsC,EAAS,SAAJrE,EAGTwE,EAAa,UADbH,EAAMA,EAAKG,EAAS,GAIpBuI,IAFAxI,GAHAA,EAAUA,GAAWvE,EAAI,SAAa,GAAM,IAGxBqE,IAAO,IAAO,KAEZ,GACtBE,GAAU,SAEZjB,EAAInE,MAAMmF,GAAKE,EACfjB,EAAQgB,EACRA,EAASwI,EAQX,OANc,IAAVxJ,EACFD,EAAInE,MAAMmF,GAAKf,EAEfD,EAAIlE,SAGCkE,EAAI1B,SAGb,SAASoL,EAAY7I,EAAMnD,EAAKsC,GAI9B,OAAOwJ,EAAS3I,EAAMnD,EAAKsC,GAsB7B,SAAS2J,EAAMC,EAAGC,GAChBlO,KAAKiO,EAAIA,EACTjO,KAAKkO,EAAIA,EAzENjN,KAAKyL,OACRhE,EAAczD,GAmDhBtF,EAAGF,UAAU0O,MAAQ,SAAgBpM,EAAKsC,GACxC,IACIrD,EAAMhB,KAAKG,OAAS4B,EAAI5B,OAW5B,OAVoB,KAAhBH,KAAKG,QAAgC,KAAf4B,EAAI5B,OACtBuI,EAAY1I,KAAM+B,EAAKsC,GACpBrD,EAAM,GACTiE,EAAWjF,KAAM+B,EAAKsC,GACnBrD,EAAM,KACT6M,EAAS7N,KAAM+B,EAAKsC,GAEpB0J,EAAW/N,KAAM+B,EAAKsC,IAchC2J,EAAKvO,UAAU2O,QAAU,SAAkBC,GAGzC,IAFA,IAAIhI,EAAI,IAAIrE,MAAMqM,GACdC,EAAI3O,EAAGF,UAAU2G,WAAWiI,GAAK,EAC5BjN,EAAI,EAAGA,EAAIiN,EAAGjN,IACrBiF,EAAEjF,GAAKpB,KAAKuO,OAAOnN,EAAGkN,EAAGD,GAG3B,OAAOhI,GAIT2H,EAAKvO,UAAU8O,OAAS,SAAiBN,EAAGK,EAAGD,GAC7C,GAAU,IAANJ,GAAWA,IAAMI,EAAI,EAAG,OAAOJ,EAGnC,IADA,IAAIO,EAAK,EACApN,EAAI,EAAGA,EAAIkN,EAAGlN,IACrBoN,IAAW,EAAJP,IAAWK,EAAIlN,EAAI,EAC1B6M,IAAM,EAGR,OAAOO,GAKTR,EAAKvO,UAAUgP,QAAU,SAAkBC,EAAKC,EAAKC,EAAKC,EAAMC,EAAMT,GACpE,IAAK,IAAIjN,EAAI,EAAGA,EAAIiN,EAAGjN,IACrByN,EAAKzN,GAAKuN,EAAID,EAAItN,IAClB0N,EAAK1N,GAAKwN,EAAIF,EAAItN,KAItB4M,EAAKvO,UAAUsP,UAAY,SAAoBJ,EAAKC,EAAKC,EAAMC,EAAMT,EAAGK,GACtE1O,KAAKyO,QAAQC,EAAKC,EAAKC,EAAKC,EAAMC,EAAMT,GAExC,IAAK,IAAIW,EAAI,EAAGA,EAAIX,EAAGW,IAAM,EAM3B,IALA,IAAIV,EAAIU,GAAK,EAETC,EAAQhO,KAAKiO,IAAI,EAAIjO,KAAKkO,GAAKb,GAC/Bc,EAAQnO,KAAKoO,IAAI,EAAIpO,KAAKkO,GAAKb,GAE1BgB,EAAI,EAAGA,EAAIjB,EAAGiB,GAAKhB,EAI1B,IAHA,IAAIiB,EAASN,EACTO,EAASJ,EAEJtM,EAAI,EAAGA,EAAIkM,EAAGlM,IAAK,CAC1B,IAAI2M,EAAKZ,EAAKS,EAAIxM,GACd4M,EAAKZ,EAAKQ,EAAIxM,GAEd6M,EAAKd,EAAKS,EAAIxM,EAAIkM,GAClBY,EAAKd,EAAKQ,EAAIxM,EAAIkM,GAElBa,EAAKN,EAASI,EAAKH,EAASI,EAEhCA,EAAKL,EAASK,EAAKJ,EAASG,EAC5BA,EAAKE,EAELhB,EAAKS,EAAIxM,GAAK2M,EAAKE,EACnBb,EAAKQ,EAAIxM,GAAK4M,EAAKE,EAEnBf,EAAKS,EAAIxM,EAAIkM,GAAKS,EAAKE,EACvBb,EAAKQ,EAAIxM,EAAIkM,GAAKU,EAAKE,EAGnB9M,IAAMwL,IACRuB,EAAKZ,EAAQM,EAASH,EAAQI,EAE9BA,EAASP,EAAQO,EAASJ,EAAQG,EAClCA,EAASM,KAOnB7B,EAAKvO,UAAUqQ,YAAc,SAAsBC,EAAGC,GACpD,IAAI3B,EAAqB,EAAjBpN,KAAKiB,IAAI8N,EAAGD,GAChBE,EAAU,EAAJ5B,EACNjN,EAAI,EACR,IAAKiN,EAAIA,EAAI,EAAI,EAAGA,EAAGA,KAAU,EAC/BjN,IAGF,OAAO,GAAKA,EAAI,EAAI6O,GAGtBjC,EAAKvO,UAAUyQ,UAAY,SAAoBvB,EAAKC,EAAKP,GACvD,KAAIA,GAAK,GAET,IAAK,IAAIjN,EAAI,EAAGA,EAAIiN,EAAI,EAAGjN,IAAK,CAC9B,IAAIiF,EAAIsI,EAAIvN,GAEZuN,EAAIvN,GAAKuN,EAAIN,EAAIjN,EAAI,GACrBuN,EAAIN,EAAIjN,EAAI,GAAKiF,EAEjBA,EAAIuI,EAAIxN,GAERwN,EAAIxN,IAAMwN,EAAIP,EAAIjN,EAAI,GACtBwN,EAAIP,EAAIjN,EAAI,IAAMiF,IAItB2H,EAAKvO,UAAU0Q,aAAe,SAAuBC,EAAI/B,GAEvD,IADA,IAAI/J,EAAQ,EACHlD,EAAI,EAAGA,EAAIiN,EAAI,EAAGjN,IAAK,CAC9B,IAAI2B,EAAoC,KAAhC9B,KAAKoP,MAAMD,EAAG,EAAIhP,EAAI,GAAKiN,GACjCpN,KAAKoP,MAAMD,EAAG,EAAIhP,GAAKiN,GACvB/J,EAEF8L,EAAGhP,GAAS,SAAJ2B,EAGNuB,EADEvB,EAAI,SACE,EAEAA,EAAI,SAAY,EAI5B,OAAOqN,GAGTpC,EAAKvO,UAAU6Q,WAAa,SAAqBF,EAAIpP,EAAK2N,EAAKN,GAE7D,IADA,IAAI/J,EAAQ,EACHlD,EAAI,EAAGA,EAAIJ,EAAKI,IACvBkD,GAAyB,EAAR8L,EAAGhP,GAEpBuN,EAAI,EAAIvN,GAAa,KAARkD,EAAgBA,KAAkB,GAC/CqK,EAAI,EAAIvN,EAAI,GAAa,KAARkD,EAAgBA,KAAkB,GAIrD,IAAKlD,EAAI,EAAIJ,EAAKI,EAAIiN,IAAKjN,EACzBuN,EAAIvN,GAAK,EAGXpC,EAAiB,IAAVsF,GACPtF,EAA6B,KAAb,KAARsF,KAGV0J,EAAKvO,UAAU8Q,KAAO,SAAelC,GAEnC,IADA,IAAImC,EAAK,IAAIxO,MAAMqM,GACVjN,EAAI,EAAGA,EAAIiN,EAAGjN,IACrBoP,EAAGpP,GAAK,EAGV,OAAOoP,GAGTxC,EAAKvO,UAAUgR,KAAO,SAAexC,EAAGC,EAAG7J,GACzC,IAAIgK,EAAI,EAAIrO,KAAK8P,YAAY7B,EAAE9N,OAAQ+N,EAAE/N,QAErCuO,EAAM1O,KAAKoO,QAAQC,GAEnBqC,EAAI1Q,KAAKuQ,KAAKlC,GAEdM,EAAM,IAAI3M,MAAMqM,GAChBsC,EAAO,IAAI3O,MAAMqM,GACjBuC,EAAO,IAAI5O,MAAMqM,GAEjBwC,EAAO,IAAI7O,MAAMqM,GACjByC,EAAQ,IAAI9O,MAAMqM,GAClB0C,EAAQ,IAAI/O,MAAMqM,GAElB2C,EAAO3M,EAAInE,MACf8Q,EAAK7Q,OAASkO,EAEdrO,KAAKsQ,WAAWrC,EAAE/N,MAAO+N,EAAE9N,OAAQwO,EAAKN,GACxCrO,KAAKsQ,WAAWpC,EAAEhO,MAAOgO,EAAE/N,OAAQ0Q,EAAMxC,GAEzCrO,KAAK+O,UAAUJ,EAAK+B,EAAGC,EAAMC,EAAMvC,EAAGK,GACtC1O,KAAK+O,UAAU8B,EAAMH,EAAGI,EAAOC,EAAO1C,EAAGK,GAEzC,IAAK,IAAItN,EAAI,EAAGA,EAAIiN,EAAGjN,IAAK,CAC1B,IAAIyO,EAAKc,EAAKvP,GAAK0P,EAAM1P,GAAKwP,EAAKxP,GAAK2P,EAAM3P,GAC9CwP,EAAKxP,GAAKuP,EAAKvP,GAAK2P,EAAM3P,GAAKwP,EAAKxP,GAAK0P,EAAM1P,GAC/CuP,EAAKvP,GAAKyO,EAUZ,OAPA7P,KAAKkQ,UAAUS,EAAMC,EAAMvC,GAC3BrO,KAAK+O,UAAU4B,EAAMC,EAAMI,EAAMN,EAAGrC,EAAGK,GACvC1O,KAAKkQ,UAAUc,EAAMN,EAAGrC,GACxBrO,KAAKmQ,aAAaa,EAAM3C,GAExBhK,EAAIpE,SAAWgO,EAAEhO,SAAWiO,EAAEjO,SAC9BoE,EAAIlE,OAAS8N,EAAE9N,OAAS+N,EAAE/N,OACnBkE,EAAI1B,UAIbhD,EAAGF,UAAUgC,IAAM,SAAcM,GAC/B,IAAIsC,EAAM,IAAI1E,EAAG,MAEjB,OADA0E,EAAInE,MAAQ,IAAI8B,MAAMhC,KAAKG,OAAS4B,EAAI5B,QACjCH,KAAKmO,MAAMpM,EAAKsC,IAIzB1E,EAAGF,UAAUwR,KAAO,SAAelP,GACjC,IAAIsC,EAAM,IAAI1E,EAAG,MAEjB,OADA0E,EAAInE,MAAQ,IAAI8B,MAAMhC,KAAKG,OAAS4B,EAAI5B,QACjC4N,EAAW/N,KAAM+B,EAAKsC,IAI/B1E,EAAGF,UAAUiN,KAAO,SAAe3K,GACjC,OAAO/B,KAAK2D,QAAQwK,MAAMpM,EAAK/B,OAGjCL,EAAGF,UAAU6D,MAAQ,SAAgBvB,GACnC,IAAImP,EAAWnP,EAAM,EACjBmP,IAAUnP,GAAOA,GAErB/C,EAAsB,iBAAR+C,GACd/C,EAAO+C,EAAM,UAIb,IADA,IAAIuC,EAAQ,EACHlD,EAAI,EAAGA,EAAIpB,KAAKG,OAAQiB,IAAK,CACpC,IAAI2B,GAAqB,EAAhB/C,KAAKE,MAAMkB,IAAUW,EAC1BqD,GAAU,SAAJrC,IAA0B,SAARuB,GAC5BA,IAAU,GACVA,GAAUvB,EAAI,SAAa,EAE3BuB,GAASc,IAAO,GAChBpF,KAAKE,MAAMkB,GAAU,SAALgE,EAQlB,OALc,IAAVd,IACFtE,KAAKE,MAAMkB,GAAKkD,EAChBtE,KAAKG,UAGA+Q,EAAWlR,KAAKkH,OAASlH,MAGlCL,EAAGF,UAAU0R,KAAO,SAAepP,GACjC,OAAO/B,KAAK2D,QAAQL,MAAMvB,IAI5BpC,EAAGF,UAAU2R,IAAM,WACjB,OAAOpR,KAAKyB,IAAIzB,OAIlBL,EAAGF,UAAU4R,KAAO,WAClB,OAAOrR,KAAK0M,KAAK1M,KAAK2D,UAIxBhE,EAAGF,UAAU+D,IAAM,SAAczB,GAC/B,IAAIgB,EA7xCN,SAAqBhB,GAGnB,IAFA,IAAIgB,EAAI,IAAIf,MAAMD,EAAIwE,aAEb6B,EAAM,EAAGA,EAAMrF,EAAE5C,OAAQiI,IAAO,CACvC,IAAIpF,EAAOoF,EAAM,GAAM,EACnBC,EAAOD,EAAM,GAEjBrF,EAAEqF,GAAQrG,EAAI7B,MAAM8C,KAASqF,EAAQ,EAGvC,OAAOtF,EAmxCCuO,CAAWvP,GACnB,GAAiB,IAAbgB,EAAE5C,OAAc,OAAO,IAAIR,EAAG,GAIlC,IADA,IAAIiG,EAAM5F,KACDoB,EAAI,EAAGA,EAAI2B,EAAE5C,QACP,IAAT4C,EAAE3B,GADsBA,IAAKwE,EAAMA,EAAIwL,OAI7C,KAAMhQ,EAAI2B,EAAE5C,OACV,IAAK,IAAIoR,EAAI3L,EAAIwL,MAAOhQ,EAAI2B,EAAE5C,OAAQiB,IAAKmQ,EAAIA,EAAEH,MAClC,IAATrO,EAAE3B,KAENwE,EAAMA,EAAInE,IAAI8P,IAIlB,OAAO3L,GAITjG,EAAGF,UAAU+R,OAAS,SAAiBC,GACrCzS,EAAuB,iBAATyS,GAAqBA,GAAQ,GAC3C,IAGIrQ,EAHAL,EAAI0Q,EAAO,GACXzC,GAAKyC,EAAO1Q,GAAK,GACjB2Q,EAAa,WAAe,GAAK3Q,GAAQ,GAAKA,EAGlD,GAAU,IAANA,EAAS,CACX,IAAIuD,EAAQ,EAEZ,IAAKlD,EAAI,EAAGA,EAAIpB,KAAKG,OAAQiB,IAAK,CAChC,IAAIuQ,EAAW3R,KAAKE,MAAMkB,GAAKsQ,EAC3BpQ,GAAsB,EAAhBtB,KAAKE,MAAMkB,IAAUuQ,GAAa5Q,EAC5Cf,KAAKE,MAAMkB,GAAKE,EAAIgD,EACpBA,EAAQqN,IAAc,GAAK5Q,EAGzBuD,IACFtE,KAAKE,MAAMkB,GAAKkD,EAChBtE,KAAKG,UAIT,GAAU,IAAN6O,EAAS,CACX,IAAK5N,EAAIpB,KAAKG,OAAS,EAAGiB,GAAK,EAAGA,IAChCpB,KAAKE,MAAMkB,EAAI4N,GAAKhP,KAAKE,MAAMkB,GAGjC,IAAKA,EAAI,EAAGA,EAAI4N,EAAG5N,IACjBpB,KAAKE,MAAMkB,GAAK,EAGlBpB,KAAKG,QAAU6O,EAGjB,OAAOhP,KAAK2C,UAGdhD,EAAGF,UAAUmS,MAAQ,SAAgBH,GAGnC,OADAzS,EAAyB,IAAlBgB,KAAKC,UACLD,KAAKwR,OAAOC,IAMrB9R,EAAGF,UAAUoS,OAAS,SAAiBJ,EAAMK,EAAMC,GAEjD,IAAIC,EADJhT,EAAuB,iBAATyS,GAAqBA,GAAQ,GAGzCO,EADEF,GACGA,EAAQA,EAAO,IAAO,GAEvB,EAGN,IAAI/Q,EAAI0Q,EAAO,GACXzC,EAAI/N,KAAKC,KAAKuQ,EAAO1Q,GAAK,GAAIf,KAAKG,QACnC8R,EAAO,SAAc,WAAclR,GAAMA,EACzCmR,EAAcH,EAMlB,GAJAC,GAAKhD,EACLgD,EAAI/Q,KAAKiB,IAAI,EAAG8P,GAGZE,EAAa,CACf,IAAK,IAAI9Q,EAAI,EAAGA,EAAI4N,EAAG5N,IACrB8Q,EAAYhS,MAAMkB,GAAKpB,KAAKE,MAAMkB,GAEpC8Q,EAAY/R,OAAS6O,EAGvB,GAAU,IAANA,QAEG,GAAIhP,KAAKG,OAAS6O,EAEvB,IADAhP,KAAKG,QAAU6O,EACV5N,EAAI,EAAGA,EAAIpB,KAAKG,OAAQiB,IAC3BpB,KAAKE,MAAMkB,GAAKpB,KAAKE,MAAMkB,EAAI4N,QAGjChP,KAAKE,MAAM,GAAK,EAChBF,KAAKG,OAAS,EAGhB,IAAImE,EAAQ,EACZ,IAAKlD,EAAIpB,KAAKG,OAAS,EAAGiB,GAAK,IAAgB,IAAVkD,GAAelD,GAAK4Q,GAAI5Q,IAAK,CAChE,IAAIiC,EAAuB,EAAhBrD,KAAKE,MAAMkB,GACtBpB,KAAKE,MAAMkB,GAAMkD,GAAU,GAAKvD,EAAOsC,IAAStC,EAChDuD,EAAQjB,EAAO4O,EAajB,OATIC,GAAyB,IAAV5N,IACjB4N,EAAYhS,MAAMgS,EAAY/R,UAAYmE,GAGxB,IAAhBtE,KAAKG,SACPH,KAAKE,MAAM,GAAK,EAChBF,KAAKG,OAAS,GAGTH,KAAK2C,UAGdhD,EAAGF,UAAU0S,MAAQ,SAAgBV,EAAMK,EAAMC,GAG/C,OADA/S,EAAyB,IAAlBgB,KAAKC,UACLD,KAAK6R,OAAOJ,EAAMK,EAAMC,IAIjCpS,EAAGF,UAAU2S,KAAO,SAAeX,GACjC,OAAOzR,KAAK2D,QAAQiO,MAAMH,IAG5B9R,EAAGF,UAAU4S,MAAQ,SAAgBZ,GACnC,OAAOzR,KAAK2D,QAAQ6N,OAAOC,IAI7B9R,EAAGF,UAAU6S,KAAO,SAAeb,GACjC,OAAOzR,KAAK2D,QAAQwO,MAAMV,IAG5B9R,EAAGF,UAAU8S,MAAQ,SAAgBd,GACnC,OAAOzR,KAAK2D,QAAQkO,OAAOJ,IAI7B9R,EAAGF,UAAUuH,MAAQ,SAAgBoB,GACnCpJ,EAAsB,iBAARoJ,GAAoBA,GAAO,GACzC,IAAIrH,EAAIqH,EAAM,GACV4G,GAAK5G,EAAMrH,GAAK,GAChBwQ,EAAI,GAAKxQ,EAGb,QAAIf,KAAKG,QAAU6O,OAGXhP,KAAKE,MAAM8O,GAELuC,IAIhB5R,EAAGF,UAAU+S,OAAS,SAAiBf,GACrCzS,EAAuB,iBAATyS,GAAqBA,GAAQ,GAC3C,IAAI1Q,EAAI0Q,EAAO,GACXzC,GAAKyC,EAAO1Q,GAAK,GAIrB,GAFA/B,EAAyB,IAAlBgB,KAAKC,SAAgB,2CAExBD,KAAKG,QAAU6O,EACjB,OAAOhP,KAQT,GALU,IAANe,GACFiO,IAEFhP,KAAKG,OAASc,KAAKC,IAAI8N,EAAGhP,KAAKG,QAErB,IAANY,EAAS,CACX,IAAIkR,EAAO,SAAc,WAAclR,GAAMA,EAC7Cf,KAAKE,MAAMF,KAAKG,OAAS,IAAM8R,EAGjC,OAAOjS,KAAK2C,UAIdhD,EAAGF,UAAUgT,MAAQ,SAAgBhB,GACnC,OAAOzR,KAAK2D,QAAQ6O,OAAOf,IAI7B9R,EAAGF,UAAUqH,MAAQ,SAAgB/E,GAGnC,OAFA/C,EAAsB,iBAAR+C,GACd/C,EAAO+C,EAAM,UACTA,EAAM,EAAU/B,KAAK0S,OAAO3Q,GAGV,IAAlB/B,KAAKC,SACa,IAAhBD,KAAKG,SAAiC,EAAhBH,KAAKE,MAAM,KAAW6B,GAC9C/B,KAAKE,MAAM,GAAK6B,GAAuB,EAAhB/B,KAAKE,MAAM,IAClCF,KAAKC,SAAW,EACTD,OAGTA,KAAKC,SAAW,EAChBD,KAAK0S,MAAM3Q,GACX/B,KAAKC,SAAW,EACTD,MAIFA,KAAKuD,OAAOxB,IAGrBpC,EAAGF,UAAU8D,OAAS,SAAiBxB,GACrC/B,KAAKE,MAAM,IAAM6B,EAGjB,IAAK,IAAIX,EAAI,EAAGA,EAAIpB,KAAKG,QAAUH,KAAKE,MAAMkB,IAAM,SAAWA,IAC7DpB,KAAKE,MAAMkB,IAAM,SACbA,IAAMpB,KAAKG,OAAS,EACtBH,KAAKE,MAAMkB,EAAI,GAAK,EAEpBpB,KAAKE,MAAMkB,EAAI,KAKnB,OAFApB,KAAKG,OAASc,KAAKiB,IAAIlC,KAAKG,OAAQiB,EAAI,GAEjCpB,MAITL,EAAGF,UAAUiT,MAAQ,SAAgB3Q,GAGnC,GAFA/C,EAAsB,iBAAR+C,GACd/C,EAAO+C,EAAM,UACTA,EAAM,EAAG,OAAO/B,KAAK8G,OAAO/E,GAEhC,GAAsB,IAAlB/B,KAAKC,SAIP,OAHAD,KAAKC,SAAW,EAChBD,KAAK8G,MAAM/E,GACX/B,KAAKC,SAAW,EACTD,KAKT,GAFAA,KAAKE,MAAM,IAAM6B,EAEG,IAAhB/B,KAAKG,QAAgBH,KAAKE,MAAM,GAAK,EACvCF,KAAKE,MAAM,IAAMF,KAAKE,MAAM,GAC5BF,KAAKC,SAAW,OAGhB,IAAK,IAAImB,EAAI,EAAGA,EAAIpB,KAAKG,QAAUH,KAAKE,MAAMkB,GAAK,EAAGA,IACpDpB,KAAKE,MAAMkB,IAAM,SACjBpB,KAAKE,MAAMkB,EAAI,IAAM,EAIzB,OAAOpB,KAAK2C,UAGdhD,EAAGF,UAAUkT,KAAO,SAAe5Q,GACjC,OAAO/B,KAAK2D,QAAQmD,MAAM/E,IAG5BpC,EAAGF,UAAUmT,KAAO,SAAe7Q,GACjC,OAAO/B,KAAK2D,QAAQ+O,MAAM3Q,IAG5BpC,EAAGF,UAAUoT,KAAO,WAGlB,OAFA7S,KAAKC,SAAW,EAETD,MAGTL,EAAGF,UAAUmH,IAAM,WACjB,OAAO5G,KAAK2D,QAAQkP,QAGtBlT,EAAGF,UAAUqT,aAAe,SAAuB/Q,EAAKN,EAAKwE,GAC3D,IACI7E,EAIA2B,EALA/B,EAAMe,EAAI5B,OAAS8F,EAGvBjG,KAAK4D,QAAQ5C,GAGb,IAAIsD,EAAQ,EACZ,IAAKlD,EAAI,EAAGA,EAAIW,EAAI5B,OAAQiB,IAAK,CAC/B2B,GAA6B,EAAxB/C,KAAKE,MAAMkB,EAAI6E,IAAc3B,EAClC,IAAIlC,GAAwB,EAAfL,EAAI7B,MAAMkB,IAAUK,EAEjC6C,IADAvB,GAAa,SAARX,IACS,KAAQA,EAAQ,SAAa,GAC3CpC,KAAKE,MAAMkB,EAAI6E,GAAa,SAAJlD,EAE1B,KAAO3B,EAAIpB,KAAKG,OAAS8F,EAAO7E,IAE9BkD,GADAvB,GAA6B,EAAxB/C,KAAKE,MAAMkB,EAAI6E,IAAc3B,IACrB,GACbtE,KAAKE,MAAMkB,EAAI6E,GAAa,SAAJlD,EAG1B,GAAc,IAAVuB,EAAa,OAAOtE,KAAK2C,SAK7B,IAFA3D,GAAkB,IAAXsF,GACPA,EAAQ,EACHlD,EAAI,EAAGA,EAAIpB,KAAKG,OAAQiB,IAE3BkD,GADAvB,IAAsB,EAAhB/C,KAAKE,MAAMkB,IAAUkD,IACd,GACbtE,KAAKE,MAAMkB,GAAS,SAAJ2B,EAIlB,OAFA/C,KAAKC,SAAW,EAETD,KAAK2C,UAGdhD,EAAGF,UAAUsT,SAAW,SAAmBhR,EAAKiR,GAC9C,IAAI/M,GAAQjG,KAAKG,OAAS4B,EAAI5B,QAE1BgF,EAAInF,KAAK2D,QACTtC,EAAIU,EAGJkR,EAA8B,EAAxB5R,EAAEnB,MAAMmB,EAAElB,OAAS,GAGf,KADd8F,EAAQ,GADMjG,KAAKoG,WAAW6M,MAG5B5R,EAAIA,EAAEgR,MAAMpM,GACZd,EAAEqM,OAAOvL,GACTgN,EAA8B,EAAxB5R,EAAEnB,MAAMmB,EAAElB,OAAS,IAI3B,IACIoR,EADAvB,EAAI7K,EAAEhF,OAASkB,EAAElB,OAGrB,GAAa,QAAT6S,EAAgB,EAClBzB,EAAI,IAAI5R,EAAG,OACTQ,OAAS6P,EAAI,EACfuB,EAAErR,MAAQ,IAAI8B,MAAMuP,EAAEpR,QACtB,IAAK,IAAIiB,EAAI,EAAGA,EAAImQ,EAAEpR,OAAQiB,IAC5BmQ,EAAErR,MAAMkB,GAAK,EAIjB,IAAI8R,EAAO/N,EAAExB,QAAQmP,aAAazR,EAAG,EAAG2O,GAClB,IAAlBkD,EAAKjT,WACPkF,EAAI+N,EACA3B,IACFA,EAAErR,MAAM8P,GAAK,IAIjB,IAAK,IAAIlN,EAAIkN,EAAI,EAAGlN,GAAK,EAAGA,IAAK,CAC/B,IAAIqQ,EAAmC,UAAL,EAAxBhO,EAAEjF,MAAMmB,EAAElB,OAAS2C,KACE,EAA5BqC,EAAEjF,MAAMmB,EAAElB,OAAS2C,EAAI,IAO1B,IAHAqQ,EAAKlS,KAAKC,IAAKiS,EAAKF,EAAO,EAAG,UAE9B9N,EAAE2N,aAAazR,EAAG8R,EAAIrQ,GACA,IAAfqC,EAAElF,UACPkT,IACAhO,EAAElF,SAAW,EACbkF,EAAE2N,aAAazR,EAAG,EAAGyB,GAChBqC,EAAEV,WACLU,EAAElF,UAAY,GAGdsR,IACFA,EAAErR,MAAM4C,GAAKqQ,GAajB,OAVI5B,GACFA,EAAE5O,SAEJwC,EAAExC,SAGW,QAATqQ,GAA4B,IAAV/M,GACpBd,EAAE0M,OAAO5L,GAGJ,CACLmN,IAAK7B,GAAK,KACVnO,IAAK+B,IAQTxF,EAAGF,UAAU4T,OAAS,SAAiBtR,EAAKiR,EAAMM,GAGhD,OAFAtU,GAAQ+C,EAAI0C,UAERzE,KAAKyE,SACA,CACL2O,IAAK,IAAIzT,EAAG,GACZyD,IAAK,IAAIzD,EAAG,IAKM,IAAlBK,KAAKC,UAAmC,IAAjB8B,EAAI9B,UAC7B2F,EAAM5F,KAAKoH,MAAMiM,OAAOtR,EAAKiR,GAEhB,QAATA,IACFI,EAAMxN,EAAIwN,IAAIhM,OAGH,QAAT4L,IACF5P,EAAMwC,EAAIxC,IAAIgE,MACVkM,GAA6B,IAAjBlQ,EAAInD,UAClBmD,EAAIkF,KAAKvG,IAIN,CACLqR,IAAKA,EACLhQ,IAAKA,IAIa,IAAlBpD,KAAKC,UAAmC,IAAjB8B,EAAI9B,UAC7B2F,EAAM5F,KAAKqT,OAAOtR,EAAIqF,MAAO4L,GAEhB,QAATA,IACFI,EAAMxN,EAAIwN,IAAIhM,OAGT,CACLgM,IAAKA,EACLhQ,IAAKwC,EAAIxC,MAI0B,IAAlCpD,KAAKC,SAAW8B,EAAI9B,WACvB2F,EAAM5F,KAAKoH,MAAMiM,OAAOtR,EAAIqF,MAAO4L,GAEtB,QAATA,IACF5P,EAAMwC,EAAIxC,IAAIgE,MACVkM,GAA6B,IAAjBlQ,EAAInD,UAClBmD,EAAImF,KAAKxG,IAIN,CACLqR,IAAKxN,EAAIwN,IACThQ,IAAKA,IAOLrB,EAAI5B,OAASH,KAAKG,QAAUH,KAAKqC,IAAIN,GAAO,EACvC,CACLqR,IAAK,IAAIzT,EAAG,GACZyD,IAAKpD,MAKU,IAAf+B,EAAI5B,OACO,QAAT6S,EACK,CACLI,IAAKpT,KAAKuT,KAAKxR,EAAI7B,MAAM,IACzBkD,IAAK,MAII,QAAT4P,EACK,CACLI,IAAK,KACLhQ,IAAK,IAAIzD,EAAGK,KAAK0E,MAAM3C,EAAI7B,MAAM,MAI9B,CACLkT,IAAKpT,KAAKuT,KAAKxR,EAAI7B,MAAM,IACzBkD,IAAK,IAAIzD,EAAGK,KAAK0E,MAAM3C,EAAI7B,MAAM,MAI9BF,KAAK+S,SAAShR,EAAKiR,GAlF1B,IAAII,EAAKhQ,EAAKwC,GAsFhBjG,EAAGF,UAAU2T,IAAM,SAAcrR,GAC/B,OAAO/B,KAAKqT,OAAOtR,EAAK,OAAO,GAAOqR,KAIxCzT,EAAGF,UAAU2D,IAAM,SAAcrB,GAC/B,OAAO/B,KAAKqT,OAAOtR,EAAK,OAAO,GAAOqB,KAGxCzD,EAAGF,UAAU+T,KAAO,SAAezR,GACjC,OAAO/B,KAAKqT,OAAOtR,EAAK,OAAO,GAAMqB,KAIvCzD,EAAGF,UAAUgU,SAAW,SAAmB1R,GACzC,IAAI2R,EAAK1T,KAAKqT,OAAOtR,GAGrB,GAAI2R,EAAGtQ,IAAIqB,SAAU,OAAOiP,EAAGN,IAE/B,IAAIhQ,EAA0B,IAApBsQ,EAAGN,IAAInT,SAAiByT,EAAGtQ,IAAImF,KAAKxG,GAAO2R,EAAGtQ,IAEpDuQ,EAAO5R,EAAIwQ,MAAM,GACjBqB,EAAK7R,EAAI8R,MAAM,GACfxR,EAAMe,EAAIf,IAAIsR,GAGlB,OAAItR,EAAM,GAAa,IAAPuR,GAAoB,IAARvR,EAAmBqR,EAAGN,IAGvB,IAApBM,EAAGN,IAAInT,SAAiByT,EAAGN,IAAIV,MAAM,GAAKgB,EAAGN,IAAItM,MAAM,IAGhEnH,EAAGF,UAAUiF,MAAQ,SAAgB3C,GACnC,IAAImP,EAAWnP,EAAM,EACjBmP,IAAUnP,GAAOA,GAErB/C,EAAO+C,GAAO,UAId,IAHA,IAAIuN,GAAK,GAAK,IAAMvN,EAEhB+R,EAAM,EACD1S,EAAIpB,KAAKG,OAAS,EAAGiB,GAAK,EAAGA,IACpC0S,GAAOxE,EAAIwE,GAAuB,EAAhB9T,KAAKE,MAAMkB,KAAWW,EAG1C,OAAOmP,GAAY4C,EAAMA,GAI3BnU,EAAGF,UAAUsU,KAAO,SAAehS,GACjC,OAAO/B,KAAK0E,MAAM3C,IAIpBpC,EAAGF,UAAUkF,MAAQ,SAAgB5C,GACnC,IAAImP,EAAWnP,EAAM,EACjBmP,IAAUnP,GAAOA,GAErB/C,EAAO+C,GAAO,UAGd,IADA,IAAIuC,EAAQ,EACHlD,EAAIpB,KAAKG,OAAS,EAAGiB,GAAK,EAAGA,IAAK,CACzC,IAAI2B,GAAqB,EAAhB/C,KAAKE,MAAMkB,IAAkB,SAARkD,EAC9BtE,KAAKE,MAAMkB,GAAM2B,EAAIhB,EAAO,EAC5BuC,EAAQvB,EAAIhB,EAId,OADA/B,KAAK2C,SACEuO,EAAWlR,KAAKkH,OAASlH,MAGlCL,EAAGF,UAAU8T,KAAO,SAAexR,GACjC,OAAO/B,KAAK2D,QAAQgB,MAAM5C,IAG5BpC,EAAGF,UAAUuU,KAAO,SAAe1E,GACjCtQ,EAAsB,IAAfsQ,EAAErP,UACTjB,GAAQsQ,EAAE7K,UAEV,IAAIwJ,EAAIjO,KACJkO,EAAIoB,EAAE3L,QAGRsK,EADiB,IAAfA,EAAEhO,SACAgO,EAAEuF,KAAKlE,GAEPrB,EAAEtK,QAaR,IATA,IAAIsQ,EAAI,IAAItU,EAAG,GACXuU,EAAI,IAAIvU,EAAG,GAGXwU,EAAI,IAAIxU,EAAG,GACXyU,EAAI,IAAIzU,EAAG,GAEX0U,EAAI,EAEDpG,EAAEqG,UAAYpG,EAAEoG,UACrBrG,EAAE4D,OAAO,GACT3D,EAAE2D,OAAO,KACPwC,EAMJ,IAHA,IAAIE,EAAKrG,EAAEvK,QACP6Q,EAAKvG,EAAEtK,SAEHsK,EAAExJ,UAAU,CAClB,IAAK,IAAIrD,EAAI,EAAGqT,EAAK,EAAyB,IAArBxG,EAAE/N,MAAM,GAAKuU,IAAarT,EAAI,KAAMA,EAAGqT,IAAO,GACvE,GAAIrT,EAAI,EAEN,IADA6M,EAAE4D,OAAOzQ,GACFA,KAAM,IACP6S,EAAES,SAAWR,EAAEQ,WACjBT,EAAE3L,KAAKiM,GACPL,EAAE3L,KAAKiM,IAGTP,EAAEpC,OAAO,GACTqC,EAAErC,OAAO,GAIb,IAAK,IAAI/O,EAAI,EAAG6R,EAAK,EAAyB,IAArBzG,EAAEhO,MAAM,GAAKyU,IAAa7R,EAAI,KAAMA,EAAG6R,IAAO,GACvE,GAAI7R,EAAI,EAEN,IADAoL,EAAE2D,OAAO/O,GACFA,KAAM,IACPqR,EAAEO,SAAWN,EAAEM,WACjBP,EAAE7L,KAAKiM,GACPH,EAAE7L,KAAKiM,IAGTL,EAAEtC,OAAO,GACTuC,EAAEvC,OAAO,GAIT5D,EAAE5L,IAAI6L,IAAM,GACdD,EAAE1F,KAAK2F,GACP+F,EAAE1L,KAAK4L,GACPD,EAAE3L,KAAK6L,KAEPlG,EAAE3F,KAAK0F,GACPkG,EAAE5L,KAAK0L,GACPG,EAAE7L,KAAK2L,IAIX,MAAO,CACL/O,EAAGgP,EACH9S,EAAG+S,EACHQ,IAAK1G,EAAEsD,OAAO6C,KAOlB1U,EAAGF,UAAUoV,OAAS,SAAiBvF,GACrCtQ,EAAsB,IAAfsQ,EAAErP,UACTjB,GAAQsQ,EAAE7K,UAEV,IAAIU,EAAInF,KACJqB,EAAIiO,EAAE3L,QAGRwB,EADiB,IAAfA,EAAElF,SACAkF,EAAEqO,KAAKlE,GAEPnK,EAAExB,QAQR,IALA,IAuCIiC,EAvCAkP,EAAK,IAAInV,EAAG,GACZoV,EAAK,IAAIpV,EAAG,GAEZqV,EAAQ3T,EAAEsC,QAEPwB,EAAE8P,KAAK,GAAK,GAAK5T,EAAE4T,KAAK,GAAK,GAAG,CACrC,IAAK,IAAI7T,EAAI,EAAGqT,EAAK,EAAyB,IAArBtP,EAAEjF,MAAM,GAAKuU,IAAarT,EAAI,KAAMA,EAAGqT,IAAO,GACvE,GAAIrT,EAAI,EAEN,IADA+D,EAAE0M,OAAOzQ,GACFA,KAAM,GACP0T,EAAGJ,SACLI,EAAGxM,KAAK0M,GAGVF,EAAGjD,OAAO,GAId,IAAK,IAAI/O,EAAI,EAAG6R,EAAK,EAAyB,IAArBtT,EAAEnB,MAAM,GAAKyU,IAAa7R,EAAI,KAAMA,EAAG6R,IAAO,GACvE,GAAI7R,EAAI,EAEN,IADAzB,EAAEwQ,OAAO/O,GACFA,KAAM,GACPiS,EAAGL,SACLK,EAAGzM,KAAK0M,GAGVD,EAAGlD,OAAO,GAIV1M,EAAE9C,IAAIhB,IAAM,GACd8D,EAAEoD,KAAKlH,GACPyT,EAAGvM,KAAKwM,KAER1T,EAAEkH,KAAKpD,GACP4P,EAAGxM,KAAKuM,IAeZ,OATElP,EADgB,IAAdT,EAAE8P,KAAK,GACHH,EAEAC,GAGAE,KAAK,GAAK,GAChBrP,EAAI0C,KAAKgH,GAGJ1J,GAGTjG,EAAGF,UAAUmV,IAAM,SAAc7S,GAC/B,GAAI/B,KAAKyE,SAAU,OAAO1C,EAAI6E,MAC9B,GAAI7E,EAAI0C,SAAU,OAAOzE,KAAK4G,MAE9B,IAAIzB,EAAInF,KAAK2D,QACTtC,EAAIU,EAAI4B,QACZwB,EAAElF,SAAW,EACboB,EAAEpB,SAAW,EAGb,IAAK,IAAIgG,EAAQ,EAAGd,EAAEmP,UAAYjT,EAAEiT,SAAUrO,IAC5Cd,EAAE0M,OAAO,GACTxQ,EAAEwQ,OAAO,GAGX,OAAG,CACD,KAAO1M,EAAEmP,UACPnP,EAAE0M,OAAO,GAEX,KAAOxQ,EAAEiT,UACPjT,EAAEwQ,OAAO,GAGX,IAAI9Q,EAAIoE,EAAE9C,IAAIhB,GACd,GAAIN,EAAI,EAAG,CAET,IAAIsF,EAAIlB,EACRA,EAAI9D,EACJA,EAAIgF,OACC,GAAU,IAANtF,GAAyB,IAAdM,EAAE4T,KAAK,GAC3B,MAGF9P,EAAEoD,KAAKlH,GAGT,OAAOA,EAAEmQ,OAAOvL,IAIlBtG,EAAGF,UAAUyV,KAAO,SAAenT,GACjC,OAAO/B,KAAKgU,KAAKjS,GAAKoD,EAAEqO,KAAKzR,IAG/BpC,EAAGF,UAAU6U,OAAS,WACpB,OAA+B,IAAP,EAAhBtU,KAAKE,MAAM,KAGrBP,EAAGF,UAAUiV,MAAQ,WACnB,OAA+B,IAAP,EAAhB1U,KAAKE,MAAM,KAIrBP,EAAGF,UAAUoU,MAAQ,SAAgB9R,GACnC,OAAO/B,KAAKE,MAAM,GAAK6B,GAIzBpC,EAAGF,UAAU0V,MAAQ,SAAgB/M,GACnCpJ,EAAsB,iBAARoJ,GACd,IAAIrH,EAAIqH,EAAM,GACV4G,GAAK5G,EAAMrH,GAAK,GAChBwQ,EAAI,GAAKxQ,EAGb,GAAIf,KAAKG,QAAU6O,EAGjB,OAFAhP,KAAK4D,QAAQoL,EAAI,GACjBhP,KAAKE,MAAM8O,IAAMuC,EACVvR,KAKT,IADA,IAAIsE,EAAQiN,EACHnQ,EAAI4N,EAAa,IAAV1K,GAAelD,EAAIpB,KAAKG,OAAQiB,IAAK,CACnD,IAAI2B,EAAoB,EAAhB/C,KAAKE,MAAMkB,GAEnBkD,GADAvB,GAAKuB,KACS,GACdvB,GAAK,SACL/C,KAAKE,MAAMkB,GAAK2B,EAMlB,OAJc,IAAVuB,IACFtE,KAAKE,MAAMkB,GAAKkD,EAChBtE,KAAKG,UAEAH,MAGTL,EAAGF,UAAUgF,OAAS,WACpB,OAAuB,IAAhBzE,KAAKG,QAAkC,IAAlBH,KAAKE,MAAM,IAGzCP,EAAGF,UAAUwV,KAAO,SAAelT,GACjC,IAOI6D,EAPA3F,EAAW8B,EAAM,EAErB,GAAsB,IAAlB/B,KAAKC,WAAmBA,EAAU,OAAQ,EAC9C,GAAsB,IAAlBD,KAAKC,UAAkBA,EAAU,OAAO,EAK5C,GAHAD,KAAK2C,SAGD3C,KAAKG,OAAS,EAChByF,EAAM,MACD,CACD3F,IACF8B,GAAOA,GAGT/C,EAAO+C,GAAO,SAAW,qBAEzB,IAAIgB,EAAoB,EAAhB/C,KAAKE,MAAM,GACnB0F,EAAM7C,IAAMhB,EAAM,EAAIgB,EAAIhB,GAAO,EAAI,EAEvC,OAAsB,IAAlB/B,KAAKC,SAA8B,GAAN2F,EAC1BA,GAOTjG,EAAGF,UAAU4C,IAAM,SAAcN,GAC/B,GAAsB,IAAlB/B,KAAKC,UAAmC,IAAjB8B,EAAI9B,SAAgB,OAAQ,EACvD,GAAsB,IAAlBD,KAAKC,UAAmC,IAAjB8B,EAAI9B,SAAgB,OAAO,EAEtD,IAAI2F,EAAM5F,KAAKoV,KAAKrT,GACpB,OAAsB,IAAlB/B,KAAKC,SAA8B,GAAN2F,EAC1BA,GAITjG,EAAGF,UAAU2V,KAAO,SAAerT,GAEjC,GAAI/B,KAAKG,OAAS4B,EAAI5B,OAAQ,OAAO,EACrC,GAAIH,KAAKG,OAAS4B,EAAI5B,OAAQ,OAAQ,EAGtC,IADA,IAAIyF,EAAM,EACDxE,EAAIpB,KAAKG,OAAS,EAAGiB,GAAK,EAAGA,IAAK,CACzC,IAAI+D,EAAoB,EAAhBnF,KAAKE,MAAMkB,GACfC,EAAmB,EAAfU,EAAI7B,MAAMkB,GAElB,GAAI+D,IAAM9D,EAAV,CACI8D,EAAI9D,EACNuE,GAAO,EACET,EAAI9D,IACbuE,EAAM,GAER,OAEF,OAAOA,GAGTjG,EAAGF,UAAU4V,IAAM,SAActT,GAC/B,OAA0B,IAAnB/B,KAAKiV,KAAKlT,IAGnBpC,EAAGF,UAAU6V,GAAK,SAAavT,GAC7B,OAAyB,IAAlB/B,KAAKqC,IAAIN,IAGlBpC,EAAGF,UAAU8V,KAAO,SAAexT,GACjC,OAAO/B,KAAKiV,KAAKlT,IAAQ,GAG3BpC,EAAGF,UAAU+V,IAAM,SAAczT,GAC/B,OAAO/B,KAAKqC,IAAIN,IAAQ,GAG1BpC,EAAGF,UAAUgW,IAAM,SAAc1T,GAC/B,OAA2B,IAApB/B,KAAKiV,KAAKlT,IAGnBpC,EAAGF,UAAUiW,GAAK,SAAa3T,GAC7B,OAA0B,IAAnB/B,KAAKqC,IAAIN,IAGlBpC,EAAGF,UAAUkW,KAAO,SAAe5T,GACjC,OAAO/B,KAAKiV,KAAKlT,IAAQ,GAG3BpC,EAAGF,UAAUmW,IAAM,SAAc7T,GAC/B,OAAO/B,KAAKqC,IAAIN,IAAQ,GAG1BpC,EAAGF,UAAUoW,IAAM,SAAc9T,GAC/B,OAA0B,IAAnB/B,KAAKiV,KAAKlT,IAGnBpC,EAAGF,UAAUqW,GAAK,SAAa/T,GAC7B,OAAyB,IAAlB/B,KAAKqC,IAAIN,IAOlBpC,EAAGS,IAAM,SAAc2B,GACrB,OAAO,IAAIgU,EAAIhU,IAGjBpC,EAAGF,UAAUuW,MAAQ,SAAgBC,GAGnC,OAFAjX,GAAQgB,KAAKI,IAAK,yCAClBpB,EAAyB,IAAlBgB,KAAKC,SAAgB,iCACrBgW,EAAIC,UAAUlW,MAAMmW,UAAUF,IAGvCtW,EAAGF,UAAU2W,QAAU,WAErB,OADApX,EAAOgB,KAAKI,IAAK,wDACVJ,KAAKI,IAAIiW,YAAYrW,OAG9BL,EAAGF,UAAU0W,UAAY,SAAoBF,GAE3C,OADAjW,KAAKI,IAAM6V,EACJjW,MAGTL,EAAGF,UAAU6W,SAAW,SAAmBL,GAEzC,OADAjX,GAAQgB,KAAKI,IAAK,yCACXJ,KAAKmW,UAAUF,IAGxBtW,EAAGF,UAAU8W,OAAS,SAAiBxU,GAErC,OADA/C,EAAOgB,KAAKI,IAAK,sCACVJ,KAAKI,IAAIoI,IAAIxI,KAAM+B,IAG5BpC,EAAGF,UAAU+W,QAAU,SAAkBzU,GAEvC,OADA/C,EAAOgB,KAAKI,IAAK,uCACVJ,KAAKI,IAAIkI,KAAKtI,KAAM+B,IAG7BpC,EAAGF,UAAUgX,OAAS,SAAiB1U,GAErC,OADA/C,EAAOgB,KAAKI,IAAK,sCACVJ,KAAKI,IAAIqI,IAAIzI,KAAM+B,IAG5BpC,EAAGF,UAAUiX,QAAU,SAAkB3U,GAEvC,OADA/C,EAAOgB,KAAKI,IAAK,uCACVJ,KAAKI,IAAImI,KAAKvI,KAAM+B,IAG7BpC,EAAGF,UAAUkX,OAAS,SAAiB5U,GAErC,OADA/C,EAAOgB,KAAKI,IAAK,sCACVJ,KAAKI,IAAIwW,IAAI5W,KAAM+B,IAG5BpC,EAAGF,UAAUoX,OAAS,SAAiB9U,GAGrC,OAFA/C,EAAOgB,KAAKI,IAAK,sCACjBJ,KAAKI,IAAI0W,SAAS9W,KAAM+B,GACjB/B,KAAKI,IAAIqB,IAAIzB,KAAM+B,IAG5BpC,EAAGF,UAAUsX,QAAU,SAAkBhV,GAGvC,OAFA/C,EAAOgB,KAAKI,IAAK,sCACjBJ,KAAKI,IAAI0W,SAAS9W,KAAM+B,GACjB/B,KAAKI,IAAIsM,KAAK1M,KAAM+B,IAG7BpC,EAAGF,UAAUuX,OAAS,WAGpB,OAFAhY,EAAOgB,KAAKI,IAAK,sCACjBJ,KAAKI,IAAI6W,SAASjX,MACXA,KAAKI,IAAIgR,IAAIpR,OAGtBL,EAAGF,UAAUyX,QAAU,WAGrB,OAFAlY,EAAOgB,KAAKI,IAAK,uCACjBJ,KAAKI,IAAI6W,SAASjX,MACXA,KAAKI,IAAIiR,KAAKrR,OAIvBL,EAAGF,UAAU0X,QAAU,WAGrB,OAFAnY,EAAOgB,KAAKI,IAAK,uCACjBJ,KAAKI,IAAI6W,SAASjX,MACXA,KAAKI,IAAIgX,KAAKpX,OAGvBL,EAAGF,UAAU4X,QAAU,WAGrB,OAFArY,EAAOgB,KAAKI,IAAK,uCACjBJ,KAAKI,IAAI6W,SAASjX,MACXA,KAAKI,IAAI8U,KAAKlV,OAIvBL,EAAGF,UAAU6X,OAAS,WAGpB,OAFAtY,EAAOgB,KAAKI,IAAK,sCACjBJ,KAAKI,IAAI6W,SAASjX,MACXA,KAAKI,IAAIgH,IAAIpH,OAGtBL,EAAGF,UAAU8X,OAAS,SAAiBxV,GAGrC,OAFA/C,EAAOgB,KAAKI,MAAQ2B,EAAI3B,IAAK,qBAC7BJ,KAAKI,IAAI6W,SAASjX,MACXA,KAAKI,IAAIoD,IAAIxD,KAAM+B,IAI5B,IAAIyV,EAAS,CACXC,KAAM,KACNC,KAAM,KACNC,KAAM,KACNC,OAAQ,MAIV,SAASC,EAAQC,EAAMxI,GAErBtP,KAAK8X,KAAOA,EACZ9X,KAAKsP,EAAI,IAAI3P,EAAG2P,EAAG,IACnBtP,KAAK+P,EAAI/P,KAAKsP,EAAE/I,YAChBvG,KAAKqF,EAAI,IAAI1F,EAAG,GAAG6R,OAAOxR,KAAK+P,GAAGxH,KAAKvI,KAAKsP,GAE5CtP,KAAK+X,IAAM/X,KAAKgY,OAiDlB,SAASC,IACPJ,EAAOK,KACLlY,KACA,OACA,2EA+DJ,SAASmY,IACPN,EAAOK,KACLlY,KACA,OACA,kEAIJ,SAASoY,IACPP,EAAOK,KACLlY,KACA,OACA,yDAIJ,SAASqY,IAEPR,EAAOK,KACLlY,KACA,QACA,uEA8CJ,SAAS+V,EAAK/F,GACZ,GAAiB,iBAANA,EAAgB,CACzB,IAAIsI,EAAQ3Y,EAAG4Y,OAAOvI,GACtBhQ,KAAKgQ,EAAIsI,EAAMhJ,EACftP,KAAKsY,MAAQA,OAEbtZ,EAAOgR,EAAEqF,IAAI,GAAI,kCACjBrV,KAAKgQ,EAAIA,EACThQ,KAAKsY,MAAQ,KAoOjB,SAASE,EAAMxI,GACb+F,EAAImC,KAAKlY,KAAMgQ,GAEfhQ,KAAKiG,MAAQjG,KAAKgQ,EAAEzJ,YAChBvG,KAAKiG,MAAQ,IAAO,IACtBjG,KAAKiG,OAAS,GAAMjG,KAAKiG,MAAQ,IAGnCjG,KAAKe,EAAI,IAAIpB,EAAG,GAAG6R,OAAOxR,KAAKiG,OAC/BjG,KAAK4T,GAAK5T,KAAKyY,KAAKzY,KAAKe,EAAEqQ,OAC3BpR,KAAK0Y,KAAO1Y,KAAKe,EAAE8T,OAAO7U,KAAKgQ,GAE/BhQ,KAAK2Y,KAAO3Y,KAAK0Y,KAAKjX,IAAIzB,KAAKe,GAAG2R,MAAM,GAAGU,IAAIpT,KAAKgQ,GACpDhQ,KAAK2Y,KAAO3Y,KAAK2Y,KAAKnF,KAAKxT,KAAKe,GAChCf,KAAK2Y,KAAO3Y,KAAKe,EAAE0H,IAAIzI,KAAK2Y,MA9a9Bd,EAAOpY,UAAUuY,KAAO,WACtB,IAAID,EAAM,IAAIpY,EAAG,MAEjB,OADAoY,EAAI7X,MAAQ,IAAI8B,MAAMf,KAAK4B,KAAK7C,KAAK+P,EAAI,KAClCgI,GAGTF,EAAOpY,UAAUmZ,QAAU,SAAkB7W,GAG3C,IACI8W,EADA9X,EAAIgB,EAGR,GACE/B,KAAK8Y,MAAM/X,EAAGf,KAAK+X,KAGnBc,GADA9X,GADAA,EAAIf,KAAK+Y,MAAMhY,IACTuH,KAAKtI,KAAK+X,MACPxR,kBACFsS,EAAO7Y,KAAK+P,GAErB,IAAI1N,EAAMwW,EAAO7Y,KAAK+P,GAAK,EAAIhP,EAAEqU,KAAKpV,KAAKsP,GAgB3C,OAfY,IAARjN,GACFtB,EAAEb,MAAM,GAAK,EACba,EAAEZ,OAAS,GACFkC,EAAM,EACftB,EAAEwH,KAAKvI,KAAKsP,QAEI0J,IAAZjY,EAAEkY,MAEJlY,EAAEkY,QAGFlY,EAAE4B,SAIC5B,GAGT8W,EAAOpY,UAAUqZ,MAAQ,SAAgBI,EAAO7U,GAC9C6U,EAAMrH,OAAO7R,KAAK+P,EAAG,EAAG1L,IAG1BwT,EAAOpY,UAAUsZ,MAAQ,SAAgBhX,GACvC,OAAOA,EAAI2K,KAAK1M,KAAKqF,IASvBjG,EAAS6Y,EAAMJ,GAEfI,EAAKxY,UAAUqZ,MAAQ,SAAgBI,EAAOC,GAK5C,IAHA,IAEIC,EAASnY,KAAKC,IAAIgY,EAAM/Y,OAAQ,GAC3BiB,EAAI,EAAGA,EAAIgY,EAAQhY,IAC1B+X,EAAOjZ,MAAMkB,GAAK8X,EAAMhZ,MAAMkB,GAIhC,GAFA+X,EAAOhZ,OAASiZ,EAEZF,EAAM/Y,QAAU,EAGlB,OAFA+Y,EAAMhZ,MAAM,GAAK,OACjBgZ,EAAM/Y,OAAS,GAKjB,IAAIkZ,EAAOH,EAAMhZ,MAAM,GAGvB,IAFAiZ,EAAOjZ,MAAMiZ,EAAOhZ,UAhBT,QAgBqBkZ,EAE3BjY,EAAI,GAAIA,EAAI8X,EAAM/Y,OAAQiB,IAAK,CAClC,IAAIkY,EAAwB,EAAjBJ,EAAMhZ,MAAMkB,GACvB8X,EAAMhZ,MAAMkB,EAAI,KApBP,QAoBekY,IAAgB,EAAMD,IAAS,GACvDA,EAAOC,EAETD,KAAU,GACVH,EAAMhZ,MAAMkB,EAAI,IAAMiY,EACT,IAATA,GAAcH,EAAM/Y,OAAS,GAC/B+Y,EAAM/Y,QAAU,GAEhB+Y,EAAM/Y,QAAU,GAIpB8X,EAAKxY,UAAUsZ,MAAQ,SAAgBhX,GAErCA,EAAI7B,MAAM6B,EAAI5B,QAAU,EACxB4B,EAAI7B,MAAM6B,EAAI5B,OAAS,GAAK,EAC5B4B,EAAI5B,QAAU,EAId,IADA,IAAIiF,EAAK,EACAhE,EAAI,EAAGA,EAAIW,EAAI5B,OAAQiB,IAAK,CACnC,IAAI2B,EAAmB,EAAfhB,EAAI7B,MAAMkB,GAClBgE,GAAU,IAAJrC,EACNhB,EAAI7B,MAAMkB,GAAU,SAALgE,EACfA,EAAS,GAAJrC,GAAaqC,EAAK,SAAa,GAUtC,OANkC,IAA9BrD,EAAI7B,MAAM6B,EAAI5B,OAAS,KACzB4B,EAAI5B,SAC8B,IAA9B4B,EAAI7B,MAAM6B,EAAI5B,OAAS,IACzB4B,EAAI5B,UAGD4B,GAST3C,EAAS+Y,EAAMN,GAQfzY,EAASgZ,EAAMP,GASfzY,EAASiZ,EAAQR,GAEjBQ,EAAO5Y,UAAUsZ,MAAQ,SAAgBhX,GAGvC,IADA,IAAIuC,EAAQ,EACHlD,EAAI,EAAGA,EAAIW,EAAI5B,OAAQiB,IAAK,CACnC,IAAIoF,EAA0B,IAAL,EAAfzE,EAAI7B,MAAMkB,IAAiBkD,EACjCc,EAAU,SAALoB,EACTA,KAAQ,GAERzE,EAAI7B,MAAMkB,GAAKgE,EACfd,EAAQkC,EAKV,OAHc,IAAVlC,IACFvC,EAAI7B,MAAM6B,EAAI5B,UAAYmE,GAErBvC,GAITpC,EAAG4Y,OAAS,SAAgBT,GAE1B,GAAIN,EAAOM,GAAO,OAAON,EAAOM,GAEhC,IAAIQ,EACJ,GAAa,SAATR,EACFQ,EAAQ,IAAIL,OACP,GAAa,SAATH,EACTQ,EAAQ,IAAIH,OACP,GAAa,SAATL,EACTQ,EAAQ,IAAIF,MACP,IAAa,WAATN,EAGT,MAAM,IAAI3Y,MAAM,iBAAmB2Y,GAFnCQ,EAAQ,IAAID,EAMd,OAFAb,EAAOM,GAAQQ,EAERA,GAkBTvC,EAAItW,UAAUwX,SAAW,SAAmB9R,GAC1CnG,EAAsB,IAAfmG,EAAElF,SAAgB,iCACzBjB,EAAOmG,EAAE/E,IAAK,oCAGhB2V,EAAItW,UAAUqX,SAAW,SAAmB3R,EAAG9D,GAC7CrC,EAAqC,IAA7BmG,EAAElF,SAAWoB,EAAEpB,UAAiB,iCACxCjB,EAAOmG,EAAE/E,KAAO+E,EAAE/E,MAAQiB,EAAEjB,IAC1B,oCAGJ2V,EAAItW,UAAUgZ,KAAO,SAAetT,GAClC,OAAInF,KAAKsY,MAActY,KAAKsY,MAAMM,QAAQzT,GAAGgR,UAAUnW,OAEvD0B,EAAKyD,EAAGA,EAAEqO,KAAKxT,KAAKgQ,GAAGmG,UAAUnW,OAC1BmF,IAGT4Q,EAAItW,UAAU2H,IAAM,SAAcjC,GAChC,OAAIA,EAAEV,SACGU,EAAExB,QAGJ3D,KAAKgQ,EAAEvH,IAAItD,GAAGgR,UAAUnW,OAGjC+V,EAAItW,UAAU+I,IAAM,SAAcrD,EAAG9D,GACnCrB,KAAK8W,SAAS3R,EAAG9D,GAEjB,IAAIuE,EAAMT,EAAEqD,IAAInH,GAIhB,OAHIuE,EAAIvD,IAAIrC,KAAKgQ,IAAM,GACrBpK,EAAI2C,KAAKvI,KAAKgQ,GAETpK,EAAIuQ,UAAUnW,OAGvB+V,EAAItW,UAAU6I,KAAO,SAAenD,EAAG9D,GACrCrB,KAAK8W,SAAS3R,EAAG9D,GAEjB,IAAIuE,EAAMT,EAAEmD,KAAKjH,GAIjB,OAHIuE,EAAIvD,IAAIrC,KAAKgQ,IAAM,GACrBpK,EAAI2C,KAAKvI,KAAKgQ,GAETpK,GAGTmQ,EAAItW,UAAUgJ,IAAM,SAActD,EAAG9D,GACnCrB,KAAK8W,SAAS3R,EAAG9D,GAEjB,IAAIuE,EAAMT,EAAEsD,IAAIpH,GAIhB,OAHIuE,EAAIqP,KAAK,GAAK,GAChBrP,EAAI0C,KAAKtI,KAAKgQ,GAETpK,EAAIuQ,UAAUnW,OAGvB+V,EAAItW,UAAU8I,KAAO,SAAepD,EAAG9D,GACrCrB,KAAK8W,SAAS3R,EAAG9D,GAEjB,IAAIuE,EAAMT,EAAEoD,KAAKlH,GAIjB,OAHIuE,EAAIqP,KAAK,GAAK,GAChBrP,EAAI0C,KAAKtI,KAAKgQ,GAETpK,GAGTmQ,EAAItW,UAAUmX,IAAM,SAAczR,EAAGpD,GAEnC,OADA/B,KAAKiX,SAAS9R,GACPnF,KAAKyY,KAAKtT,EAAEkN,MAAMtQ,KAG3BgU,EAAItW,UAAUiN,KAAO,SAAevH,EAAG9D,GAErC,OADArB,KAAK8W,SAAS3R,EAAG9D,GACVrB,KAAKyY,KAAKtT,EAAEuH,KAAKrL,KAG1B0U,EAAItW,UAAUgC,IAAM,SAAc0D,EAAG9D,GAEnC,OADArB,KAAK8W,SAAS3R,EAAG9D,GACVrB,KAAKyY,KAAKtT,EAAE1D,IAAIJ,KAGzB0U,EAAItW,UAAU4R,KAAO,SAAelM,GAClC,OAAOnF,KAAK0M,KAAKvH,EAAGA,EAAExB,UAGxBoS,EAAItW,UAAU2R,IAAM,SAAcjM,GAChC,OAAOnF,KAAKyB,IAAI0D,EAAGA,IAGrB4Q,EAAItW,UAAU2X,KAAO,SAAejS,GAClC,GAAIA,EAAEV,SAAU,OAAOU,EAAExB,QAEzB,IAAI4V,EAAOvZ,KAAKgQ,EAAE6D,MAAM,GAIxB,GAHA7U,EAAOua,EAAO,GAAM,GAGP,IAATA,EAAY,CACd,IAAI/V,EAAMxD,KAAKgQ,EAAExH,IAAI,IAAI7I,EAAG,IAAIkS,OAAO,GACvC,OAAO7R,KAAKwD,IAAI2B,EAAG3B,GAQrB,IAFA,IAAI+N,EAAIvR,KAAKgQ,EAAE4C,KAAK,GAChB5D,EAAI,GACAuC,EAAE9M,UAA2B,IAAf8M,EAAEsC,MAAM,IAC5B7E,IACAuC,EAAEM,OAAO,GAEX7S,GAAQuS,EAAE9M,UAEV,IAAI+U,EAAM,IAAI7Z,EAAG,GAAGqW,MAAMhW,MACtByZ,EAAOD,EAAIlC,SAIXoC,EAAO1Z,KAAKgQ,EAAE4C,KAAK,GAAGf,OAAO,GAC7B1Q,EAAInB,KAAKgQ,EAAEzJ,YAGf,IAFApF,EAAI,IAAIxB,EAAG,EAAIwB,EAAIA,GAAG6U,MAAMhW,MAEW,IAAhCA,KAAKwD,IAAIrC,EAAGuY,GAAMrX,IAAIoX,IAC3BtY,EAAEqV,QAAQiD,GAOZ,IAJA,IAAInY,EAAItB,KAAKwD,IAAIrC,EAAGoQ,GAChBxQ,EAAIf,KAAKwD,IAAI2B,EAAGoM,EAAEoB,KAAK,GAAGd,OAAO,IACjCxL,EAAIrG,KAAKwD,IAAI2B,EAAGoM,GAChBvB,EAAIhB,EACc,IAAf3I,EAAEhE,IAAImX,IAAY,CAEvB,IADA,IAAIzB,EAAM1R,EACDjF,EAAI,EAAoB,IAAjB2W,EAAI1V,IAAImX,GAAYpY,IAClC2W,EAAMA,EAAIf,SAEZhY,EAAOoC,EAAI4O,GACX,IAAI3O,EAAIrB,KAAKwD,IAAIlC,EAAG,IAAI3B,EAAG,GAAG6R,OAAOxB,EAAI5O,EAAI,IAE7CL,EAAIA,EAAE8V,OAAOxV,GACbC,EAAID,EAAE2V,SACN3Q,EAAIA,EAAEwQ,OAAOvV,GACb0O,EAAI5O,EAGN,OAAOL,GAGTgV,EAAItW,UAAUyV,KAAO,SAAe/P,GAClC,IAAIwU,EAAMxU,EAAE0P,OAAO7U,KAAKgQ,GACxB,OAAqB,IAAjB2J,EAAI1Z,UACN0Z,EAAI1Z,SAAW,EACRD,KAAKyY,KAAKkB,GAAKrC,UAEftX,KAAKyY,KAAKkB,IAIrB5D,EAAItW,UAAU+D,IAAM,SAAc2B,EAAGpD,GACnC,GAAIA,EAAI0C,SAAU,OAAO,IAAI9E,EAAG,GAAGqW,MAAMhW,MACzC,GAAoB,IAAhB+B,EAAIkT,KAAK,GAAU,OAAO9P,EAAExB,QAEhC,IACIiW,EAAM,IAAI5X,MAAM,IACpB4X,EAAI,GAAK,IAAIja,EAAG,GAAGqW,MAAMhW,MACzB4Z,EAAI,GAAKzU,EACT,IAAK,IAAI/D,EAAI,EAAGA,EAAIwY,EAAIzZ,OAAQiB,IAC9BwY,EAAIxY,GAAKpB,KAAKyB,IAAImY,EAAIxY,EAAI,GAAI+D,GAGhC,IAAIS,EAAMgU,EAAI,GACVC,EAAU,EACVC,EAAa,EACbjZ,EAAQkB,EAAIwE,YAAc,GAK9B,IAJc,IAAV1F,IACFA,EAAQ,IAGLO,EAAIW,EAAI5B,OAAS,EAAGiB,GAAK,EAAGA,IAAK,CAEpC,IADA,IAAIiC,EAAOtB,EAAI7B,MAAMkB,GACZ0B,EAAIjC,EAAQ,EAAGiC,GAAK,EAAGA,IAAK,CACnC,IAAIsF,EAAO/E,GAAQP,EAAK,EACpB8C,IAAQgU,EAAI,KACdhU,EAAM5F,KAAKoR,IAAIxL,IAGL,IAARwC,GAAyB,IAAZyR,GAKjBA,IAAY,EACZA,GAAWzR,GA9BE,MA+Bb0R,GACwC,IAAN1Y,GAAiB,IAAN0B,KAE7C8C,EAAM5F,KAAKyB,IAAImE,EAAKgU,EAAIC,IACxBC,EAAa,EACbD,EAAU,IAXRC,EAAa,EAajBjZ,EAAQ,GAGV,OAAO+E,GAGTmQ,EAAItW,UAAUyW,UAAY,SAAoBnU,GAC5C,IAAIhB,EAAIgB,EAAIyR,KAAKxT,KAAKgQ,GAEtB,OAAOjP,IAAMgB,EAAMhB,EAAE4C,QAAU5C,GAGjCgV,EAAItW,UAAU4W,YAAc,SAAsBtU,GAChD,IAAI6D,EAAM7D,EAAI4B,QAEd,OADAiC,EAAIxF,IAAM,KACHwF,GAOTjG,EAAGoa,KAAO,SAAehY,GACvB,OAAO,IAAIyW,EAAKzW,IAmBlB3C,EAASoZ,EAAMzC,GAEfyC,EAAK/Y,UAAUyW,UAAY,SAAoBnU,GAC7C,OAAO/B,KAAKyY,KAAK1W,EAAIsQ,MAAMrS,KAAKiG,SAGlCuS,EAAK/Y,UAAU4W,YAAc,SAAsBtU,GACjD,IAAIhB,EAAIf,KAAKyY,KAAK1W,EAAIN,IAAIzB,KAAK0Y,OAE/B,OADA3X,EAAEX,IAAM,KACDW,GAGTyX,EAAK/Y,UAAUiN,KAAO,SAAevH,EAAG9D,GACtC,GAAI8D,EAAEV,UAAYpD,EAAEoD,SAGlB,OAFAU,EAAEjF,MAAM,GAAK,EACbiF,EAAEhF,OAAS,EACJgF,EAGT,IAAIkB,EAAIlB,EAAEuH,KAAKrL,GACXC,EAAI+E,EAAEoM,MAAMzS,KAAKiG,OAAOxE,IAAIzB,KAAK2Y,MAAMnG,OAAOxS,KAAKiG,OAAOxE,IAAIzB,KAAKgQ,GACnEgK,EAAI3T,EAAEkC,KAAKjH,GAAGuQ,OAAO7R,KAAKiG,OAC1BL,EAAMoU,EAQV,OANIA,EAAE3X,IAAIrC,KAAKgQ,IAAM,EACnBpK,EAAMoU,EAAEzR,KAAKvI,KAAKgQ,GACTgK,EAAE/E,KAAK,GAAK,IACrBrP,EAAMoU,EAAE1R,KAAKtI,KAAKgQ,IAGbpK,EAAIuQ,UAAUnW,OAGvBwY,EAAK/Y,UAAUgC,IAAM,SAAc0D,EAAG9D,GACpC,GAAI8D,EAAEV,UAAYpD,EAAEoD,SAAU,OAAO,IAAI9E,EAAG,GAAGwW,UAAUnW,MAEzD,IAAIqG,EAAIlB,EAAE1D,IAAIJ,GACVC,EAAI+E,EAAEoM,MAAMzS,KAAKiG,OAAOxE,IAAIzB,KAAK2Y,MAAMnG,OAAOxS,KAAKiG,OAAOxE,IAAIzB,KAAKgQ,GACnEgK,EAAI3T,EAAEkC,KAAKjH,GAAGuQ,OAAO7R,KAAKiG,OAC1BL,EAAMoU,EAOV,OANIA,EAAE3X,IAAIrC,KAAKgQ,IAAM,EACnBpK,EAAMoU,EAAEzR,KAAKvI,KAAKgQ,GACTgK,EAAE/E,KAAK,GAAK,IACrBrP,EAAMoU,EAAE1R,KAAKtI,KAAKgQ,IAGbpK,EAAIuQ,UAAUnW,OAGvBwY,EAAK/Y,UAAUyV,KAAO,SAAe/P,GAGnC,OADUnF,KAAKyY,KAAKtT,EAAE0P,OAAO7U,KAAKgQ,GAAGvO,IAAIzB,KAAK4T,KACnCuC,UAAUnW,OA78GzB,CA+8GoCO,EAAQP,Q","file":"vendor.bn.js~62ab5815.75e07065630eb3156263.chunk.js","sourcesContent":["(function (module, exports) {\n  'use strict';\n\n  // Utils\n  function assert (val, msg) {\n    if (!val) throw new Error(msg || 'Assertion failed');\n  }\n\n  // Could use `inherits` module, but don't want to move from single file\n  // architecture yet.\n  function inherits (ctor, superCtor) {\n    ctor.super_ = superCtor;\n    var TempCtor = function () {};\n    TempCtor.prototype = superCtor.prototype;\n    ctor.prototype = new TempCtor();\n    ctor.prototype.constructor = ctor;\n  }\n\n  // BN\n\n  function BN (number, base, endian) {\n    if (BN.isBN(number)) {\n      return number;\n    }\n\n    this.negative = 0;\n    this.words = null;\n    this.length = 0;\n\n    // Reduction context\n    this.red = null;\n\n    if (number !== null) {\n      if (base === 'le' || base === 'be') {\n        endian = base;\n        base = 10;\n      }\n\n      this._init(number || 0, base || 10, endian || 'be');\n    }\n  }\n  if (typeof module === 'object') {\n    module.exports = BN;\n  } else {\n    exports.BN = BN;\n  }\n\n  BN.BN = BN;\n  BN.wordSize = 26;\n\n  var Buffer;\n  try {\n    Buffer = require('buffer').Buffer;\n  } catch (e) {\n  }\n\n  BN.isBN = function isBN (num) {\n    if (num instanceof BN) {\n      return true;\n    }\n\n    return num !== null && typeof num === 'object' &&\n      num.constructor.wordSize === BN.wordSize && Array.isArray(num.words);\n  };\n\n  BN.max = function max (left, right) {\n    if (left.cmp(right) > 0) return left;\n    return right;\n  };\n\n  BN.min = function min (left, right) {\n    if (left.cmp(right) < 0) return left;\n    return right;\n  };\n\n  BN.prototype._init = function init (number, base, endian) {\n    if (typeof number === 'number') {\n      return this._initNumber(number, base, endian);\n    }\n\n    if (typeof number === 'object') {\n      return this._initArray(number, base, endian);\n    }\n\n    if (base === 'hex') {\n      base = 16;\n    }\n    assert(base === (base | 0) && base >= 2 && base <= 36);\n\n    number = number.toString().replace(/\\s+/g, '');\n    var start = 0;\n    if (number[0] === '-') {\n      start++;\n    }\n\n    if (base === 16) {\n      this._parseHex(number, start);\n    } else {\n      this._parseBase(number, base, start);\n    }\n\n    if (number[0] === '-') {\n      this.negative = 1;\n    }\n\n    this._strip();\n\n    if (endian !== 'le') return;\n\n    this._initArray(this.toArray(), base, endian);\n  };\n\n  BN.prototype._initNumber = function _initNumber (number, base, endian) {\n    if (number < 0) {\n      this.negative = 1;\n      number = -number;\n    }\n    if (number < 0x4000000) {\n      this.words = [number & 0x3ffffff];\n      this.length = 1;\n    } else if (number < 0x10000000000000) {\n      this.words = [\n        number & 0x3ffffff,\n        (number / 0x4000000) & 0x3ffffff\n      ];\n      this.length = 2;\n    } else {\n      assert(number < 0x20000000000000); // 2 ^ 53 (unsafe)\n      this.words = [\n        number & 0x3ffffff,\n        (number / 0x4000000) & 0x3ffffff,\n        1\n      ];\n      this.length = 3;\n    }\n\n    if (endian !== 'le') return;\n\n    // Reverse the bytes\n    this._initArray(this.toArray(), base, endian);\n  };\n\n  BN.prototype._initArray = function _initArray (number, base, endian) {\n    // Perhaps a Uint8Array\n    assert(typeof number.length === 'number');\n    if (number.length <= 0) {\n      this.words = [0];\n      this.length = 1;\n      return this;\n    }\n\n    this.length = Math.ceil(number.length / 3);\n    this.words = new Array(this.length);\n    for (var i = 0; i < this.length; i++) {\n      this.words[i] = 0;\n    }\n\n    var j, w;\n    var off = 0;\n    if (endian === 'be') {\n      for (i = number.length - 1, j = 0; i >= 0; i -= 3) {\n        w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16);\n        this.words[j] |= (w << off) & 0x3ffffff;\n        this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff;\n        off += 24;\n        if (off >= 26) {\n          off -= 26;\n          j++;\n        }\n      }\n    } else if (endian === 'le') {\n      for (i = 0, j = 0; i < number.length; i += 3) {\n        w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16);\n        this.words[j] |= (w << off) & 0x3ffffff;\n        this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff;\n        off += 24;\n        if (off >= 26) {\n          off -= 26;\n          j++;\n        }\n      }\n    }\n    return this._strip();\n  };\n\n  function parseHex (str, start, end) {\n    var r = 0;\n    var len = Math.min(str.length, end);\n    var z = 0;\n    for (var i = start; i < len; i++) {\n      var c = str.charCodeAt(i) - 48;\n\n      r <<= 4;\n\n      var b;\n\n      // 'a' - 'f'\n      if (c >= 49 && c <= 54) {\n        b = c - 49 + 0xa;\n\n      // 'A' - 'F'\n      } else if (c >= 17 && c <= 22) {\n        b = c - 17 + 0xa;\n\n      // '0' - '9'\n      } else {\n        b = c;\n      }\n\n      r |= b;\n      z |= b;\n    }\n\n    assert(!(z & 0xf0), 'Invalid character in ' + str);\n    return r;\n  }\n\n  BN.prototype._parseHex = function _parseHex (number, start) {\n    // Create possibly bigger array to ensure that it fits the number\n    this.length = Math.ceil((number.length - start) / 6);\n    this.words = new Array(this.length);\n    for (var i = 0; i < this.length; i++) {\n      this.words[i] = 0;\n    }\n\n    var j, w;\n    // Scan 24-bit chunks and add them to the number\n    var off = 0;\n    for (i = number.length - 6, j = 0; i >= start; i -= 6) {\n      w = parseHex(number, i, i + 6);\n      this.words[j] |= (w << off) & 0x3ffffff;\n      // NOTE: `0x3fffff` is intentional here, 26bits max shift + 24bit hex limb\n      this.words[j + 1] |= w >>> (26 - off) & 0x3fffff;\n      off += 24;\n      if (off >= 26) {\n        off -= 26;\n        j++;\n      }\n    }\n    if (i + 6 !== start) {\n      w = parseHex(number, start, i + 6);\n      this.words[j] |= (w << off) & 0x3ffffff;\n      this.words[j + 1] |= w >>> (26 - off) & 0x3fffff;\n    }\n    this._strip();\n  };\n\n  function parseBase (str, start, end, mul) {\n    var r = 0;\n    var b = 0;\n    var len = Math.min(str.length, end);\n    for (var i = start; i < len; i++) {\n      var c = str.charCodeAt(i) - 48;\n\n      r *= mul;\n\n      // 'a'\n      if (c >= 49) {\n        b = c - 49 + 0xa;\n\n      // 'A'\n      } else if (c >= 17) {\n        b = c - 17 + 0xa;\n\n      // '0' - '9'\n      } else {\n        b = c;\n      }\n      assert(c >= 0 && b < mul, 'Invalid character');\n      r += b;\n    }\n    return r;\n  }\n\n  BN.prototype._parseBase = function _parseBase (number, base, start) {\n    // Initialize as zero\n    this.words = [0];\n    this.length = 1;\n\n    // Find length of limb in base\n    for (var limbLen = 0, limbPow = 1; limbPow <= 0x3ffffff; limbPow *= base) {\n      limbLen++;\n    }\n    limbLen--;\n    limbPow = (limbPow / base) | 0;\n\n    var total = number.length - start;\n    var mod = total % limbLen;\n    var end = Math.min(total, total - mod) + start;\n\n    var word = 0;\n    for (var i = start; i < end; i += limbLen) {\n      word = parseBase(number, i, i + limbLen, base);\n\n      this.imuln(limbPow);\n      if (this.words[0] + word < 0x4000000) {\n        this.words[0] += word;\n      } else {\n        this._iaddn(word);\n      }\n    }\n\n    if (mod !== 0) {\n      var pow = 1;\n      word = parseBase(number, i, number.length, base);\n\n      for (i = 0; i < mod; i++) {\n        pow *= base;\n      }\n\n      this.imuln(pow);\n      if (this.words[0] + word < 0x4000000) {\n        this.words[0] += word;\n      } else {\n        this._iaddn(word);\n      }\n    }\n  };\n\n  BN.prototype.copy = function copy (dest) {\n    dest.words = new Array(this.length);\n    for (var i = 0; i < this.length; i++) {\n      dest.words[i] = this.words[i];\n    }\n    dest.length = this.length;\n    dest.negative = this.negative;\n    dest.red = this.red;\n  };\n\n  function move (dest, src) {\n    dest.words = src.words;\n    dest.length = src.length;\n    dest.negative = src.negative;\n    dest.red = src.red;\n  }\n\n  BN.prototype._move = function _move (dest) {\n    move(dest, this);\n  };\n\n  BN.prototype.clone = function clone () {\n    var r = new BN(null);\n    this.copy(r);\n    return r;\n  };\n\n  BN.prototype._expand = function _expand (size) {\n    while (this.length < size) {\n      this.words[this.length++] = 0;\n    }\n    return this;\n  };\n\n  // Remove leading `0` from `this`\n  BN.prototype._strip = function strip () {\n    while (this.length > 1 && this.words[this.length - 1] === 0) {\n      this.length--;\n    }\n    return this._normSign();\n  };\n\n  BN.prototype._normSign = function _normSign () {\n    // -0 = 0\n    if (this.length === 1 && this.words[0] === 0) {\n      this.negative = 0;\n    }\n    return this;\n  };\n\n  // Check Symbol.for because not everywhere where Symbol defined\n  // See https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Symbol#Browser_compatibility\n  if (typeof Symbol !== 'undefined' && typeof Symbol.for === 'function') {\n    BN.prototype[Symbol.for('nodejs.util.inspect.custom')] = inspect;\n  } else {\n    BN.prototype.inspect = inspect;\n  }\n\n  function inspect () {\n    return (this.red ? '<BN-R: ' : '<BN: ') + this.toString(16) + '>';\n  }\n\n  /*\n\n  var zeros = [];\n  var groupSizes = [];\n  var groupBases = [];\n\n  var s = '';\n  var i = -1;\n  while (++i < BN.wordSize) {\n    zeros[i] = s;\n    s += '0';\n  }\n  groupSizes[0] = 0;\n  groupSizes[1] = 0;\n  groupBases[0] = 0;\n  groupBases[1] = 0;\n  var base = 2 - 1;\n  while (++base < 36 + 1) {\n    var groupSize = 0;\n    var groupBase = 1;\n    while (groupBase < (1 << BN.wordSize) / base) {\n      groupBase *= base;\n      groupSize += 1;\n    }\n    groupSizes[base] = groupSize;\n    groupBases[base] = groupBase;\n  }\n\n  */\n\n  var zeros = [\n    '',\n    '0',\n    '00',\n    '000',\n    '0000',\n    '00000',\n    '000000',\n    '0000000',\n    '00000000',\n    '000000000',\n    '0000000000',\n    '00000000000',\n    '000000000000',\n    '0000000000000',\n    '00000000000000',\n    '000000000000000',\n    '0000000000000000',\n    '00000000000000000',\n    '000000000000000000',\n    '0000000000000000000',\n    '00000000000000000000',\n    '000000000000000000000',\n    '0000000000000000000000',\n    '00000000000000000000000',\n    '000000000000000000000000',\n    '0000000000000000000000000'\n  ];\n\n  var groupSizes = [\n    0, 0,\n    25, 16, 12, 11, 10, 9, 8,\n    8, 7, 7, 7, 7, 6, 6,\n    6, 6, 6, 6, 6, 5, 5,\n    5, 5, 5, 5, 5, 5, 5,\n    5, 5, 5, 5, 5, 5, 5\n  ];\n\n  var groupBases = [\n    0, 0,\n    33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216,\n    43046721, 10000000, 19487171, 35831808, 62748517, 7529536, 11390625,\n    16777216, 24137569, 34012224, 47045881, 64000000, 4084101, 5153632,\n    6436343, 7962624, 9765625, 11881376, 14348907, 17210368, 20511149,\n    24300000, 28629151, 33554432, 39135393, 45435424, 52521875, 60466176\n  ];\n\n  BN.prototype.toString = function toString (base, padding) {\n    base = base || 10;\n    padding = padding | 0 || 1;\n\n    var out;\n    if (base === 16 || base === 'hex') {\n      out = '';\n      var off = 0;\n      var carry = 0;\n      for (var i = 0; i < this.length; i++) {\n        var w = this.words[i];\n        var word = (((w << off) | carry) & 0xffffff).toString(16);\n        carry = (w >>> (24 - off)) & 0xffffff;\n        if (carry !== 0 || i !== this.length - 1) {\n          out = zeros[6 - word.length] + word + out;\n        } else {\n          out = word + out;\n        }\n        off += 2;\n        if (off >= 26) {\n          off -= 26;\n          i--;\n        }\n      }\n      if (carry !== 0) {\n        out = carry.toString(16) + out;\n      }\n      while (out.length % padding !== 0) {\n        out = '0' + out;\n      }\n      if (this.negative !== 0) {\n        out = '-' + out;\n      }\n      return out;\n    }\n\n    if (base === (base | 0) && base >= 2 && base <= 36) {\n      // var groupSize = Math.floor(BN.wordSize * Math.LN2 / Math.log(base));\n      var groupSize = groupSizes[base];\n      // var groupBase = Math.pow(base, groupSize);\n      var groupBase = groupBases[base];\n      out = '';\n      var c = this.clone();\n      c.negative = 0;\n      while (!c.isZero()) {\n        var r = c.modrn(groupBase).toString(base);\n        c = c.idivn(groupBase);\n\n        if (!c.isZero()) {\n          out = zeros[groupSize - r.length] + r + out;\n        } else {\n          out = r + out;\n        }\n      }\n      if (this.isZero()) {\n        out = '0' + out;\n      }\n      while (out.length % padding !== 0) {\n        out = '0' + out;\n      }\n      if (this.negative !== 0) {\n        out = '-' + out;\n      }\n      return out;\n    }\n\n    assert(false, 'Base should be between 2 and 36');\n  };\n\n  BN.prototype.toNumber = function toNumber () {\n    var ret = this.words[0];\n    if (this.length === 2) {\n      ret += this.words[1] * 0x4000000;\n    } else if (this.length === 3 && this.words[2] === 0x01) {\n      // NOTE: at this stage it is known that the top bit is set\n      ret += 0x10000000000000 + (this.words[1] * 0x4000000);\n    } else if (this.length > 2) {\n      assert(false, 'Number can only safely store up to 53 bits');\n    }\n    return (this.negative !== 0) ? -ret : ret;\n  };\n\n  BN.prototype.toJSON = function toJSON () {\n    return this.toString(16, 2);\n  };\n\n  if (Buffer) {\n    BN.prototype.toBuffer = function toBuffer (endian, length) {\n      return this.toArrayLike(Buffer, endian, length);\n    };\n  }\n\n  BN.prototype.toArray = function toArray (endian, length) {\n    return this.toArrayLike(Array, endian, length);\n  };\n\n  var allocate = function allocate (ArrayType, size) {\n    if (ArrayType.allocUnsafe) {\n      return ArrayType.allocUnsafe(size);\n    }\n    return new ArrayType(size);\n  };\n\n  BN.prototype.toArrayLike = function toArrayLike (ArrayType, endian, length) {\n    this._strip();\n\n    var byteLength = this.byteLength();\n    var reqLength = length || Math.max(1, byteLength);\n    assert(byteLength <= reqLength, 'byte array longer than desired length');\n    assert(reqLength > 0, 'Requested array length <= 0');\n\n    var res = allocate(ArrayType, reqLength);\n    var postfix = endian === 'le' ? 'LE' : 'BE';\n    this['_toArrayLike' + postfix](res, byteLength);\n    return res;\n  };\n\n  BN.prototype._toArrayLikeLE = function _toArrayLikeLE (res, byteLength) {\n    var position = 0;\n    var carry = 0;\n\n    for (var i = 0, shift = 0; i < this.length; i++) {\n      var word = (this.words[i] << shift) | carry;\n\n      res[position++] = word & 0xff;\n      if (position < res.length) {\n        res[position++] = (word >> 8) & 0xff;\n      }\n      if (position < res.length) {\n        res[position++] = (word >> 16) & 0xff;\n      }\n\n      if (shift === 6) {\n        if (position < res.length) {\n          res[position++] = (word >> 24) & 0xff;\n        }\n        carry = 0;\n        shift = 0;\n      } else {\n        carry = word >>> 24;\n        shift += 2;\n      }\n    }\n\n    if (position < res.length) {\n      res[position++] = carry;\n\n      while (position < res.length) {\n        res[position++] = 0;\n      }\n    }\n  };\n\n  BN.prototype._toArrayLikeBE = function _toArrayLikeBE (res, byteLength) {\n    var position = res.length - 1;\n    var carry = 0;\n\n    for (var i = 0, shift = 0; i < this.length; i++) {\n      var word = (this.words[i] << shift) | carry;\n\n      res[position--] = word & 0xff;\n      if (position >= 0) {\n        res[position--] = (word >> 8) & 0xff;\n      }\n      if (position >= 0) {\n        res[position--] = (word >> 16) & 0xff;\n      }\n\n      if (shift === 6) {\n        if (position >= 0) {\n          res[position--] = (word >> 24) & 0xff;\n        }\n        carry = 0;\n        shift = 0;\n      } else {\n        carry = word >>> 24;\n        shift += 2;\n      }\n    }\n\n    if (position >= 0) {\n      res[position--] = carry;\n\n      while (position >= 0) {\n        res[position--] = 0;\n      }\n    }\n  };\n\n  if (Math.clz32) {\n    BN.prototype._countBits = function _countBits (w) {\n      return 32 - Math.clz32(w);\n    };\n  } else {\n    BN.prototype._countBits = function _countBits (w) {\n      var t = w;\n      var r = 0;\n      if (t >= 0x1000) {\n        r += 13;\n        t >>>= 13;\n      }\n      if (t >= 0x40) {\n        r += 7;\n        t >>>= 7;\n      }\n      if (t >= 0x8) {\n        r += 4;\n        t >>>= 4;\n      }\n      if (t >= 0x02) {\n        r += 2;\n        t >>>= 2;\n      }\n      return r + t;\n    };\n  }\n\n  BN.prototype._zeroBits = function _zeroBits (w) {\n    // Short-cut\n    if (w === 0) return 26;\n\n    var t = w;\n    var r = 0;\n    if ((t & 0x1fff) === 0) {\n      r += 13;\n      t >>>= 13;\n    }\n    if ((t & 0x7f) === 0) {\n      r += 7;\n      t >>>= 7;\n    }\n    if ((t & 0xf) === 0) {\n      r += 4;\n      t >>>= 4;\n    }\n    if ((t & 0x3) === 0) {\n      r += 2;\n      t >>>= 2;\n    }\n    if ((t & 0x1) === 0) {\n      r++;\n    }\n    return r;\n  };\n\n  // Return number of used bits in a BN\n  BN.prototype.bitLength = function bitLength () {\n    var w = this.words[this.length - 1];\n    var hi = this._countBits(w);\n    return (this.length - 1) * 26 + hi;\n  };\n\n  function toBitArray (num) {\n    var w = new Array(num.bitLength());\n\n    for (var bit = 0; bit < w.length; bit++) {\n      var off = (bit / 26) | 0;\n      var wbit = bit % 26;\n\n      w[bit] = (num.words[off] >>> wbit) & 0x01;\n    }\n\n    return w;\n  }\n\n  // Number of trailing zero bits\n  BN.prototype.zeroBits = function zeroBits () {\n    if (this.isZero()) return 0;\n\n    var r = 0;\n    for (var i = 0; i < this.length; i++) {\n      var b = this._zeroBits(this.words[i]);\n      r += b;\n      if (b !== 26) break;\n    }\n    return r;\n  };\n\n  BN.prototype.byteLength = function byteLength () {\n    return Math.ceil(this.bitLength() / 8);\n  };\n\n  BN.prototype.toTwos = function toTwos (width) {\n    if (this.negative !== 0) {\n      return this.abs().inotn(width).iaddn(1);\n    }\n    return this.clone();\n  };\n\n  BN.prototype.fromTwos = function fromTwos (width) {\n    if (this.testn(width - 1)) {\n      return this.notn(width).iaddn(1).ineg();\n    }\n    return this.clone();\n  };\n\n  BN.prototype.isNeg = function isNeg () {\n    return this.negative !== 0;\n  };\n\n  // Return negative clone of `this`\n  BN.prototype.neg = function neg () {\n    return this.clone().ineg();\n  };\n\n  BN.prototype.ineg = function ineg () {\n    if (!this.isZero()) {\n      this.negative ^= 1;\n    }\n\n    return this;\n  };\n\n  // Or `num` with `this` in-place\n  BN.prototype.iuor = function iuor (num) {\n    while (this.length < num.length) {\n      this.words[this.length++] = 0;\n    }\n\n    for (var i = 0; i < num.length; i++) {\n      this.words[i] = this.words[i] | num.words[i];\n    }\n\n    return this._strip();\n  };\n\n  BN.prototype.ior = function ior (num) {\n    assert((this.negative | num.negative) === 0);\n    return this.iuor(num);\n  };\n\n  // Or `num` with `this`\n  BN.prototype.or = function or (num) {\n    if (this.length > num.length) return this.clone().ior(num);\n    return num.clone().ior(this);\n  };\n\n  BN.prototype.uor = function uor (num) {\n    if (this.length > num.length) return this.clone().iuor(num);\n    return num.clone().iuor(this);\n  };\n\n  // And `num` with `this` in-place\n  BN.prototype.iuand = function iuand (num) {\n    // b = min-length(num, this)\n    var b;\n    if (this.length > num.length) {\n      b = num;\n    } else {\n      b = this;\n    }\n\n    for (var i = 0; i < b.length; i++) {\n      this.words[i] = this.words[i] & num.words[i];\n    }\n\n    this.length = b.length;\n\n    return this._strip();\n  };\n\n  BN.prototype.iand = function iand (num) {\n    assert((this.negative | num.negative) === 0);\n    return this.iuand(num);\n  };\n\n  // And `num` with `this`\n  BN.prototype.and = function and (num) {\n    if (this.length > num.length) return this.clone().iand(num);\n    return num.clone().iand(this);\n  };\n\n  BN.prototype.uand = function uand (num) {\n    if (this.length > num.length) return this.clone().iuand(num);\n    return num.clone().iuand(this);\n  };\n\n  // Xor `num` with `this` in-place\n  BN.prototype.iuxor = function iuxor (num) {\n    // a.length > b.length\n    var a;\n    var b;\n    if (this.length > num.length) {\n      a = this;\n      b = num;\n    } else {\n      a = num;\n      b = this;\n    }\n\n    for (var i = 0; i < b.length; i++) {\n      this.words[i] = a.words[i] ^ b.words[i];\n    }\n\n    if (this !== a) {\n      for (; i < a.length; i++) {\n        this.words[i] = a.words[i];\n      }\n    }\n\n    this.length = a.length;\n\n    return this._strip();\n  };\n\n  BN.prototype.ixor = function ixor (num) {\n    assert((this.negative | num.negative) === 0);\n    return this.iuxor(num);\n  };\n\n  // Xor `num` with `this`\n  BN.prototype.xor = function xor (num) {\n    if (this.length > num.length) return this.clone().ixor(num);\n    return num.clone().ixor(this);\n  };\n\n  BN.prototype.uxor = function uxor (num) {\n    if (this.length > num.length) return this.clone().iuxor(num);\n    return num.clone().iuxor(this);\n  };\n\n  // Not ``this`` with ``width`` bitwidth\n  BN.prototype.inotn = function inotn (width) {\n    assert(typeof width === 'number' && width >= 0);\n\n    var bytesNeeded = Math.ceil(width / 26) | 0;\n    var bitsLeft = width % 26;\n\n    // Extend the buffer with leading zeroes\n    this._expand(bytesNeeded);\n\n    if (bitsLeft > 0) {\n      bytesNeeded--;\n    }\n\n    // Handle complete words\n    for (var i = 0; i < bytesNeeded; i++) {\n      this.words[i] = ~this.words[i] & 0x3ffffff;\n    }\n\n    // Handle the residue\n    if (bitsLeft > 0) {\n      this.words[i] = ~this.words[i] & (0x3ffffff >> (26 - bitsLeft));\n    }\n\n    // And remove leading zeroes\n    return this._strip();\n  };\n\n  BN.prototype.notn = function notn (width) {\n    return this.clone().inotn(width);\n  };\n\n  // Set `bit` of `this`\n  BN.prototype.setn = function setn (bit, val) {\n    assert(typeof bit === 'number' && bit >= 0);\n\n    var off = (bit / 26) | 0;\n    var wbit = bit % 26;\n\n    this._expand(off + 1);\n\n    if (val) {\n      this.words[off] = this.words[off] | (1 << wbit);\n    } else {\n      this.words[off] = this.words[off] & ~(1 << wbit);\n    }\n\n    return this._strip();\n  };\n\n  // Add `num` to `this` in-place\n  BN.prototype.iadd = function iadd (num) {\n    var r;\n\n    // negative + positive\n    if (this.negative !== 0 && num.negative === 0) {\n      this.negative = 0;\n      r = this.isub(num);\n      this.negative ^= 1;\n      return this._normSign();\n\n    // positive + negative\n    } else if (this.negative === 0 && num.negative !== 0) {\n      num.negative = 0;\n      r = this.isub(num);\n      num.negative = 1;\n      return r._normSign();\n    }\n\n    // a.length > b.length\n    var a, b;\n    if (this.length > num.length) {\n      a = this;\n      b = num;\n    } else {\n      a = num;\n      b = this;\n    }\n\n    var carry = 0;\n    for (var i = 0; i < b.length; i++) {\n      r = (a.words[i] | 0) + (b.words[i] | 0) + carry;\n      this.words[i] = r & 0x3ffffff;\n      carry = r >>> 26;\n    }\n    for (; carry !== 0 && i < a.length; i++) {\n      r = (a.words[i] | 0) + carry;\n      this.words[i] = r & 0x3ffffff;\n      carry = r >>> 26;\n    }\n\n    this.length = a.length;\n    if (carry !== 0) {\n      this.words[this.length] = carry;\n      this.length++;\n    // Copy the rest of the words\n    } else if (a !== this) {\n      for (; i < a.length; i++) {\n        this.words[i] = a.words[i];\n      }\n    }\n\n    return this;\n  };\n\n  // Add `num` to `this`\n  BN.prototype.add = function add (num) {\n    var res;\n    if (num.negative !== 0 && this.negative === 0) {\n      num.negative = 0;\n      res = this.sub(num);\n      num.negative ^= 1;\n      return res;\n    } else if (num.negative === 0 && this.negative !== 0) {\n      this.negative = 0;\n      res = num.sub(this);\n      this.negative = 1;\n      return res;\n    }\n\n    if (this.length > num.length) return this.clone().iadd(num);\n\n    return num.clone().iadd(this);\n  };\n\n  // Subtract `num` from `this` in-place\n  BN.prototype.isub = function isub (num) {\n    // this - (-num) = this + num\n    if (num.negative !== 0) {\n      num.negative = 0;\n      var r = this.iadd(num);\n      num.negative = 1;\n      return r._normSign();\n\n    // -this - num = -(this + num)\n    } else if (this.negative !== 0) {\n      this.negative = 0;\n      this.iadd(num);\n      this.negative = 1;\n      return this._normSign();\n    }\n\n    // At this point both numbers are positive\n    var cmp = this.cmp(num);\n\n    // Optimization - zeroify\n    if (cmp === 0) {\n      this.negative = 0;\n      this.length = 1;\n      this.words[0] = 0;\n      return this;\n    }\n\n    // a > b\n    var a, b;\n    if (cmp > 0) {\n      a = this;\n      b = num;\n    } else {\n      a = num;\n      b = this;\n    }\n\n    var carry = 0;\n    for (var i = 0; i < b.length; i++) {\n      r = (a.words[i] | 0) - (b.words[i] | 0) + carry;\n      carry = r >> 26;\n      this.words[i] = r & 0x3ffffff;\n    }\n    for (; carry !== 0 && i < a.length; i++) {\n      r = (a.words[i] | 0) + carry;\n      carry = r >> 26;\n      this.words[i] = r & 0x3ffffff;\n    }\n\n    // Copy rest of the words\n    if (carry === 0 && i < a.length && a !== this) {\n      for (; i < a.length; i++) {\n        this.words[i] = a.words[i];\n      }\n    }\n\n    this.length = Math.max(this.length, i);\n\n    if (a !== this) {\n      this.negative = 1;\n    }\n\n    return this._strip();\n  };\n\n  // Subtract `num` from `this`\n  BN.prototype.sub = function sub (num) {\n    return this.clone().isub(num);\n  };\n\n  function smallMulTo (self, num, out) {\n    out.negative = num.negative ^ self.negative;\n    var len = (self.length + num.length) | 0;\n    out.length = len;\n    len = (len - 1) | 0;\n\n    // Peel one iteration (compiler can't do it, because of code complexity)\n    var a = self.words[0] | 0;\n    var b = num.words[0] | 0;\n    var r = a * b;\n\n    var lo = r & 0x3ffffff;\n    var carry = (r / 0x4000000) | 0;\n    out.words[0] = lo;\n\n    for (var k = 1; k < len; k++) {\n      // Sum all words with the same `i + j = k` and accumulate `ncarry`,\n      // note that ncarry could be >= 0x3ffffff\n      var ncarry = carry >>> 26;\n      var rword = carry & 0x3ffffff;\n      var maxJ = Math.min(k, num.length - 1);\n      for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) {\n        var i = (k - j) | 0;\n        a = self.words[i] | 0;\n        b = num.words[j] | 0;\n        r = a * b + rword;\n        ncarry += (r / 0x4000000) | 0;\n        rword = r & 0x3ffffff;\n      }\n      out.words[k] = rword | 0;\n      carry = ncarry | 0;\n    }\n    if (carry !== 0) {\n      out.words[k] = carry | 0;\n    } else {\n      out.length--;\n    }\n\n    return out._strip();\n  }\n\n  // TODO(indutny): it may be reasonable to omit it for users who don't need\n  // to work with 256-bit numbers, otherwise it gives 20% improvement for 256-bit\n  // multiplication (like elliptic secp256k1).\n  var comb10MulTo = function comb10MulTo (self, num, out) {\n    var a = self.words;\n    var b = num.words;\n    var o = out.words;\n    var c = 0;\n    var lo;\n    var mid;\n    var hi;\n    var a0 = a[0] | 0;\n    var al0 = a0 & 0x1fff;\n    var ah0 = a0 >>> 13;\n    var a1 = a[1] | 0;\n    var al1 = a1 & 0x1fff;\n    var ah1 = a1 >>> 13;\n    var a2 = a[2] | 0;\n    var al2 = a2 & 0x1fff;\n    var ah2 = a2 >>> 13;\n    var a3 = a[3] | 0;\n    var al3 = a3 & 0x1fff;\n    var ah3 = a3 >>> 13;\n    var a4 = a[4] | 0;\n    var al4 = a4 & 0x1fff;\n    var ah4 = a4 >>> 13;\n    var a5 = a[5] | 0;\n    var al5 = a5 & 0x1fff;\n    var ah5 = a5 >>> 13;\n    var a6 = a[6] | 0;\n    var al6 = a6 & 0x1fff;\n    var ah6 = a6 >>> 13;\n    var a7 = a[7] | 0;\n    var al7 = a7 & 0x1fff;\n    var ah7 = a7 >>> 13;\n    var a8 = a[8] | 0;\n    var al8 = a8 & 0x1fff;\n    var ah8 = a8 >>> 13;\n    var a9 = a[9] | 0;\n    var al9 = a9 & 0x1fff;\n    var ah9 = a9 >>> 13;\n    var b0 = b[0] | 0;\n    var bl0 = b0 & 0x1fff;\n    var bh0 = b0 >>> 13;\n    var b1 = b[1] | 0;\n    var bl1 = b1 & 0x1fff;\n    var bh1 = b1 >>> 13;\n    var b2 = b[2] | 0;\n    var bl2 = b2 & 0x1fff;\n    var bh2 = b2 >>> 13;\n    var b3 = b[3] | 0;\n    var bl3 = b3 & 0x1fff;\n    var bh3 = b3 >>> 13;\n    var b4 = b[4] | 0;\n    var bl4 = b4 & 0x1fff;\n    var bh4 = b4 >>> 13;\n    var b5 = b[5] | 0;\n    var bl5 = b5 & 0x1fff;\n    var bh5 = b5 >>> 13;\n    var b6 = b[6] | 0;\n    var bl6 = b6 & 0x1fff;\n    var bh6 = b6 >>> 13;\n    var b7 = b[7] | 0;\n    var bl7 = b7 & 0x1fff;\n    var bh7 = b7 >>> 13;\n    var b8 = b[8] | 0;\n    var bl8 = b8 & 0x1fff;\n    var bh8 = b8 >>> 13;\n    var b9 = b[9] | 0;\n    var bl9 = b9 & 0x1fff;\n    var bh9 = b9 >>> 13;\n\n    out.negative = self.negative ^ num.negative;\n    out.length = 19;\n    /* k = 0 */\n    lo = Math.imul(al0, bl0);\n    mid = Math.imul(al0, bh0);\n    mid = (mid + Math.imul(ah0, bl0)) | 0;\n    hi = Math.imul(ah0, bh0);\n    var w0 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0;\n    w0 &= 0x3ffffff;\n    /* k = 1 */\n    lo = Math.imul(al1, bl0);\n    mid = Math.imul(al1, bh0);\n    mid = (mid + Math.imul(ah1, bl0)) | 0;\n    hi = Math.imul(ah1, bh0);\n    lo = (lo + Math.imul(al0, bl1)) | 0;\n    mid = (mid + Math.imul(al0, bh1)) | 0;\n    mid = (mid + Math.imul(ah0, bl1)) | 0;\n    hi = (hi + Math.imul(ah0, bh1)) | 0;\n    var w1 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0;\n    w1 &= 0x3ffffff;\n    /* k = 2 */\n    lo = Math.imul(al2, bl0);\n    mid = Math.imul(al2, bh0);\n    mid = (mid + Math.imul(ah2, bl0)) | 0;\n    hi = Math.imul(ah2, bh0);\n    lo = (lo + Math.imul(al1, bl1)) | 0;\n    mid = (mid + Math.imul(al1, bh1)) | 0;\n    mid = (mid + Math.imul(ah1, bl1)) | 0;\n    hi = (hi + Math.imul(ah1, bh1)) | 0;\n    lo = (lo + Math.imul(al0, bl2)) | 0;\n    mid = (mid + Math.imul(al0, bh2)) | 0;\n    mid = (mid + Math.imul(ah0, bl2)) | 0;\n    hi = (hi + Math.imul(ah0, bh2)) | 0;\n    var w2 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0;\n    w2 &= 0x3ffffff;\n    /* k = 3 */\n    lo = Math.imul(al3, bl0);\n    mid = Math.imul(al3, bh0);\n    mid = (mid + Math.imul(ah3, bl0)) | 0;\n    hi = Math.imul(ah3, bh0);\n    lo = (lo + Math.imul(al2, bl1)) | 0;\n    mid = (mid + Math.imul(al2, bh1)) | 0;\n    mid = (mid + Math.imul(ah2, bl1)) | 0;\n    hi = (hi + Math.imul(ah2, bh1)) | 0;\n    lo = (lo + Math.imul(al1, bl2)) | 0;\n    mid = (mid + Math.imul(al1, bh2)) | 0;\n    mid = (mid + Math.imul(ah1, bl2)) | 0;\n    hi = (hi + Math.imul(ah1, bh2)) | 0;\n    lo = (lo + Math.imul(al0, bl3)) | 0;\n    mid = (mid + Math.imul(al0, bh3)) | 0;\n    mid = (mid + Math.imul(ah0, bl3)) | 0;\n    hi = (hi + Math.imul(ah0, bh3)) | 0;\n    var w3 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0;\n    w3 &= 0x3ffffff;\n    /* k = 4 */\n    lo = Math.imul(al4, bl0);\n    mid = Math.imul(al4, bh0);\n    mid = (mid + Math.imul(ah4, bl0)) | 0;\n    hi = Math.imul(ah4, bh0);\n    lo = (lo + Math.imul(al3, bl1)) | 0;\n    mid = (mid + Math.imul(al3, bh1)) | 0;\n    mid = (mid + Math.imul(ah3, bl1)) | 0;\n    hi = (hi + Math.imul(ah3, bh1)) | 0;\n    lo = (lo + Math.imul(al2, bl2)) | 0;\n    mid = (mid + Math.imul(al2, bh2)) | 0;\n    mid = (mid + Math.imul(ah2, bl2)) | 0;\n    hi = (hi + Math.imul(ah2, bh2)) | 0;\n    lo = (lo + Math.imul(al1, bl3)) | 0;\n    mid = (mid + Math.imul(al1, bh3)) | 0;\n    mid = (mid + Math.imul(ah1, bl3)) | 0;\n    hi = (hi + Math.imul(ah1, bh3)) | 0;\n    lo = (lo + Math.imul(al0, bl4)) | 0;\n    mid = (mid + Math.imul(al0, bh4)) | 0;\n    mid = (mid + Math.imul(ah0, bl4)) | 0;\n    hi = (hi + Math.imul(ah0, bh4)) | 0;\n    var w4 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0;\n    w4 &= 0x3ffffff;\n    /* k = 5 */\n    lo = Math.imul(al5, bl0);\n    mid = Math.imul(al5, bh0);\n    mid = (mid + Math.imul(ah5, bl0)) | 0;\n    hi = Math.imul(ah5, bh0);\n    lo = (lo + Math.imul(al4, bl1)) | 0;\n    mid = (mid + Math.imul(al4, bh1)) | 0;\n    mid = (mid + Math.imul(ah4, bl1)) | 0;\n    hi = (hi + Math.imul(ah4, bh1)) | 0;\n    lo = (lo + Math.imul(al3, bl2)) | 0;\n    mid = (mid + Math.imul(al3, bh2)) | 0;\n    mid = (mid + Math.imul(ah3, bl2)) | 0;\n    hi = (hi + Math.imul(ah3, bh2)) | 0;\n    lo = (lo + Math.imul(al2, bl3)) | 0;\n    mid = (mid + Math.imul(al2, bh3)) | 0;\n    mid = (mid + Math.imul(ah2, bl3)) | 0;\n    hi = (hi + Math.imul(ah2, bh3)) | 0;\n    lo = (lo + Math.imul(al1, bl4)) | 0;\n    mid = (mid + Math.imul(al1, bh4)) | 0;\n    mid = (mid + Math.imul(ah1, bl4)) | 0;\n    hi = (hi + Math.imul(ah1, bh4)) | 0;\n    lo = (lo + Math.imul(al0, bl5)) | 0;\n    mid = (mid + Math.imul(al0, bh5)) | 0;\n    mid = (mid + Math.imul(ah0, bl5)) | 0;\n    hi = (hi + Math.imul(ah0, bh5)) | 0;\n    var w5 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0;\n    w5 &= 0x3ffffff;\n    /* k = 6 */\n    lo = Math.imul(al6, bl0);\n    mid = Math.imul(al6, bh0);\n    mid = (mid + Math.imul(ah6, bl0)) | 0;\n    hi = Math.imul(ah6, bh0);\n    lo = (lo + Math.imul(al5, bl1)) | 0;\n    mid = (mid + Math.imul(al5, bh1)) | 0;\n    mid = (mid + Math.imul(ah5, bl1)) | 0;\n    hi = (hi + Math.imul(ah5, bh1)) | 0;\n    lo = (lo + Math.imul(al4, bl2)) | 0;\n    mid = (mid + Math.imul(al4, bh2)) | 0;\n    mid = (mid + Math.imul(ah4, bl2)) | 0;\n    hi = (hi + Math.imul(ah4, bh2)) | 0;\n    lo = (lo + Math.imul(al3, bl3)) | 0;\n    mid = (mid + Math.imul(al3, bh3)) | 0;\n    mid = (mid + Math.imul(ah3, bl3)) | 0;\n    hi = (hi + Math.imul(ah3, bh3)) | 0;\n    lo = (lo + Math.imul(al2, bl4)) | 0;\n    mid = (mid + Math.imul(al2, bh4)) | 0;\n    mid = (mid + Math.imul(ah2, bl4)) | 0;\n    hi = (hi + Math.imul(ah2, bh4)) | 0;\n    lo = (lo + Math.imul(al1, bl5)) | 0;\n    mid = (mid + Math.imul(al1, bh5)) | 0;\n    mid = (mid + Math.imul(ah1, bl5)) | 0;\n    hi = (hi + Math.imul(ah1, bh5)) | 0;\n    lo = (lo + Math.imul(al0, bl6)) | 0;\n    mid = (mid + Math.imul(al0, bh6)) | 0;\n    mid = (mid + Math.imul(ah0, bl6)) | 0;\n    hi = (hi + Math.imul(ah0, bh6)) | 0;\n    var w6 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0;\n    w6 &= 0x3ffffff;\n    /* k = 7 */\n    lo = Math.imul(al7, bl0);\n    mid = Math.imul(al7, bh0);\n    mid = (mid + Math.imul(ah7, bl0)) | 0;\n    hi = Math.imul(ah7, bh0);\n    lo = (lo + Math.imul(al6, bl1)) | 0;\n    mid = (mid + Math.imul(al6, bh1)) | 0;\n    mid = (mid + Math.imul(ah6, bl1)) | 0;\n    hi = (hi + Math.imul(ah6, bh1)) | 0;\n    lo = (lo + Math.imul(al5, bl2)) | 0;\n    mid = (mid + Math.imul(al5, bh2)) | 0;\n    mid = (mid + Math.imul(ah5, bl2)) | 0;\n    hi = (hi + Math.imul(ah5, bh2)) | 0;\n    lo = (lo + Math.imul(al4, bl3)) | 0;\n    mid = (mid + Math.imul(al4, bh3)) | 0;\n    mid = (mid + Math.imul(ah4, bl3)) | 0;\n    hi = (hi + Math.imul(ah4, bh3)) | 0;\n    lo = (lo + Math.imul(al3, bl4)) | 0;\n    mid = (mid + Math.imul(al3, bh4)) | 0;\n    mid = (mid + Math.imul(ah3, bl4)) | 0;\n    hi = (hi + Math.imul(ah3, bh4)) | 0;\n    lo = (lo + Math.imul(al2, bl5)) | 0;\n    mid = (mid + Math.imul(al2, bh5)) | 0;\n    mid = (mid + Math.imul(ah2, bl5)) | 0;\n    hi = (hi + Math.imul(ah2, bh5)) | 0;\n    lo = (lo + Math.imul(al1, bl6)) | 0;\n    mid = (mid + Math.imul(al1, bh6)) | 0;\n    mid = (mid + Math.imul(ah1, bl6)) | 0;\n    hi = (hi + Math.imul(ah1, bh6)) | 0;\n    lo = (lo + Math.imul(al0, bl7)) | 0;\n    mid = (mid + Math.imul(al0, bh7)) | 0;\n    mid = (mid + Math.imul(ah0, bl7)) | 0;\n    hi = (hi + Math.imul(ah0, bh7)) | 0;\n    var w7 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0;\n    w7 &= 0x3ffffff;\n    /* k = 8 */\n    lo = Math.imul(al8, bl0);\n    mid = Math.imul(al8, bh0);\n    mid = (mid + Math.imul(ah8, bl0)) | 0;\n    hi = Math.imul(ah8, bh0);\n    lo = (lo + Math.imul(al7, bl1)) | 0;\n    mid = (mid + Math.imul(al7, bh1)) | 0;\n    mid = (mid + Math.imul(ah7, bl1)) | 0;\n    hi = (hi + Math.imul(ah7, bh1)) | 0;\n    lo = (lo + Math.imul(al6, bl2)) | 0;\n    mid = (mid + Math.imul(al6, bh2)) | 0;\n    mid = (mid + Math.imul(ah6, bl2)) | 0;\n    hi = (hi + Math.imul(ah6, bh2)) | 0;\n    lo = (lo + Math.imul(al5, bl3)) | 0;\n    mid = (mid + Math.imul(al5, bh3)) | 0;\n    mid = (mid + Math.imul(ah5, bl3)) | 0;\n    hi = (hi + Math.imul(ah5, bh3)) | 0;\n    lo = (lo + Math.imul(al4, bl4)) | 0;\n    mid = (mid + Math.imul(al4, bh4)) | 0;\n    mid = (mid + Math.imul(ah4, bl4)) | 0;\n    hi = (hi + Math.imul(ah4, bh4)) | 0;\n    lo = (lo + Math.imul(al3, bl5)) | 0;\n    mid = (mid + Math.imul(al3, bh5)) | 0;\n    mid = (mid + Math.imul(ah3, bl5)) | 0;\n    hi = (hi + Math.imul(ah3, bh5)) | 0;\n    lo = (lo + Math.imul(al2, bl6)) | 0;\n    mid = (mid + Math.imul(al2, bh6)) | 0;\n    mid = (mid + Math.imul(ah2, bl6)) | 0;\n    hi = (hi + Math.imul(ah2, bh6)) | 0;\n    lo = (lo + Math.imul(al1, bl7)) | 0;\n    mid = (mid + Math.imul(al1, bh7)) | 0;\n    mid = (mid + Math.imul(ah1, bl7)) | 0;\n    hi = (hi + Math.imul(ah1, bh7)) | 0;\n    lo = (lo + Math.imul(al0, bl8)) | 0;\n    mid = (mid + Math.imul(al0, bh8)) | 0;\n    mid = (mid + Math.imul(ah0, bl8)) | 0;\n    hi = (hi + Math.imul(ah0, bh8)) | 0;\n    var w8 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0;\n    w8 &= 0x3ffffff;\n    /* k = 9 */\n    lo = Math.imul(al9, bl0);\n    mid = Math.imul(al9, bh0);\n    mid = (mid + Math.imul(ah9, bl0)) | 0;\n    hi = Math.imul(ah9, bh0);\n    lo = (lo + Math.imul(al8, bl1)) | 0;\n    mid = (mid + Math.imul(al8, bh1)) | 0;\n    mid = (mid + Math.imul(ah8, bl1)) | 0;\n    hi = (hi + Math.imul(ah8, bh1)) | 0;\n    lo = (lo + Math.imul(al7, bl2)) | 0;\n    mid = (mid + Math.imul(al7, bh2)) | 0;\n    mid = (mid + Math.imul(ah7, bl2)) | 0;\n    hi = (hi + Math.imul(ah7, bh2)) | 0;\n    lo = (lo + Math.imul(al6, bl3)) | 0;\n    mid = (mid + Math.imul(al6, bh3)) | 0;\n    mid = (mid + Math.imul(ah6, bl3)) | 0;\n    hi = (hi + Math.imul(ah6, bh3)) | 0;\n    lo = (lo + Math.imul(al5, bl4)) | 0;\n    mid = (mid + Math.imul(al5, bh4)) | 0;\n    mid = (mid + Math.imul(ah5, bl4)) | 0;\n    hi = (hi + Math.imul(ah5, bh4)) | 0;\n    lo = (lo + Math.imul(al4, bl5)) | 0;\n    mid = (mid + Math.imul(al4, bh5)) | 0;\n    mid = (mid + Math.imul(ah4, bl5)) | 0;\n    hi = (hi + Math.imul(ah4, bh5)) | 0;\n    lo = (lo + Math.imul(al3, bl6)) | 0;\n    mid = (mid + Math.imul(al3, bh6)) | 0;\n    mid = (mid + Math.imul(ah3, bl6)) | 0;\n    hi = (hi + Math.imul(ah3, bh6)) | 0;\n    lo = (lo + Math.imul(al2, bl7)) | 0;\n    mid = (mid + Math.imul(al2, bh7)) | 0;\n    mid = (mid + Math.imul(ah2, bl7)) | 0;\n    hi = (hi + Math.imul(ah2, bh7)) | 0;\n    lo = (lo + Math.imul(al1, bl8)) | 0;\n    mid = (mid + Math.imul(al1, bh8)) | 0;\n    mid = (mid + Math.imul(ah1, bl8)) | 0;\n    hi = (hi + Math.imul(ah1, bh8)) | 0;\n    lo = (lo + Math.imul(al0, bl9)) | 0;\n    mid = (mid + Math.imul(al0, bh9)) | 0;\n    mid = (mid + Math.imul(ah0, bl9)) | 0;\n    hi = (hi + Math.imul(ah0, bh9)) | 0;\n    var w9 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0;\n    w9 &= 0x3ffffff;\n    /* k = 10 */\n    lo = Math.imul(al9, bl1);\n    mid = Math.imul(al9, bh1);\n    mid = (mid + Math.imul(ah9, bl1)) | 0;\n    hi = Math.imul(ah9, bh1);\n    lo = (lo + Math.imul(al8, bl2)) | 0;\n    mid = (mid + Math.imul(al8, bh2)) | 0;\n    mid = (mid + Math.imul(ah8, bl2)) | 0;\n    hi = (hi + Math.imul(ah8, bh2)) | 0;\n    lo = (lo + Math.imul(al7, bl3)) | 0;\n    mid = (mid + Math.imul(al7, bh3)) | 0;\n    mid = (mid + Math.imul(ah7, bl3)) | 0;\n    hi = (hi + Math.imul(ah7, bh3)) | 0;\n    lo = (lo + Math.imul(al6, bl4)) | 0;\n    mid = (mid + Math.imul(al6, bh4)) | 0;\n    mid = (mid + Math.imul(ah6, bl4)) | 0;\n    hi = (hi + Math.imul(ah6, bh4)) | 0;\n    lo = (lo + Math.imul(al5, bl5)) | 0;\n    mid = (mid + Math.imul(al5, bh5)) | 0;\n    mid = (mid + Math.imul(ah5, bl5)) | 0;\n    hi = (hi + Math.imul(ah5, bh5)) | 0;\n    lo = (lo + Math.imul(al4, bl6)) | 0;\n    mid = (mid + Math.imul(al4, bh6)) | 0;\n    mid = (mid + Math.imul(ah4, bl6)) | 0;\n    hi = (hi + Math.imul(ah4, bh6)) | 0;\n    lo = (lo + Math.imul(al3, bl7)) | 0;\n    mid = (mid + Math.imul(al3, bh7)) | 0;\n    mid = (mid + Math.imul(ah3, bl7)) | 0;\n    hi = (hi + Math.imul(ah3, bh7)) | 0;\n    lo = (lo + Math.imul(al2, bl8)) | 0;\n    mid = (mid + Math.imul(al2, bh8)) | 0;\n    mid = (mid + Math.imul(ah2, bl8)) | 0;\n    hi = (hi + Math.imul(ah2, bh8)) | 0;\n    lo = (lo + Math.imul(al1, bl9)) | 0;\n    mid = (mid + Math.imul(al1, bh9)) | 0;\n    mid = (mid + Math.imul(ah1, bl9)) | 0;\n    hi = (hi + Math.imul(ah1, bh9)) | 0;\n    var w10 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0;\n    w10 &= 0x3ffffff;\n    /* k = 11 */\n    lo = Math.imul(al9, bl2);\n    mid = Math.imul(al9, bh2);\n    mid = (mid + Math.imul(ah9, bl2)) | 0;\n    hi = Math.imul(ah9, bh2);\n    lo = (lo + Math.imul(al8, bl3)) | 0;\n    mid = (mid + Math.imul(al8, bh3)) | 0;\n    mid = (mid + Math.imul(ah8, bl3)) | 0;\n    hi = (hi + Math.imul(ah8, bh3)) | 0;\n    lo = (lo + Math.imul(al7, bl4)) | 0;\n    mid = (mid + Math.imul(al7, bh4)) | 0;\n    mid = (mid + Math.imul(ah7, bl4)) | 0;\n    hi = (hi + Math.imul(ah7, bh4)) | 0;\n    lo = (lo + Math.imul(al6, bl5)) | 0;\n    mid = (mid + Math.imul(al6, bh5)) | 0;\n    mid = (mid + Math.imul(ah6, bl5)) | 0;\n    hi = (hi + Math.imul(ah6, bh5)) | 0;\n    lo = (lo + Math.imul(al5, bl6)) | 0;\n    mid = (mid + Math.imul(al5, bh6)) | 0;\n    mid = (mid + Math.imul(ah5, bl6)) | 0;\n    hi = (hi + Math.imul(ah5, bh6)) | 0;\n    lo = (lo + Math.imul(al4, bl7)) | 0;\n    mid = (mid + Math.imul(al4, bh7)) | 0;\n    mid = (mid + Math.imul(ah4, bl7)) | 0;\n    hi = (hi + Math.imul(ah4, bh7)) | 0;\n    lo = (lo + Math.imul(al3, bl8)) | 0;\n    mid = (mid + Math.imul(al3, bh8)) | 0;\n    mid = (mid + Math.imul(ah3, bl8)) | 0;\n    hi = (hi + Math.imul(ah3, bh8)) | 0;\n    lo = (lo + Math.imul(al2, bl9)) | 0;\n    mid = (mid + Math.imul(al2, bh9)) | 0;\n    mid = (mid + Math.imul(ah2, bl9)) | 0;\n    hi = (hi + Math.imul(ah2, bh9)) | 0;\n    var w11 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0;\n    w11 &= 0x3ffffff;\n    /* k = 12 */\n    lo = Math.imul(al9, bl3);\n    mid = Math.imul(al9, bh3);\n    mid = (mid + Math.imul(ah9, bl3)) | 0;\n    hi = Math.imul(ah9, bh3);\n    lo = (lo + Math.imul(al8, bl4)) | 0;\n    mid = (mid + Math.imul(al8, bh4)) | 0;\n    mid = (mid + Math.imul(ah8, bl4)) | 0;\n    hi = (hi + Math.imul(ah8, bh4)) | 0;\n    lo = (lo + Math.imul(al7, bl5)) | 0;\n    mid = (mid + Math.imul(al7, bh5)) | 0;\n    mid = (mid + Math.imul(ah7, bl5)) | 0;\n    hi = (hi + Math.imul(ah7, bh5)) | 0;\n    lo = (lo + Math.imul(al6, bl6)) | 0;\n    mid = (mid + Math.imul(al6, bh6)) | 0;\n    mid = (mid + Math.imul(ah6, bl6)) | 0;\n    hi = (hi + Math.imul(ah6, bh6)) | 0;\n    lo = (lo + Math.imul(al5, bl7)) | 0;\n    mid = (mid + Math.imul(al5, bh7)) | 0;\n    mid = (mid + Math.imul(ah5, bl7)) | 0;\n    hi = (hi + Math.imul(ah5, bh7)) | 0;\n    lo = (lo + Math.imul(al4, bl8)) | 0;\n    mid = (mid + Math.imul(al4, bh8)) | 0;\n    mid = (mid + Math.imul(ah4, bl8)) | 0;\n    hi = (hi + Math.imul(ah4, bh8)) | 0;\n    lo = (lo + Math.imul(al3, bl9)) | 0;\n    mid = (mid + Math.imul(al3, bh9)) | 0;\n    mid = (mid + Math.imul(ah3, bl9)) | 0;\n    hi = (hi + Math.imul(ah3, bh9)) | 0;\n    var w12 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0;\n    w12 &= 0x3ffffff;\n    /* k = 13 */\n    lo = Math.imul(al9, bl4);\n    mid = Math.imul(al9, bh4);\n    mid = (mid + Math.imul(ah9, bl4)) | 0;\n    hi = Math.imul(ah9, bh4);\n    lo = (lo + Math.imul(al8, bl5)) | 0;\n    mid = (mid + Math.imul(al8, bh5)) | 0;\n    mid = (mid + Math.imul(ah8, bl5)) | 0;\n    hi = (hi + Math.imul(ah8, bh5)) | 0;\n    lo = (lo + Math.imul(al7, bl6)) | 0;\n    mid = (mid + Math.imul(al7, bh6)) | 0;\n    mid = (mid + Math.imul(ah7, bl6)) | 0;\n    hi = (hi + Math.imul(ah7, bh6)) | 0;\n    lo = (lo + Math.imul(al6, bl7)) | 0;\n    mid = (mid + Math.imul(al6, bh7)) | 0;\n    mid = (mid + Math.imul(ah6, bl7)) | 0;\n    hi = (hi + Math.imul(ah6, bh7)) | 0;\n    lo = (lo + Math.imul(al5, bl8)) | 0;\n    mid = (mid + Math.imul(al5, bh8)) | 0;\n    mid = (mid + Math.imul(ah5, bl8)) | 0;\n    hi = (hi + Math.imul(ah5, bh8)) | 0;\n    lo = (lo + Math.imul(al4, bl9)) | 0;\n    mid = (mid + Math.imul(al4, bh9)) | 0;\n    mid = (mid + Math.imul(ah4, bl9)) | 0;\n    hi = (hi + Math.imul(ah4, bh9)) | 0;\n    var w13 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0;\n    w13 &= 0x3ffffff;\n    /* k = 14 */\n    lo = Math.imul(al9, bl5);\n    mid = Math.imul(al9, bh5);\n    mid = (mid + Math.imul(ah9, bl5)) | 0;\n    hi = Math.imul(ah9, bh5);\n    lo = (lo + Math.imul(al8, bl6)) | 0;\n    mid = (mid + Math.imul(al8, bh6)) | 0;\n    mid = (mid + Math.imul(ah8, bl6)) | 0;\n    hi = (hi + Math.imul(ah8, bh6)) | 0;\n    lo = (lo + Math.imul(al7, bl7)) | 0;\n    mid = (mid + Math.imul(al7, bh7)) | 0;\n    mid = (mid + Math.imul(ah7, bl7)) | 0;\n    hi = (hi + Math.imul(ah7, bh7)) | 0;\n    lo = (lo + Math.imul(al6, bl8)) | 0;\n    mid = (mid + Math.imul(al6, bh8)) | 0;\n    mid = (mid + Math.imul(ah6, bl8)) | 0;\n    hi = (hi + Math.imul(ah6, bh8)) | 0;\n    lo = (lo + Math.imul(al5, bl9)) | 0;\n    mid = (mid + Math.imul(al5, bh9)) | 0;\n    mid = (mid + Math.imul(ah5, bl9)) | 0;\n    hi = (hi + Math.imul(ah5, bh9)) | 0;\n    var w14 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0;\n    w14 &= 0x3ffffff;\n    /* k = 15 */\n    lo = Math.imul(al9, bl6);\n    mid = Math.imul(al9, bh6);\n    mid = (mid + Math.imul(ah9, bl6)) | 0;\n    hi = Math.imul(ah9, bh6);\n    lo = (lo + Math.imul(al8, bl7)) | 0;\n    mid = (mid + Math.imul(al8, bh7)) | 0;\n    mid = (mid + Math.imul(ah8, bl7)) | 0;\n    hi = (hi + Math.imul(ah8, bh7)) | 0;\n    lo = (lo + Math.imul(al7, bl8)) | 0;\n    mid = (mid + Math.imul(al7, bh8)) | 0;\n    mid = (mid + Math.imul(ah7, bl8)) | 0;\n    hi = (hi + Math.imul(ah7, bh8)) | 0;\n    lo = (lo + Math.imul(al6, bl9)) | 0;\n    mid = (mid + Math.imul(al6, bh9)) | 0;\n    mid = (mid + Math.imul(ah6, bl9)) | 0;\n    hi = (hi + Math.imul(ah6, bh9)) | 0;\n    var w15 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0;\n    w15 &= 0x3ffffff;\n    /* k = 16 */\n    lo = Math.imul(al9, bl7);\n    mid = Math.imul(al9, bh7);\n    mid = (mid + Math.imul(ah9, bl7)) | 0;\n    hi = Math.imul(ah9, bh7);\n    lo = (lo + Math.imul(al8, bl8)) | 0;\n    mid = (mid + Math.imul(al8, bh8)) | 0;\n    mid = (mid + Math.imul(ah8, bl8)) | 0;\n    hi = (hi + Math.imul(ah8, bh8)) | 0;\n    lo = (lo + Math.imul(al7, bl9)) | 0;\n    mid = (mid + Math.imul(al7, bh9)) | 0;\n    mid = (mid + Math.imul(ah7, bl9)) | 0;\n    hi = (hi + Math.imul(ah7, bh9)) | 0;\n    var w16 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0;\n    w16 &= 0x3ffffff;\n    /* k = 17 */\n    lo = Math.imul(al9, bl8);\n    mid = Math.imul(al9, bh8);\n    mid = (mid + Math.imul(ah9, bl8)) | 0;\n    hi = Math.imul(ah9, bh8);\n    lo = (lo + Math.imul(al8, bl9)) | 0;\n    mid = (mid + Math.imul(al8, bh9)) | 0;\n    mid = (mid + Math.imul(ah8, bl9)) | 0;\n    hi = (hi + Math.imul(ah8, bh9)) | 0;\n    var w17 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0;\n    w17 &= 0x3ffffff;\n    /* k = 18 */\n    lo = Math.imul(al9, bl9);\n    mid = Math.imul(al9, bh9);\n    mid = (mid + Math.imul(ah9, bl9)) | 0;\n    hi = Math.imul(ah9, bh9);\n    var w18 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0;\n    w18 &= 0x3ffffff;\n    o[0] = w0;\n    o[1] = w1;\n    o[2] = w2;\n    o[3] = w3;\n    o[4] = w4;\n    o[5] = w5;\n    o[6] = w6;\n    o[7] = w7;\n    o[8] = w8;\n    o[9] = w9;\n    o[10] = w10;\n    o[11] = w11;\n    o[12] = w12;\n    o[13] = w13;\n    o[14] = w14;\n    o[15] = w15;\n    o[16] = w16;\n    o[17] = w17;\n    o[18] = w18;\n    if (c !== 0) {\n      o[19] = c;\n      out.length++;\n    }\n    return out;\n  };\n\n  // Polyfill comb\n  if (!Math.imul) {\n    comb10MulTo = smallMulTo;\n  }\n\n  function bigMulTo (self, num, out) {\n    out.negative = num.negative ^ self.negative;\n    out.length = self.length + num.length;\n\n    var carry = 0;\n    var hncarry = 0;\n    for (var k = 0; k < out.length - 1; k++) {\n      // Sum all words with the same `i + j = k` and accumulate `ncarry`,\n      // note that ncarry could be >= 0x3ffffff\n      var ncarry = hncarry;\n      hncarry = 0;\n      var rword = carry & 0x3ffffff;\n      var maxJ = Math.min(k, num.length - 1);\n      for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) {\n        var i = k - j;\n        var a = self.words[i] | 0;\n        var b = num.words[j] | 0;\n        var r = a * b;\n\n        var lo = r & 0x3ffffff;\n        ncarry = (ncarry + ((r / 0x4000000) | 0)) | 0;\n        lo = (lo + rword) | 0;\n        rword = lo & 0x3ffffff;\n        ncarry = (ncarry + (lo >>> 26)) | 0;\n\n        hncarry += ncarry >>> 26;\n        ncarry &= 0x3ffffff;\n      }\n      out.words[k] = rword;\n      carry = ncarry;\n      ncarry = hncarry;\n    }\n    if (carry !== 0) {\n      out.words[k] = carry;\n    } else {\n      out.length--;\n    }\n\n    return out._strip();\n  }\n\n  function jumboMulTo (self, num, out) {\n    // Temporary disable, see https://github.com/indutny/bn.js/issues/211\n    // var fftm = new FFTM();\n    // return fftm.mulp(self, num, out);\n    return bigMulTo(self, num, out);\n  }\n\n  BN.prototype.mulTo = function mulTo (num, out) {\n    var res;\n    var len = this.length + num.length;\n    if (this.length === 10 && num.length === 10) {\n      res = comb10MulTo(this, num, out);\n    } else if (len < 63) {\n      res = smallMulTo(this, num, out);\n    } else if (len < 1024) {\n      res = bigMulTo(this, num, out);\n    } else {\n      res = jumboMulTo(this, num, out);\n    }\n\n    return res;\n  };\n\n  // Cooley-Tukey algorithm for FFT\n  // slightly revisited to rely on looping instead of recursion\n\n  function FFTM (x, y) {\n    this.x = x;\n    this.y = y;\n  }\n\n  FFTM.prototype.makeRBT = function makeRBT (N) {\n    var t = new Array(N);\n    var l = BN.prototype._countBits(N) - 1;\n    for (var i = 0; i < N; i++) {\n      t[i] = this.revBin(i, l, N);\n    }\n\n    return t;\n  };\n\n  // Returns binary-reversed representation of `x`\n  FFTM.prototype.revBin = function revBin (x, l, N) {\n    if (x === 0 || x === N - 1) return x;\n\n    var rb = 0;\n    for (var i = 0; i < l; i++) {\n      rb |= (x & 1) << (l - i - 1);\n      x >>= 1;\n    }\n\n    return rb;\n  };\n\n  // Performs \"tweedling\" phase, therefore 'emulating'\n  // behaviour of the recursive algorithm\n  FFTM.prototype.permute = function permute (rbt, rws, iws, rtws, itws, N) {\n    for (var i = 0; i < N; i++) {\n      rtws[i] = rws[rbt[i]];\n      itws[i] = iws[rbt[i]];\n    }\n  };\n\n  FFTM.prototype.transform = function transform (rws, iws, rtws, itws, N, rbt) {\n    this.permute(rbt, rws, iws, rtws, itws, N);\n\n    for (var s = 1; s < N; s <<= 1) {\n      var l = s << 1;\n\n      var rtwdf = Math.cos(2 * Math.PI / l);\n      var itwdf = Math.sin(2 * Math.PI / l);\n\n      for (var p = 0; p < N; p += l) {\n        var rtwdf_ = rtwdf;\n        var itwdf_ = itwdf;\n\n        for (var j = 0; j < s; j++) {\n          var re = rtws[p + j];\n          var ie = itws[p + j];\n\n          var ro = rtws[p + j + s];\n          var io = itws[p + j + s];\n\n          var rx = rtwdf_ * ro - itwdf_ * io;\n\n          io = rtwdf_ * io + itwdf_ * ro;\n          ro = rx;\n\n          rtws[p + j] = re + ro;\n          itws[p + j] = ie + io;\n\n          rtws[p + j + s] = re - ro;\n          itws[p + j + s] = ie - io;\n\n          /* jshint maxdepth : false */\n          if (j !== l) {\n            rx = rtwdf * rtwdf_ - itwdf * itwdf_;\n\n            itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_;\n            rtwdf_ = rx;\n          }\n        }\n      }\n    }\n  };\n\n  FFTM.prototype.guessLen13b = function guessLen13b (n, m) {\n    var N = Math.max(m, n) | 1;\n    var odd = N & 1;\n    var i = 0;\n    for (N = N / 2 | 0; N; N = N >>> 1) {\n      i++;\n    }\n\n    return 1 << i + 1 + odd;\n  };\n\n  FFTM.prototype.conjugate = function conjugate (rws, iws, N) {\n    if (N <= 1) return;\n\n    for (var i = 0; i < N / 2; i++) {\n      var t = rws[i];\n\n      rws[i] = rws[N - i - 1];\n      rws[N - i - 1] = t;\n\n      t = iws[i];\n\n      iws[i] = -iws[N - i - 1];\n      iws[N - i - 1] = -t;\n    }\n  };\n\n  FFTM.prototype.normalize13b = function normalize13b (ws, N) {\n    var carry = 0;\n    for (var i = 0; i < N / 2; i++) {\n      var w = Math.round(ws[2 * i + 1] / N) * 0x2000 +\n        Math.round(ws[2 * i] / N) +\n        carry;\n\n      ws[i] = w & 0x3ffffff;\n\n      if (w < 0x4000000) {\n        carry = 0;\n      } else {\n        carry = w / 0x4000000 | 0;\n      }\n    }\n\n    return ws;\n  };\n\n  FFTM.prototype.convert13b = function convert13b (ws, len, rws, N) {\n    var carry = 0;\n    for (var i = 0; i < len; i++) {\n      carry = carry + (ws[i] | 0);\n\n      rws[2 * i] = carry & 0x1fff; carry = carry >>> 13;\n      rws[2 * i + 1] = carry & 0x1fff; carry = carry >>> 13;\n    }\n\n    // Pad with zeroes\n    for (i = 2 * len; i < N; ++i) {\n      rws[i] = 0;\n    }\n\n    assert(carry === 0);\n    assert((carry & ~0x1fff) === 0);\n  };\n\n  FFTM.prototype.stub = function stub (N) {\n    var ph = new Array(N);\n    for (var i = 0; i < N; i++) {\n      ph[i] = 0;\n    }\n\n    return ph;\n  };\n\n  FFTM.prototype.mulp = function mulp (x, y, out) {\n    var N = 2 * this.guessLen13b(x.length, y.length);\n\n    var rbt = this.makeRBT(N);\n\n    var _ = this.stub(N);\n\n    var rws = new Array(N);\n    var rwst = new Array(N);\n    var iwst = new Array(N);\n\n    var nrws = new Array(N);\n    var nrwst = new Array(N);\n    var niwst = new Array(N);\n\n    var rmws = out.words;\n    rmws.length = N;\n\n    this.convert13b(x.words, x.length, rws, N);\n    this.convert13b(y.words, y.length, nrws, N);\n\n    this.transform(rws, _, rwst, iwst, N, rbt);\n    this.transform(nrws, _, nrwst, niwst, N, rbt);\n\n    for (var i = 0; i < N; i++) {\n      var rx = rwst[i] * nrwst[i] - iwst[i] * niwst[i];\n      iwst[i] = rwst[i] * niwst[i] + iwst[i] * nrwst[i];\n      rwst[i] = rx;\n    }\n\n    this.conjugate(rwst, iwst, N);\n    this.transform(rwst, iwst, rmws, _, N, rbt);\n    this.conjugate(rmws, _, N);\n    this.normalize13b(rmws, N);\n\n    out.negative = x.negative ^ y.negative;\n    out.length = x.length + y.length;\n    return out._strip();\n  };\n\n  // Multiply `this` by `num`\n  BN.prototype.mul = function mul (num) {\n    var out = new BN(null);\n    out.words = new Array(this.length + num.length);\n    return this.mulTo(num, out);\n  };\n\n  // Multiply employing FFT\n  BN.prototype.mulf = function mulf (num) {\n    var out = new BN(null);\n    out.words = new Array(this.length + num.length);\n    return jumboMulTo(this, num, out);\n  };\n\n  // In-place Multiplication\n  BN.prototype.imul = function imul (num) {\n    return this.clone().mulTo(num, this);\n  };\n\n  BN.prototype.imuln = function imuln (num) {\n    var isNegNum = num < 0;\n    if (isNegNum) num = -num;\n\n    assert(typeof num === 'number');\n    assert(num < 0x4000000);\n\n    // Carry\n    var carry = 0;\n    for (var i = 0; i < this.length; i++) {\n      var w = (this.words[i] | 0) * num;\n      var lo = (w & 0x3ffffff) + (carry & 0x3ffffff);\n      carry >>= 26;\n      carry += (w / 0x4000000) | 0;\n      // NOTE: lo is 27bit maximum\n      carry += lo >>> 26;\n      this.words[i] = lo & 0x3ffffff;\n    }\n\n    if (carry !== 0) {\n      this.words[i] = carry;\n      this.length++;\n    }\n\n    return isNegNum ? this.ineg() : this;\n  };\n\n  BN.prototype.muln = function muln (num) {\n    return this.clone().imuln(num);\n  };\n\n  // `this` * `this`\n  BN.prototype.sqr = function sqr () {\n    return this.mul(this);\n  };\n\n  // `this` * `this` in-place\n  BN.prototype.isqr = function isqr () {\n    return this.imul(this.clone());\n  };\n\n  // Math.pow(`this`, `num`)\n  BN.prototype.pow = function pow (num) {\n    var w = toBitArray(num);\n    if (w.length === 0) return new BN(1);\n\n    // Skip leading zeroes\n    var res = this;\n    for (var i = 0; i < w.length; i++, res = res.sqr()) {\n      if (w[i] !== 0) break;\n    }\n\n    if (++i < w.length) {\n      for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) {\n        if (w[i] === 0) continue;\n\n        res = res.mul(q);\n      }\n    }\n\n    return res;\n  };\n\n  // Shift-left in-place\n  BN.prototype.iushln = function iushln (bits) {\n    assert(typeof bits === 'number' && bits >= 0);\n    var r = bits % 26;\n    var s = (bits - r) / 26;\n    var carryMask = (0x3ffffff >>> (26 - r)) << (26 - r);\n    var i;\n\n    if (r !== 0) {\n      var carry = 0;\n\n      for (i = 0; i < this.length; i++) {\n        var newCarry = this.words[i] & carryMask;\n        var c = ((this.words[i] | 0) - newCarry) << r;\n        this.words[i] = c | carry;\n        carry = newCarry >>> (26 - r);\n      }\n\n      if (carry) {\n        this.words[i] = carry;\n        this.length++;\n      }\n    }\n\n    if (s !== 0) {\n      for (i = this.length - 1; i >= 0; i--) {\n        this.words[i + s] = this.words[i];\n      }\n\n      for (i = 0; i < s; i++) {\n        this.words[i] = 0;\n      }\n\n      this.length += s;\n    }\n\n    return this._strip();\n  };\n\n  BN.prototype.ishln = function ishln (bits) {\n    // TODO(indutny): implement me\n    assert(this.negative === 0);\n    return this.iushln(bits);\n  };\n\n  // Shift-right in-place\n  // NOTE: `hint` is a lowest bit before trailing zeroes\n  // NOTE: if `extended` is present - it will be filled with destroyed bits\n  BN.prototype.iushrn = function iushrn (bits, hint, extended) {\n    assert(typeof bits === 'number' && bits >= 0);\n    var h;\n    if (hint) {\n      h = (hint - (hint % 26)) / 26;\n    } else {\n      h = 0;\n    }\n\n    var r = bits % 26;\n    var s = Math.min((bits - r) / 26, this.length);\n    var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r);\n    var maskedWords = extended;\n\n    h -= s;\n    h = Math.max(0, h);\n\n    // Extended mode, copy masked part\n    if (maskedWords) {\n      for (var i = 0; i < s; i++) {\n        maskedWords.words[i] = this.words[i];\n      }\n      maskedWords.length = s;\n    }\n\n    if (s === 0) {\n      // No-op, we should not move anything at all\n    } else if (this.length > s) {\n      this.length -= s;\n      for (i = 0; i < this.length; i++) {\n        this.words[i] = this.words[i + s];\n      }\n    } else {\n      this.words[0] = 0;\n      this.length = 1;\n    }\n\n    var carry = 0;\n    for (i = this.length - 1; i >= 0 && (carry !== 0 || i >= h); i--) {\n      var word = this.words[i] | 0;\n      this.words[i] = (carry << (26 - r)) | (word >>> r);\n      carry = word & mask;\n    }\n\n    // Push carried bits as a mask\n    if (maskedWords && carry !== 0) {\n      maskedWords.words[maskedWords.length++] = carry;\n    }\n\n    if (this.length === 0) {\n      this.words[0] = 0;\n      this.length = 1;\n    }\n\n    return this._strip();\n  };\n\n  BN.prototype.ishrn = function ishrn (bits, hint, extended) {\n    // TODO(indutny): implement me\n    assert(this.negative === 0);\n    return this.iushrn(bits, hint, extended);\n  };\n\n  // Shift-left\n  BN.prototype.shln = function shln (bits) {\n    return this.clone().ishln(bits);\n  };\n\n  BN.prototype.ushln = function ushln (bits) {\n    return this.clone().iushln(bits);\n  };\n\n  // Shift-right\n  BN.prototype.shrn = function shrn (bits) {\n    return this.clone().ishrn(bits);\n  };\n\n  BN.prototype.ushrn = function ushrn (bits) {\n    return this.clone().iushrn(bits);\n  };\n\n  // Test if n bit is set\n  BN.prototype.testn = function testn (bit) {\n    assert(typeof bit === 'number' && bit >= 0);\n    var r = bit % 26;\n    var s = (bit - r) / 26;\n    var q = 1 << r;\n\n    // Fast case: bit is much higher than all existing words\n    if (this.length <= s) return false;\n\n    // Check bit and return\n    var w = this.words[s];\n\n    return !!(w & q);\n  };\n\n  // Return only lowers bits of number (in-place)\n  BN.prototype.imaskn = function imaskn (bits) {\n    assert(typeof bits === 'number' && bits >= 0);\n    var r = bits % 26;\n    var s = (bits - r) / 26;\n\n    assert(this.negative === 0, 'imaskn works only with positive numbers');\n\n    if (this.length <= s) {\n      return this;\n    }\n\n    if (r !== 0) {\n      s++;\n    }\n    this.length = Math.min(s, this.length);\n\n    if (r !== 0) {\n      var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r);\n      this.words[this.length - 1] &= mask;\n    }\n\n    return this._strip();\n  };\n\n  // Return only lowers bits of number\n  BN.prototype.maskn = function maskn (bits) {\n    return this.clone().imaskn(bits);\n  };\n\n  // Add plain number `num` to `this`\n  BN.prototype.iaddn = function iaddn (num) {\n    assert(typeof num === 'number');\n    assert(num < 0x4000000);\n    if (num < 0) return this.isubn(-num);\n\n    // Possible sign change\n    if (this.negative !== 0) {\n      if (this.length === 1 && (this.words[0] | 0) <= num) {\n        this.words[0] = num - (this.words[0] | 0);\n        this.negative = 0;\n        return this;\n      }\n\n      this.negative = 0;\n      this.isubn(num);\n      this.negative = 1;\n      return this;\n    }\n\n    // Add without checks\n    return this._iaddn(num);\n  };\n\n  BN.prototype._iaddn = function _iaddn (num) {\n    this.words[0] += num;\n\n    // Carry\n    for (var i = 0; i < this.length && this.words[i] >= 0x4000000; i++) {\n      this.words[i] -= 0x4000000;\n      if (i === this.length - 1) {\n        this.words[i + 1] = 1;\n      } else {\n        this.words[i + 1]++;\n      }\n    }\n    this.length = Math.max(this.length, i + 1);\n\n    return this;\n  };\n\n  // Subtract plain number `num` from `this`\n  BN.prototype.isubn = function isubn (num) {\n    assert(typeof num === 'number');\n    assert(num < 0x4000000);\n    if (num < 0) return this.iaddn(-num);\n\n    if (this.negative !== 0) {\n      this.negative = 0;\n      this.iaddn(num);\n      this.negative = 1;\n      return this;\n    }\n\n    this.words[0] -= num;\n\n    if (this.length === 1 && this.words[0] < 0) {\n      this.words[0] = -this.words[0];\n      this.negative = 1;\n    } else {\n      // Carry\n      for (var i = 0; i < this.length && this.words[i] < 0; i++) {\n        this.words[i] += 0x4000000;\n        this.words[i + 1] -= 1;\n      }\n    }\n\n    return this._strip();\n  };\n\n  BN.prototype.addn = function addn (num) {\n    return this.clone().iaddn(num);\n  };\n\n  BN.prototype.subn = function subn (num) {\n    return this.clone().isubn(num);\n  };\n\n  BN.prototype.iabs = function iabs () {\n    this.negative = 0;\n\n    return this;\n  };\n\n  BN.prototype.abs = function abs () {\n    return this.clone().iabs();\n  };\n\n  BN.prototype._ishlnsubmul = function _ishlnsubmul (num, mul, shift) {\n    var len = num.length + shift;\n    var i;\n\n    this._expand(len);\n\n    var w;\n    var carry = 0;\n    for (i = 0; i < num.length; i++) {\n      w = (this.words[i + shift] | 0) + carry;\n      var right = (num.words[i] | 0) * mul;\n      w -= right & 0x3ffffff;\n      carry = (w >> 26) - ((right / 0x4000000) | 0);\n      this.words[i + shift] = w & 0x3ffffff;\n    }\n    for (; i < this.length - shift; i++) {\n      w = (this.words[i + shift] | 0) + carry;\n      carry = w >> 26;\n      this.words[i + shift] = w & 0x3ffffff;\n    }\n\n    if (carry === 0) return this._strip();\n\n    // Subtraction overflow\n    assert(carry === -1);\n    carry = 0;\n    for (i = 0; i < this.length; i++) {\n      w = -(this.words[i] | 0) + carry;\n      carry = w >> 26;\n      this.words[i] = w & 0x3ffffff;\n    }\n    this.negative = 1;\n\n    return this._strip();\n  };\n\n  BN.prototype._wordDiv = function _wordDiv (num, mode) {\n    var shift = this.length - num.length;\n\n    var a = this.clone();\n    var b = num;\n\n    // Normalize\n    var bhi = b.words[b.length - 1] | 0;\n    var bhiBits = this._countBits(bhi);\n    shift = 26 - bhiBits;\n    if (shift !== 0) {\n      b = b.ushln(shift);\n      a.iushln(shift);\n      bhi = b.words[b.length - 1] | 0;\n    }\n\n    // Initialize quotient\n    var m = a.length - b.length;\n    var q;\n\n    if (mode !== 'mod') {\n      q = new BN(null);\n      q.length = m + 1;\n      q.words = new Array(q.length);\n      for (var i = 0; i < q.length; i++) {\n        q.words[i] = 0;\n      }\n    }\n\n    var diff = a.clone()._ishlnsubmul(b, 1, m);\n    if (diff.negative === 0) {\n      a = diff;\n      if (q) {\n        q.words[m] = 1;\n      }\n    }\n\n    for (var j = m - 1; j >= 0; j--) {\n      var qj = (a.words[b.length + j] | 0) * 0x4000000 +\n        (a.words[b.length + j - 1] | 0);\n\n      // NOTE: (qj / bhi) is (0x3ffffff * 0x4000000 + 0x3ffffff) / 0x2000000 max\n      // (0x7ffffff)\n      qj = Math.min((qj / bhi) | 0, 0x3ffffff);\n\n      a._ishlnsubmul(b, qj, j);\n      while (a.negative !== 0) {\n        qj--;\n        a.negative = 0;\n        a._ishlnsubmul(b, 1, j);\n        if (!a.isZero()) {\n          a.negative ^= 1;\n        }\n      }\n      if (q) {\n        q.words[j] = qj;\n      }\n    }\n    if (q) {\n      q._strip();\n    }\n    a._strip();\n\n    // Denormalize\n    if (mode !== 'div' && shift !== 0) {\n      a.iushrn(shift);\n    }\n\n    return {\n      div: q || null,\n      mod: a\n    };\n  };\n\n  // NOTE: 1) `mode` can be set to `mod` to request mod only,\n  //       to `div` to request div only, or be absent to\n  //       request both div & mod\n  //       2) `positive` is true if unsigned mod is requested\n  BN.prototype.divmod = function divmod (num, mode, positive) {\n    assert(!num.isZero());\n\n    if (this.isZero()) {\n      return {\n        div: new BN(0),\n        mod: new BN(0)\n      };\n    }\n\n    var div, mod, res;\n    if (this.negative !== 0 && num.negative === 0) {\n      res = this.neg().divmod(num, mode);\n\n      if (mode !== 'mod') {\n        div = res.div.neg();\n      }\n\n      if (mode !== 'div') {\n        mod = res.mod.neg();\n        if (positive && mod.negative !== 0) {\n          mod.iadd(num);\n        }\n      }\n\n      return {\n        div: div,\n        mod: mod\n      };\n    }\n\n    if (this.negative === 0 && num.negative !== 0) {\n      res = this.divmod(num.neg(), mode);\n\n      if (mode !== 'mod') {\n        div = res.div.neg();\n      }\n\n      return {\n        div: div,\n        mod: res.mod\n      };\n    }\n\n    if ((this.negative & num.negative) !== 0) {\n      res = this.neg().divmod(num.neg(), mode);\n\n      if (mode !== 'div') {\n        mod = res.mod.neg();\n        if (positive && mod.negative !== 0) {\n          mod.isub(num);\n        }\n      }\n\n      return {\n        div: res.div,\n        mod: mod\n      };\n    }\n\n    // Both numbers are positive at this point\n\n    // Strip both numbers to approximate shift value\n    if (num.length > this.length || this.cmp(num) < 0) {\n      return {\n        div: new BN(0),\n        mod: this\n      };\n    }\n\n    // Very short reduction\n    if (num.length === 1) {\n      if (mode === 'div') {\n        return {\n          div: this.divn(num.words[0]),\n          mod: null\n        };\n      }\n\n      if (mode === 'mod') {\n        return {\n          div: null,\n          mod: new BN(this.modrn(num.words[0]))\n        };\n      }\n\n      return {\n        div: this.divn(num.words[0]),\n        mod: new BN(this.modrn(num.words[0]))\n      };\n    }\n\n    return this._wordDiv(num, mode);\n  };\n\n  // Find `this` / `num`\n  BN.prototype.div = function div (num) {\n    return this.divmod(num, 'div', false).div;\n  };\n\n  // Find `this` % `num`\n  BN.prototype.mod = function mod (num) {\n    return this.divmod(num, 'mod', false).mod;\n  };\n\n  BN.prototype.umod = function umod (num) {\n    return this.divmod(num, 'mod', true).mod;\n  };\n\n  // Find Round(`this` / `num`)\n  BN.prototype.divRound = function divRound (num) {\n    var dm = this.divmod(num);\n\n    // Fast case - exact division\n    if (dm.mod.isZero()) return dm.div;\n\n    var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod;\n\n    var half = num.ushrn(1);\n    var r2 = num.andln(1);\n    var cmp = mod.cmp(half);\n\n    // Round down\n    if (cmp < 0 || (r2 === 1 && cmp === 0)) return dm.div;\n\n    // Round up\n    return dm.div.negative !== 0 ? dm.div.isubn(1) : dm.div.iaddn(1);\n  };\n\n  BN.prototype.modrn = function modrn (num) {\n    var isNegNum = num < 0;\n    if (isNegNum) num = -num;\n\n    assert(num <= 0x3ffffff);\n    var p = (1 << 26) % num;\n\n    var acc = 0;\n    for (var i = this.length - 1; i >= 0; i--) {\n      acc = (p * acc + (this.words[i] | 0)) % num;\n    }\n\n    return isNegNum ? -acc : acc;\n  };\n\n  // WARNING: DEPRECATED\n  BN.prototype.modn = function modn (num) {\n    return this.modrn(num);\n  };\n\n  // In-place division by number\n  BN.prototype.idivn = function idivn (num) {\n    var isNegNum = num < 0;\n    if (isNegNum) num = -num;\n\n    assert(num <= 0x3ffffff);\n\n    var carry = 0;\n    for (var i = this.length - 1; i >= 0; i--) {\n      var w = (this.words[i] | 0) + carry * 0x4000000;\n      this.words[i] = (w / num) | 0;\n      carry = w % num;\n    }\n\n    this._strip();\n    return isNegNum ? this.ineg() : this;\n  };\n\n  BN.prototype.divn = function divn (num) {\n    return this.clone().idivn(num);\n  };\n\n  BN.prototype.egcd = function egcd (p) {\n    assert(p.negative === 0);\n    assert(!p.isZero());\n\n    var x = this;\n    var y = p.clone();\n\n    if (x.negative !== 0) {\n      x = x.umod(p);\n    } else {\n      x = x.clone();\n    }\n\n    // A * x + B * y = x\n    var A = new BN(1);\n    var B = new BN(0);\n\n    // C * x + D * y = y\n    var C = new BN(0);\n    var D = new BN(1);\n\n    var g = 0;\n\n    while (x.isEven() && y.isEven()) {\n      x.iushrn(1);\n      y.iushrn(1);\n      ++g;\n    }\n\n    var yp = y.clone();\n    var xp = x.clone();\n\n    while (!x.isZero()) {\n      for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n      if (i > 0) {\n        x.iushrn(i);\n        while (i-- > 0) {\n          if (A.isOdd() || B.isOdd()) {\n            A.iadd(yp);\n            B.isub(xp);\n          }\n\n          A.iushrn(1);\n          B.iushrn(1);\n        }\n      }\n\n      for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n      if (j > 0) {\n        y.iushrn(j);\n        while (j-- > 0) {\n          if (C.isOdd() || D.isOdd()) {\n            C.iadd(yp);\n            D.isub(xp);\n          }\n\n          C.iushrn(1);\n          D.iushrn(1);\n        }\n      }\n\n      if (x.cmp(y) >= 0) {\n        x.isub(y);\n        A.isub(C);\n        B.isub(D);\n      } else {\n        y.isub(x);\n        C.isub(A);\n        D.isub(B);\n      }\n    }\n\n    return {\n      a: C,\n      b: D,\n      gcd: y.iushln(g)\n    };\n  };\n\n  // This is reduced incarnation of the binary EEA\n  // above, designated to invert members of the\n  // _prime_ fields F(p) at a maximal speed\n  BN.prototype._invmp = function _invmp (p) {\n    assert(p.negative === 0);\n    assert(!p.isZero());\n\n    var a = this;\n    var b = p.clone();\n\n    if (a.negative !== 0) {\n      a = a.umod(p);\n    } else {\n      a = a.clone();\n    }\n\n    var x1 = new BN(1);\n    var x2 = new BN(0);\n\n    var delta = b.clone();\n\n    while (a.cmpn(1) > 0 && b.cmpn(1) > 0) {\n      for (var i = 0, im = 1; (a.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n      if (i > 0) {\n        a.iushrn(i);\n        while (i-- > 0) {\n          if (x1.isOdd()) {\n            x1.iadd(delta);\n          }\n\n          x1.iushrn(1);\n        }\n      }\n\n      for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n      if (j > 0) {\n        b.iushrn(j);\n        while (j-- > 0) {\n          if (x2.isOdd()) {\n            x2.iadd(delta);\n          }\n\n          x2.iushrn(1);\n        }\n      }\n\n      if (a.cmp(b) >= 0) {\n        a.isub(b);\n        x1.isub(x2);\n      } else {\n        b.isub(a);\n        x2.isub(x1);\n      }\n    }\n\n    var res;\n    if (a.cmpn(1) === 0) {\n      res = x1;\n    } else {\n      res = x2;\n    }\n\n    if (res.cmpn(0) < 0) {\n      res.iadd(p);\n    }\n\n    return res;\n  };\n\n  BN.prototype.gcd = function gcd (num) {\n    if (this.isZero()) return num.abs();\n    if (num.isZero()) return this.abs();\n\n    var a = this.clone();\n    var b = num.clone();\n    a.negative = 0;\n    b.negative = 0;\n\n    // Remove common factor of two\n    for (var shift = 0; a.isEven() && b.isEven(); shift++) {\n      a.iushrn(1);\n      b.iushrn(1);\n    }\n\n    do {\n      while (a.isEven()) {\n        a.iushrn(1);\n      }\n      while (b.isEven()) {\n        b.iushrn(1);\n      }\n\n      var r = a.cmp(b);\n      if (r < 0) {\n        // Swap `a` and `b` to make `a` always bigger than `b`\n        var t = a;\n        a = b;\n        b = t;\n      } else if (r === 0 || b.cmpn(1) === 0) {\n        break;\n      }\n\n      a.isub(b);\n    } while (true);\n\n    return b.iushln(shift);\n  };\n\n  // Invert number in the field F(num)\n  BN.prototype.invm = function invm (num) {\n    return this.egcd(num).a.umod(num);\n  };\n\n  BN.prototype.isEven = function isEven () {\n    return (this.words[0] & 1) === 0;\n  };\n\n  BN.prototype.isOdd = function isOdd () {\n    return (this.words[0] & 1) === 1;\n  };\n\n  // And first word and num\n  BN.prototype.andln = function andln (num) {\n    return this.words[0] & num;\n  };\n\n  // Increment at the bit position in-line\n  BN.prototype.bincn = function bincn (bit) {\n    assert(typeof bit === 'number');\n    var r = bit % 26;\n    var s = (bit - r) / 26;\n    var q = 1 << r;\n\n    // Fast case: bit is much higher than all existing words\n    if (this.length <= s) {\n      this._expand(s + 1);\n      this.words[s] |= q;\n      return this;\n    }\n\n    // Add bit and propagate, if needed\n    var carry = q;\n    for (var i = s; carry !== 0 && i < this.length; i++) {\n      var w = this.words[i] | 0;\n      w += carry;\n      carry = w >>> 26;\n      w &= 0x3ffffff;\n      this.words[i] = w;\n    }\n    if (carry !== 0) {\n      this.words[i] = carry;\n      this.length++;\n    }\n    return this;\n  };\n\n  BN.prototype.isZero = function isZero () {\n    return this.length === 1 && this.words[0] === 0;\n  };\n\n  BN.prototype.cmpn = function cmpn (num) {\n    var negative = num < 0;\n\n    if (this.negative !== 0 && !negative) return -1;\n    if (this.negative === 0 && negative) return 1;\n\n    this._strip();\n\n    var res;\n    if (this.length > 1) {\n      res = 1;\n    } else {\n      if (negative) {\n        num = -num;\n      }\n\n      assert(num <= 0x3ffffff, 'Number is too big');\n\n      var w = this.words[0] | 0;\n      res = w === num ? 0 : w < num ? -1 : 1;\n    }\n    if (this.negative !== 0) return -res | 0;\n    return res;\n  };\n\n  // Compare two numbers and return:\n  // 1 - if `this` > `num`\n  // 0 - if `this` == `num`\n  // -1 - if `this` < `num`\n  BN.prototype.cmp = function cmp (num) {\n    if (this.negative !== 0 && num.negative === 0) return -1;\n    if (this.negative === 0 && num.negative !== 0) return 1;\n\n    var res = this.ucmp(num);\n    if (this.negative !== 0) return -res | 0;\n    return res;\n  };\n\n  // Unsigned comparison\n  BN.prototype.ucmp = function ucmp (num) {\n    // At this point both numbers have the same sign\n    if (this.length > num.length) return 1;\n    if (this.length < num.length) return -1;\n\n    var res = 0;\n    for (var i = this.length - 1; i >= 0; i--) {\n      var a = this.words[i] | 0;\n      var b = num.words[i] | 0;\n\n      if (a === b) continue;\n      if (a < b) {\n        res = -1;\n      } else if (a > b) {\n        res = 1;\n      }\n      break;\n    }\n    return res;\n  };\n\n  BN.prototype.gtn = function gtn (num) {\n    return this.cmpn(num) === 1;\n  };\n\n  BN.prototype.gt = function gt (num) {\n    return this.cmp(num) === 1;\n  };\n\n  BN.prototype.gten = function gten (num) {\n    return this.cmpn(num) >= 0;\n  };\n\n  BN.prototype.gte = function gte (num) {\n    return this.cmp(num) >= 0;\n  };\n\n  BN.prototype.ltn = function ltn (num) {\n    return this.cmpn(num) === -1;\n  };\n\n  BN.prototype.lt = function lt (num) {\n    return this.cmp(num) === -1;\n  };\n\n  BN.prototype.lten = function lten (num) {\n    return this.cmpn(num) <= 0;\n  };\n\n  BN.prototype.lte = function lte (num) {\n    return this.cmp(num) <= 0;\n  };\n\n  BN.prototype.eqn = function eqn (num) {\n    return this.cmpn(num) === 0;\n  };\n\n  BN.prototype.eq = function eq (num) {\n    return this.cmp(num) === 0;\n  };\n\n  //\n  // A reduce context, could be using montgomery or something better, depending\n  // on the `m` itself.\n  //\n  BN.red = function red (num) {\n    return new Red(num);\n  };\n\n  BN.prototype.toRed = function toRed (ctx) {\n    assert(!this.red, 'Already a number in reduction context');\n    assert(this.negative === 0, 'red works only with positives');\n    return ctx.convertTo(this)._forceRed(ctx);\n  };\n\n  BN.prototype.fromRed = function fromRed () {\n    assert(this.red, 'fromRed works only with numbers in reduction context');\n    return this.red.convertFrom(this);\n  };\n\n  BN.prototype._forceRed = function _forceRed (ctx) {\n    this.red = ctx;\n    return this;\n  };\n\n  BN.prototype.forceRed = function forceRed (ctx) {\n    assert(!this.red, 'Already a number in reduction context');\n    return this._forceRed(ctx);\n  };\n\n  BN.prototype.redAdd = function redAdd (num) {\n    assert(this.red, 'redAdd works only with red numbers');\n    return this.red.add(this, num);\n  };\n\n  BN.prototype.redIAdd = function redIAdd (num) {\n    assert(this.red, 'redIAdd works only with red numbers');\n    return this.red.iadd(this, num);\n  };\n\n  BN.prototype.redSub = function redSub (num) {\n    assert(this.red, 'redSub works only with red numbers');\n    return this.red.sub(this, num);\n  };\n\n  BN.prototype.redISub = function redISub (num) {\n    assert(this.red, 'redISub works only with red numbers');\n    return this.red.isub(this, num);\n  };\n\n  BN.prototype.redShl = function redShl (num) {\n    assert(this.red, 'redShl works only with red numbers');\n    return this.red.shl(this, num);\n  };\n\n  BN.prototype.redMul = function redMul (num) {\n    assert(this.red, 'redMul works only with red numbers');\n    this.red._verify2(this, num);\n    return this.red.mul(this, num);\n  };\n\n  BN.prototype.redIMul = function redIMul (num) {\n    assert(this.red, 'redMul works only with red numbers');\n    this.red._verify2(this, num);\n    return this.red.imul(this, num);\n  };\n\n  BN.prototype.redSqr = function redSqr () {\n    assert(this.red, 'redSqr works only with red numbers');\n    this.red._verify1(this);\n    return this.red.sqr(this);\n  };\n\n  BN.prototype.redISqr = function redISqr () {\n    assert(this.red, 'redISqr works only with red numbers');\n    this.red._verify1(this);\n    return this.red.isqr(this);\n  };\n\n  // Square root over p\n  BN.prototype.redSqrt = function redSqrt () {\n    assert(this.red, 'redSqrt works only with red numbers');\n    this.red._verify1(this);\n    return this.red.sqrt(this);\n  };\n\n  BN.prototype.redInvm = function redInvm () {\n    assert(this.red, 'redInvm works only with red numbers');\n    this.red._verify1(this);\n    return this.red.invm(this);\n  };\n\n  // Return negative clone of `this` % `red modulo`\n  BN.prototype.redNeg = function redNeg () {\n    assert(this.red, 'redNeg works only with red numbers');\n    this.red._verify1(this);\n    return this.red.neg(this);\n  };\n\n  BN.prototype.redPow = function redPow (num) {\n    assert(this.red && !num.red, 'redPow(normalNum)');\n    this.red._verify1(this);\n    return this.red.pow(this, num);\n  };\n\n  // Prime numbers with efficient reduction\n  var primes = {\n    k256: null,\n    p224: null,\n    p192: null,\n    p25519: null\n  };\n\n  // Pseudo-Mersenne prime\n  function MPrime (name, p) {\n    // P = 2 ^ N - K\n    this.name = name;\n    this.p = new BN(p, 16);\n    this.n = this.p.bitLength();\n    this.k = new BN(1).iushln(this.n).isub(this.p);\n\n    this.tmp = this._tmp();\n  }\n\n  MPrime.prototype._tmp = function _tmp () {\n    var tmp = new BN(null);\n    tmp.words = new Array(Math.ceil(this.n / 13));\n    return tmp;\n  };\n\n  MPrime.prototype.ireduce = function ireduce (num) {\n    // Assumes that `num` is less than `P^2`\n    // num = HI * (2 ^ N - K) + HI * K + LO = HI * K + LO (mod P)\n    var r = num;\n    var rlen;\n\n    do {\n      this.split(r, this.tmp);\n      r = this.imulK(r);\n      r = r.iadd(this.tmp);\n      rlen = r.bitLength();\n    } while (rlen > this.n);\n\n    var cmp = rlen < this.n ? -1 : r.ucmp(this.p);\n    if (cmp === 0) {\n      r.words[0] = 0;\n      r.length = 1;\n    } else if (cmp > 0) {\n      r.isub(this.p);\n    } else {\n      if (r.strip !== undefined) {\n        // r is a BN v4 instance\n        r.strip();\n      } else {\n        // r is a BN v5 instance\n        r._strip();\n      }\n    }\n\n    return r;\n  };\n\n  MPrime.prototype.split = function split (input, out) {\n    input.iushrn(this.n, 0, out);\n  };\n\n  MPrime.prototype.imulK = function imulK (num) {\n    return num.imul(this.k);\n  };\n\n  function K256 () {\n    MPrime.call(\n      this,\n      'k256',\n      'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f');\n  }\n  inherits(K256, MPrime);\n\n  K256.prototype.split = function split (input, output) {\n    // 256 = 9 * 26 + 22\n    var mask = 0x3fffff;\n\n    var outLen = Math.min(input.length, 9);\n    for (var i = 0; i < outLen; i++) {\n      output.words[i] = input.words[i];\n    }\n    output.length = outLen;\n\n    if (input.length <= 9) {\n      input.words[0] = 0;\n      input.length = 1;\n      return;\n    }\n\n    // Shift by 9 limbs\n    var prev = input.words[9];\n    output.words[output.length++] = prev & mask;\n\n    for (i = 10; i < input.length; i++) {\n      var next = input.words[i] | 0;\n      input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22);\n      prev = next;\n    }\n    prev >>>= 22;\n    input.words[i - 10] = prev;\n    if (prev === 0 && input.length > 10) {\n      input.length -= 10;\n    } else {\n      input.length -= 9;\n    }\n  };\n\n  K256.prototype.imulK = function imulK (num) {\n    // K = 0x1000003d1 = [ 0x40, 0x3d1 ]\n    num.words[num.length] = 0;\n    num.words[num.length + 1] = 0;\n    num.length += 2;\n\n    // bounded at: 0x40 * 0x3ffffff + 0x3d0 = 0x100000390\n    var lo = 0;\n    for (var i = 0; i < num.length; i++) {\n      var w = num.words[i] | 0;\n      lo += w * 0x3d1;\n      num.words[i] = lo & 0x3ffffff;\n      lo = w * 0x40 + ((lo / 0x4000000) | 0);\n    }\n\n    // Fast length reduction\n    if (num.words[num.length - 1] === 0) {\n      num.length--;\n      if (num.words[num.length - 1] === 0) {\n        num.length--;\n      }\n    }\n    return num;\n  };\n\n  function P224 () {\n    MPrime.call(\n      this,\n      'p224',\n      'ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001');\n  }\n  inherits(P224, MPrime);\n\n  function P192 () {\n    MPrime.call(\n      this,\n      'p192',\n      'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff');\n  }\n  inherits(P192, MPrime);\n\n  function P25519 () {\n    // 2 ^ 255 - 19\n    MPrime.call(\n      this,\n      '25519',\n      '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed');\n  }\n  inherits(P25519, MPrime);\n\n  P25519.prototype.imulK = function imulK (num) {\n    // K = 0x13\n    var carry = 0;\n    for (var i = 0; i < num.length; i++) {\n      var hi = (num.words[i] | 0) * 0x13 + carry;\n      var lo = hi & 0x3ffffff;\n      hi >>>= 26;\n\n      num.words[i] = lo;\n      carry = hi;\n    }\n    if (carry !== 0) {\n      num.words[num.length++] = carry;\n    }\n    return num;\n  };\n\n  // Exported mostly for testing purposes, use plain name instead\n  BN._prime = function prime (name) {\n    // Cached version of prime\n    if (primes[name]) return primes[name];\n\n    var prime;\n    if (name === 'k256') {\n      prime = new K256();\n    } else if (name === 'p224') {\n      prime = new P224();\n    } else if (name === 'p192') {\n      prime = new P192();\n    } else if (name === 'p25519') {\n      prime = new P25519();\n    } else {\n      throw new Error('Unknown prime ' + name);\n    }\n    primes[name] = prime;\n\n    return prime;\n  };\n\n  //\n  // Base reduction engine\n  //\n  function Red (m) {\n    if (typeof m === 'string') {\n      var prime = BN._prime(m);\n      this.m = prime.p;\n      this.prime = prime;\n    } else {\n      assert(m.gtn(1), 'modulus must be greater than 1');\n      this.m = m;\n      this.prime = null;\n    }\n  }\n\n  Red.prototype._verify1 = function _verify1 (a) {\n    assert(a.negative === 0, 'red works only with positives');\n    assert(a.red, 'red works only with red numbers');\n  };\n\n  Red.prototype._verify2 = function _verify2 (a, b) {\n    assert((a.negative | b.negative) === 0, 'red works only with positives');\n    assert(a.red && a.red === b.red,\n      'red works only with red numbers');\n  };\n\n  Red.prototype.imod = function imod (a) {\n    if (this.prime) return this.prime.ireduce(a)._forceRed(this);\n\n    move(a, a.umod(this.m)._forceRed(this));\n    return a;\n  };\n\n  Red.prototype.neg = function neg (a) {\n    if (a.isZero()) {\n      return a.clone();\n    }\n\n    return this.m.sub(a)._forceRed(this);\n  };\n\n  Red.prototype.add = function add (a, b) {\n    this._verify2(a, b);\n\n    var res = a.add(b);\n    if (res.cmp(this.m) >= 0) {\n      res.isub(this.m);\n    }\n    return res._forceRed(this);\n  };\n\n  Red.prototype.iadd = function iadd (a, b) {\n    this._verify2(a, b);\n\n    var res = a.iadd(b);\n    if (res.cmp(this.m) >= 0) {\n      res.isub(this.m);\n    }\n    return res;\n  };\n\n  Red.prototype.sub = function sub (a, b) {\n    this._verify2(a, b);\n\n    var res = a.sub(b);\n    if (res.cmpn(0) < 0) {\n      res.iadd(this.m);\n    }\n    return res._forceRed(this);\n  };\n\n  Red.prototype.isub = function isub (a, b) {\n    this._verify2(a, b);\n\n    var res = a.isub(b);\n    if (res.cmpn(0) < 0) {\n      res.iadd(this.m);\n    }\n    return res;\n  };\n\n  Red.prototype.shl = function shl (a, num) {\n    this._verify1(a);\n    return this.imod(a.ushln(num));\n  };\n\n  Red.prototype.imul = function imul (a, b) {\n    this._verify2(a, b);\n    return this.imod(a.imul(b));\n  };\n\n  Red.prototype.mul = function mul (a, b) {\n    this._verify2(a, b);\n    return this.imod(a.mul(b));\n  };\n\n  Red.prototype.isqr = function isqr (a) {\n    return this.imul(a, a.clone());\n  };\n\n  Red.prototype.sqr = function sqr (a) {\n    return this.mul(a, a);\n  };\n\n  Red.prototype.sqrt = function sqrt (a) {\n    if (a.isZero()) return a.clone();\n\n    var mod3 = this.m.andln(3);\n    assert(mod3 % 2 === 1);\n\n    // Fast case\n    if (mod3 === 3) {\n      var pow = this.m.add(new BN(1)).iushrn(2);\n      return this.pow(a, pow);\n    }\n\n    // Tonelli-Shanks algorithm (Totally unoptimized and slow)\n    //\n    // Find Q and S, that Q * 2 ^ S = (P - 1)\n    var q = this.m.subn(1);\n    var s = 0;\n    while (!q.isZero() && q.andln(1) === 0) {\n      s++;\n      q.iushrn(1);\n    }\n    assert(!q.isZero());\n\n    var one = new BN(1).toRed(this);\n    var nOne = one.redNeg();\n\n    // Find quadratic non-residue\n    // NOTE: Max is such because of generalized Riemann hypothesis.\n    var lpow = this.m.subn(1).iushrn(1);\n    var z = this.m.bitLength();\n    z = new BN(2 * z * z).toRed(this);\n\n    while (this.pow(z, lpow).cmp(nOne) !== 0) {\n      z.redIAdd(nOne);\n    }\n\n    var c = this.pow(z, q);\n    var r = this.pow(a, q.addn(1).iushrn(1));\n    var t = this.pow(a, q);\n    var m = s;\n    while (t.cmp(one) !== 0) {\n      var tmp = t;\n      for (var i = 0; tmp.cmp(one) !== 0; i++) {\n        tmp = tmp.redSqr();\n      }\n      assert(i < m);\n      var b = this.pow(c, new BN(1).iushln(m - i - 1));\n\n      r = r.redMul(b);\n      c = b.redSqr();\n      t = t.redMul(c);\n      m = i;\n    }\n\n    return r;\n  };\n\n  Red.prototype.invm = function invm (a) {\n    var inv = a._invmp(this.m);\n    if (inv.negative !== 0) {\n      inv.negative = 0;\n      return this.imod(inv).redNeg();\n    } else {\n      return this.imod(inv);\n    }\n  };\n\n  Red.prototype.pow = function pow (a, num) {\n    if (num.isZero()) return new BN(1).toRed(this);\n    if (num.cmpn(1) === 0) return a.clone();\n\n    var windowSize = 4;\n    var wnd = new Array(1 << windowSize);\n    wnd[0] = new BN(1).toRed(this);\n    wnd[1] = a;\n    for (var i = 2; i < wnd.length; i++) {\n      wnd[i] = this.mul(wnd[i - 1], a);\n    }\n\n    var res = wnd[0];\n    var current = 0;\n    var currentLen = 0;\n    var start = num.bitLength() % 26;\n    if (start === 0) {\n      start = 26;\n    }\n\n    for (i = num.length - 1; i >= 0; i--) {\n      var word = num.words[i];\n      for (var j = start - 1; j >= 0; j--) {\n        var bit = (word >> j) & 1;\n        if (res !== wnd[0]) {\n          res = this.sqr(res);\n        }\n\n        if (bit === 0 && current === 0) {\n          currentLen = 0;\n          continue;\n        }\n\n        current <<= 1;\n        current |= bit;\n        currentLen++;\n        if (currentLen !== windowSize && (i !== 0 || j !== 0)) continue;\n\n        res = this.mul(res, wnd[current]);\n        currentLen = 0;\n        current = 0;\n      }\n      start = 26;\n    }\n\n    return res;\n  };\n\n  Red.prototype.convertTo = function convertTo (num) {\n    var r = num.umod(this.m);\n\n    return r === num ? r.clone() : r;\n  };\n\n  Red.prototype.convertFrom = function convertFrom (num) {\n    var res = num.clone();\n    res.red = null;\n    return res;\n  };\n\n  //\n  // Montgomery method engine\n  //\n\n  BN.mont = function mont (num) {\n    return new Mont(num);\n  };\n\n  function Mont (m) {\n    Red.call(this, m);\n\n    this.shift = this.m.bitLength();\n    if (this.shift % 26 !== 0) {\n      this.shift += 26 - (this.shift % 26);\n    }\n\n    this.r = new BN(1).iushln(this.shift);\n    this.r2 = this.imod(this.r.sqr());\n    this.rinv = this.r._invmp(this.m);\n\n    this.minv = this.rinv.mul(this.r).isubn(1).div(this.m);\n    this.minv = this.minv.umod(this.r);\n    this.minv = this.r.sub(this.minv);\n  }\n  inherits(Mont, Red);\n\n  Mont.prototype.convertTo = function convertTo (num) {\n    return this.imod(num.ushln(this.shift));\n  };\n\n  Mont.prototype.convertFrom = function convertFrom (num) {\n    var r = this.imod(num.mul(this.rinv));\n    r.red = null;\n    return r;\n  };\n\n  Mont.prototype.imul = function imul (a, b) {\n    if (a.isZero() || b.isZero()) {\n      a.words[0] = 0;\n      a.length = 1;\n      return a;\n    }\n\n    var t = a.imul(b);\n    var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m);\n    var u = t.isub(c).iushrn(this.shift);\n    var res = u;\n\n    if (u.cmp(this.m) >= 0) {\n      res = u.isub(this.m);\n    } else if (u.cmpn(0) < 0) {\n      res = u.iadd(this.m);\n    }\n\n    return res._forceRed(this);\n  };\n\n  Mont.prototype.mul = function mul (a, b) {\n    if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this);\n\n    var t = a.mul(b);\n    var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m);\n    var u = t.isub(c).iushrn(this.shift);\n    var res = u;\n    if (u.cmp(this.m) >= 0) {\n      res = u.isub(this.m);\n    } else if (u.cmpn(0) < 0) {\n      res = u.iadd(this.m);\n    }\n\n    return res._forceRed(this);\n  };\n\n  Mont.prototype.invm = function invm (a) {\n    // (AR)^-1 * R^2 = (A^-1 * R^-1) * R^2 = A^-1 * R\n    var res = this.imod(a._invmp(this.m).mul(this.r2));\n    return res._forceRed(this);\n  };\n})(typeof module === 'undefined' || module, this);\n"],"sourceRoot":""}