{"version":3,"sources":["webpack:///./node_modules/minimalistic-crypto-utils/lib/utils.js","webpack:///./node_modules/miller-rabin/lib/mr.js","webpack:///./node_modules/miller-rabin/node_modules/bn.js/lib/bn.js","webpack:///./node_modules/minimalistic-assert/index.js"],"names":["utils","exports","toArray","msg","enc","Array","isArray","slice","res","i","length","replace","push","parseInt","c","charCodeAt","hi","lo","zero2","word","toHex","toString","encode","arr","bn","brorand","MillerRabin","rand","this","Rand","module","create","prototype","_randbelow","n","len","bitLength","min_bytes","Math","ceil","a","generate","cmp","_randrange","start","stop","size","sub","add","test","k","cb","red","mont","rone","toRed","max","n1","subn","s","testn","d","shrn","rn1","prime","x","redPow","redSqr","getDivisor","g","gcd","cmpn","fromRed","assert","val","Error","inherits","ctor","superCtor","super_","TempCtor","constructor","BN","number","base","endian","isBN","negative","words","_init","Buffer","wordSize","e","parseHex","str","end","r","min","parseBase","mul","num","left","right","_initNumber","_initArray","_parseHex","_parseBase","strip","j","w","off","limbLen","limbPow","total","mod","imuln","_iaddn","pow","copy","dest","clone","_expand","_normSign","inspect","zeros","groupSizes","groupBases","toBitArray","bit","wbit","smallMulTo","self","out","b","carry","ncarry","rword","maxJ","padding","groupSize","groupBase","isZero","modn","idivn","toNumber","ret","toJSON","toBuffer","toArrayLike","ArrayType","byteLength","reqLength","littleEndian","q","andln","iushrn","clz32","_countBits","t","_zeroBits","zeroBits","toTwos","width","abs","inotn","iaddn","fromTwos","notn","ineg","isNeg","neg","iuor","ior","or","uor","iuand","iand","and","uand","iuxor","ixor","xor","uxor","bytesNeeded","bitsLeft","setn","iadd","isub","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","imul","w0","w1","w2","w3","w4","w5","w6","w7","w8","w9","w10","w11","w12","w13","w14","w15","w16","w17","w18","bigMulTo","hncarry","jumboMulTo","fftm","FFTM","mulp","y","mulTo","makeRBT","N","l","revBin","rb","permute","rbt","rws","iws","rtws","itws","transform","rtwdf","cos","PI","itwdf","sin","p","rtwdf_","itwdf_","re","ie","ro","io","rx","guessLen13b","m","odd","conjugate","normalize13b","ws","round","convert13b","stub","ph","_","rwst","iwst","nrws","nrwst","niwst","rmws","mulf","muln","sqr","isqr","iushln","bits","carryMask","newCarry","ishln","hint","extended","h","mask","maskedWords","ishrn","shln","ushln","ushrn","imaskn","maskn","isubn","addn","iabs","_ishlnsubmul","shift","_wordDiv","mode","bhi","bhiBits","diff","qj","div","divmod","positive","divn","umod","divRound","dm","half","r2","acc","egcd","A","B","C","D","isEven","yp","xp","im","isOdd","jm","_invmp","x1","x2","delta","invm","bincn","ucmp","gtn","gt","gten","gte","ltn","lt","lten","lte","eqn","eq","Red","ctx","convertTo","_forceRed","convertFrom","forceRed","redAdd","redIAdd","redSub","redISub","redShl","shl","redMul","_verify2","redIMul","_verify1","redISqr","redSqrt","sqrt","redInvm","redNeg","primes","k256","p224","p192","p25519","MPrime","name","tmp","_tmp","K256","call","P224","P192","P25519","_prime","Mont","imod","rinv","minv","ireduce","rlen","split","imulK","undefined","_strip","input","output","outLen","prev","next","mod3","one","nOne","lpow","z","inv","windowSize","wnd","current","currentLen","u","equal"],"mappings":"wHAEA,IAAIA,EAAQC,EAEZ,SAASC,EAAQC,EAAKC,GACpB,GAAIC,MAAMC,QAAQH,GAChB,OAAOA,EAAII,QACb,IAAKJ,EACH,MAAO,GACT,IAAIK,EAAM,GACV,GAAmB,kBAARL,EAAkB,CAC3B,IAAK,IAAIM,EAAI,EAAGA,EAAIN,EAAIO,OAAQD,IAC9BD,EAAIC,GAAc,EAATN,EAAIM,GACf,OAAOD,EAET,GAAY,QAARJ,EAAe,CACjBD,EAAMA,EAAIQ,QAAQ,eAAgB,IAC9BR,EAAIO,OAAS,IAAM,IACrBP,EAAM,IAAMA,GACd,IAASM,EAAI,EAAGA,EAAIN,EAAIO,OAAQD,GAAK,EACnCD,EAAII,KAAKC,SAASV,EAAIM,GAAKN,EAAIM,EAAI,GAAI,UAEzC,IAASA,EAAI,EAAGA,EAAIN,EAAIO,OAAQD,IAAK,CACnC,IAAIK,EAAIX,EAAIY,WAAWN,GACnBO,EAAKF,GAAK,EACVG,EAAS,IAAJH,EACLE,EACFR,EAAII,KAAKI,EAAIC,GAEbT,EAAII,KAAKK,GAGf,OAAOT,EAIT,SAASU,EAAMC,GACb,OAAoB,IAAhBA,EAAKT,OACA,IAAMS,EAENA,EAIX,SAASC,EAAMjB,GAEb,IADA,IAAIK,EAAM,GACDC,EAAI,EAAGA,EAAIN,EAAIO,OAAQD,IAC9BD,GAAOU,EAAMf,EAAIM,GAAGY,SAAS,KAC/B,OAAOb,EAdTR,EAAME,QAAUA,EAQhBF,EAAMkB,MAAQA,EAQdlB,EAAMoB,MAAQA,EAEdpB,EAAMsB,OAAS,SAAgBC,EAAKnB,GAClC,MAAY,QAARA,EACKgB,EAAMG,GAENA,I,uBCxDX,IAAIC,EAAK,EAAQ,QACbC,EAAU,EAAQ,QAEtB,SAASC,EAAYC,GACnBC,KAAKD,KAAOA,GAAQ,IAAIF,EAAQI,KAElCC,EAAO7B,QAAUyB,EAEjBA,EAAYK,OAAS,SAAgBJ,GACnC,OAAO,IAAID,EAAYC,IAGzBD,EAAYM,UAAUC,WAAa,SAAoBC,GACrD,IAAIC,EAAMD,EAAEE,YACRC,EAAYC,KAAKC,KAAKJ,EAAM,GAIhC,GACE,IAAIK,EAAI,IAAIhB,EAAGI,KAAKD,KAAKc,SAASJ,UAC7BG,EAAEE,IAAIR,IAAM,GAEnB,OAAOM,GAGTd,EAAYM,UAAUW,WAAa,SAAoBC,EAAOC,GAE5D,IAAIC,EAAOD,EAAKE,IAAIH,GACpB,OAAOA,EAAMI,IAAIpB,KAAKK,WAAWa,KAGnCpB,EAAYM,UAAUiB,KAAO,SAAcf,EAAGgB,EAAGC,GAC/C,IAAIhB,EAAMD,EAAEE,YACRgB,EAAM5B,EAAG6B,KAAKnB,GACdoB,EAAO,IAAI9B,EAAG,GAAG+B,MAAMH,GAEtBF,IACHA,EAAIZ,KAAKkB,IAAI,EAAIrB,EAAM,GAAM,IAI/B,IADA,IAAIsB,EAAKvB,EAAEwB,KAAK,GACPC,EAAI,GAAIF,EAAGG,MAAMD,GAAIA,KAM9B,IALA,IAAIE,EAAI3B,EAAE4B,KAAKH,GAEXI,EAAMN,EAAGF,MAAMH,GAEfY,GAAQ,EACLd,EAAI,EAAGA,IAAK,CACjB,IAAIV,EAAIZ,KAAKe,WAAW,IAAInB,EAAG,GAAIiC,GAC/BN,GACFA,EAAGX,GAEL,IAAIyB,EAAIzB,EAAEe,MAAMH,GAAKc,OAAOL,GAC5B,GAAoB,IAAhBI,EAAEvB,IAAIY,IAA8B,IAAfW,EAAEvB,IAAIqB,GAA/B,CAGA,IAAK,IAAItD,EAAI,EAAGA,EAAIkD,EAAGlD,IAAK,CAG1B,GAFAwD,EAAIA,EAAEE,SAEc,IAAhBF,EAAEvB,IAAIY,GACR,OAAO,EACT,GAAmB,IAAfW,EAAEvB,IAAIqB,GACR,MAGJ,GAAItD,IAAMkD,EACR,OAAO,GAGX,OAAOK,GAGTtC,EAAYM,UAAUoC,WAAa,SAAoBlC,EAAGgB,GACxD,IAAIf,EAAMD,EAAEE,YACRgB,EAAM5B,EAAG6B,KAAKnB,GACdoB,EAAO,IAAI9B,EAAG,GAAG+B,MAAMH,GAEtBF,IACHA,EAAIZ,KAAKkB,IAAI,EAAIrB,EAAM,GAAM,IAI/B,IADA,IAAIsB,EAAKvB,EAAEwB,KAAK,GACPC,EAAI,GAAIF,EAAGG,MAAMD,GAAIA,KAK9B,IAJA,IAAIE,EAAI3B,EAAE4B,KAAKH,GAEXI,EAAMN,EAAGF,MAAMH,GAEZF,EAAI,EAAGA,IAAK,CACjB,IAAIV,EAAIZ,KAAKe,WAAW,IAAInB,EAAG,GAAIiC,GAE/BY,EAAInC,EAAEoC,IAAI9B,GACd,GAAkB,IAAd6B,EAAEE,KAAK,GACT,OAAOF,EAET,IAAIJ,EAAIzB,EAAEe,MAAMH,GAAKc,OAAOL,GAC5B,GAAoB,IAAhBI,EAAEvB,IAAIY,IAA8B,IAAfW,EAAEvB,IAAIqB,GAA/B,CAGA,IAAK,IAAItD,EAAI,EAAGA,EAAIkD,EAAGlD,IAAK,CAG1B,GAFAwD,EAAIA,EAAEE,SAEc,IAAhBF,EAAEvB,IAAIY,GACR,OAAOW,EAAEO,UAAUd,KAAK,GAAGY,IAAIpC,GACjC,GAAmB,IAAf+B,EAAEvB,IAAIqB,GACR,MAGJ,GAAItD,IAAMkD,EAER,OADAM,EAAIA,EAAEE,SACCF,EAAEO,UAAUd,KAAK,GAAGY,IAAIpC,IAInC,OAAO,I,sBCjHT,2BACE,aAGA,SAASuC,EAAQC,EAAKvE,GACpB,IAAKuE,EAAK,MAAM,IAAIC,MAAMxE,GAAO,oBAKnC,SAASyE,EAAUC,EAAMC,GACvBD,EAAKE,OAASD,EACd,IAAIE,EAAW,aACfA,EAAShD,UAAY8C,EAAU9C,UAC/B6C,EAAK7C,UAAY,IAAIgD,EACrBH,EAAK7C,UAAUiD,YAAcJ,EAK/B,SAASK,EAAIC,EAAQC,EAAMC,GACzB,GAAIH,EAAGI,KAAKH,GACV,OAAOA,EAGTvD,KAAK2D,SAAW,EAChB3D,KAAK4D,MAAQ,KACb5D,KAAKlB,OAAS,EAGdkB,KAAKwB,IAAM,KAEI,OAAX+B,IACW,OAATC,GAA0B,OAATA,IACnBC,EAASD,EACTA,EAAO,IAGTxD,KAAK6D,MAAMN,GAAU,EAAGC,GAAQ,GAAIC,GAAU,OAYlD,IAAIK,EATkB,kBAAX5D,EACTA,EAAO7B,QAAUiF,EAEjBjF,EAAQiF,GAAKA,EAGfA,EAAGA,GAAKA,EACRA,EAAGS,SAAW,GAGd,IACED,EAAS,EAAQ,GAAUA,OAC3B,MAAOE,IAoIT,SAASC,EAAUC,EAAKlD,EAAOmD,GAG7B,IAFA,IAAIC,EAAI,EACJ7D,EAAMG,KAAK2D,IAAIH,EAAIpF,OAAQqF,GACtBtF,EAAImC,EAAOnC,EAAI0B,EAAK1B,IAAK,CAChC,IAAIK,EAAIgF,EAAI/E,WAAWN,GAAK,GAE5BuF,IAAM,EAIJA,GADElF,GAAK,IAAMA,GAAK,GACbA,EAAI,GAAK,GAGLA,GAAK,IAAMA,GAAK,GACpBA,EAAI,GAAK,GAIL,GAAJA,EAGT,OAAOkF,EAiCT,SAASE,EAAWJ,EAAKlD,EAAOmD,EAAKI,GAGnC,IAFA,IAAIH,EAAI,EACJ7D,EAAMG,KAAK2D,IAAIH,EAAIpF,OAAQqF,GACtBtF,EAAImC,EAAOnC,EAAI0B,EAAK1B,IAAK,CAChC,IAAIK,EAAIgF,EAAI/E,WAAWN,GAAK,GAE5BuF,GAAKG,EAIHH,GADElF,GAAK,GACFA,EAAI,GAAK,GAGLA,GAAK,GACTA,EAAI,GAAK,GAITA,EAGT,OAAOkF,EA5MTd,EAAGI,KAAO,SAAec,GACvB,OAAIA,aAAelB,GAIJ,OAARkB,GAA+B,kBAARA,GAC5BA,EAAInB,YAAYU,WAAaT,EAAGS,UAAYtF,MAAMC,QAAQ8F,EAAIZ,QAGlEN,EAAG1B,IAAM,SAAc6C,EAAMC,GAC3B,OAAID,EAAK3D,IAAI4D,GAAS,EAAUD,EACzBC,GAGTpB,EAAGe,IAAM,SAAcI,EAAMC,GAC3B,OAAID,EAAK3D,IAAI4D,GAAS,EAAUD,EACzBC,GAGTpB,EAAGlD,UAAUyD,MAAQ,SAAeN,EAAQC,EAAMC,GAChD,GAAsB,kBAAXF,EACT,OAAOvD,KAAK2E,YAAYpB,EAAQC,EAAMC,GAGxC,GAAsB,kBAAXF,EACT,OAAOvD,KAAK4E,WAAWrB,EAAQC,EAAMC,GAG1B,QAATD,IACFA,EAAO,IAETX,EAAOW,KAAiB,EAAPA,IAAaA,GAAQ,GAAKA,GAAQ,IAEnDD,EAASA,EAAO9D,WAAWV,QAAQ,OAAQ,IAC3C,IAAIiC,EAAQ,EACM,MAAduC,EAAO,IACTvC,IAGW,KAATwC,EACFxD,KAAK6E,UAAUtB,EAAQvC,GAEvBhB,KAAK8E,WAAWvB,EAAQC,EAAMxC,GAGd,MAAduC,EAAO,KACTvD,KAAK2D,SAAW,GAGlB3D,KAAK+E,QAEU,OAAXtB,GAEJzD,KAAK4E,WAAW5E,KAAK1B,UAAWkF,EAAMC,IAGxCH,EAAGlD,UAAUuE,YAAc,SAAsBpB,EAAQC,EAAMC,GACzDF,EAAS,IACXvD,KAAK2D,SAAW,EAChBJ,GAAUA,GAERA,EAAS,UACXvD,KAAK4D,MAAQ,CAAW,SAATL,GACfvD,KAAKlB,OAAS,GACLyE,EAAS,kBAClBvD,KAAK4D,MAAQ,CACF,SAATL,EACCA,EAAS,SAAa,UAEzBvD,KAAKlB,OAAS,IAEd+D,EAAOU,EAAS,kBAChBvD,KAAK4D,MAAQ,CACF,SAATL,EACCA,EAAS,SAAa,SACvB,GAEFvD,KAAKlB,OAAS,GAGD,OAAX2E,GAGJzD,KAAK4E,WAAW5E,KAAK1B,UAAWkF,EAAMC,IAGxCH,EAAGlD,UAAUwE,WAAa,SAAqBrB,EAAQC,EAAMC,GAG3D,GADAZ,EAAgC,kBAAlBU,EAAOzE,QACjByE,EAAOzE,QAAU,EAGnB,OAFAkB,KAAK4D,MAAQ,CAAE,GACf5D,KAAKlB,OAAS,EACPkB,KAGTA,KAAKlB,OAAS4B,KAAKC,KAAK4C,EAAOzE,OAAS,GACxCkB,KAAK4D,MAAQ,IAAInF,MAAMuB,KAAKlB,QAC5B,IAAK,IAAID,EAAI,EAAGA,EAAImB,KAAKlB,OAAQD,IAC/BmB,KAAK4D,MAAM/E,GAAK,EAGlB,IAAImG,EAAGC,EACHC,EAAM,EACV,GAAe,OAAXzB,EACF,IAAK5E,EAAI0E,EAAOzE,OAAS,EAAGkG,EAAI,EAAGnG,GAAK,EAAGA,GAAK,EAC9CoG,EAAI1B,EAAO1E,GAAM0E,EAAO1E,EAAI,IAAM,EAAM0E,EAAO1E,EAAI,IAAM,GACzDmB,KAAK4D,MAAMoB,IAAOC,GAAKC,EAAO,SAC9BlF,KAAK4D,MAAMoB,EAAI,GAAMC,IAAO,GAAKC,EAAQ,SACzCA,GAAO,GACHA,GAAO,KACTA,GAAO,GACPF,UAGC,GAAe,OAAXvB,EACT,IAAK5E,EAAI,EAAGmG,EAAI,EAAGnG,EAAI0E,EAAOzE,OAAQD,GAAK,EACzCoG,EAAI1B,EAAO1E,GAAM0E,EAAO1E,EAAI,IAAM,EAAM0E,EAAO1E,EAAI,IAAM,GACzDmB,KAAK4D,MAAMoB,IAAOC,GAAKC,EAAO,SAC9BlF,KAAK4D,MAAMoB,EAAI,GAAMC,IAAO,GAAKC,EAAQ,SACzCA,GAAO,GACHA,GAAO,KACTA,GAAO,GACPF,KAIN,OAAOhF,KAAK+E,SA2BdzB,EAAGlD,UAAUyE,UAAY,SAAoBtB,EAAQvC,GAEnDhB,KAAKlB,OAAS4B,KAAKC,MAAM4C,EAAOzE,OAASkC,GAAS,GAClDhB,KAAK4D,MAAQ,IAAInF,MAAMuB,KAAKlB,QAC5B,IAAK,IAAID,EAAI,EAAGA,EAAImB,KAAKlB,OAAQD,IAC/BmB,KAAK4D,MAAM/E,GAAK,EAGlB,IAAImG,EAAGC,EAEHC,EAAM,EACV,IAAKrG,EAAI0E,EAAOzE,OAAS,EAAGkG,EAAI,EAAGnG,GAAKmC,EAAOnC,GAAK,EAClDoG,EAAIhB,EAASV,EAAQ1E,EAAGA,EAAI,GAC5BmB,KAAK4D,MAAMoB,IAAOC,GAAKC,EAAO,SAE9BlF,KAAK4D,MAAMoB,EAAI,IAAMC,IAAO,GAAKC,EAAO,QACxCA,GAAO,GACHA,GAAO,KACTA,GAAO,GACPF,KAGAnG,EAAI,IAAMmC,IACZiE,EAAIhB,EAASV,EAAQvC,EAAOnC,EAAI,GAChCmB,KAAK4D,MAAMoB,IAAOC,GAAKC,EAAO,SAC9BlF,KAAK4D,MAAMoB,EAAI,IAAMC,IAAO,GAAKC,EAAO,SAE1ClF,KAAK+E,SA2BPzB,EAAGlD,UAAU0E,WAAa,SAAqBvB,EAAQC,EAAMxC,GAE3DhB,KAAK4D,MAAQ,CAAE,GACf5D,KAAKlB,OAAS,EAGd,IAAK,IAAIqG,EAAU,EAAGC,EAAU,EAAGA,GAAW,SAAWA,GAAW5B,EAClE2B,IAEFA,IACAC,EAAWA,EAAU5B,EAAQ,EAO7B,IALA,IAAI6B,EAAQ9B,EAAOzE,OAASkC,EACxBsE,EAAMD,EAAQF,EACdhB,EAAMzD,KAAK2D,IAAIgB,EAAOA,EAAQC,GAAOtE,EAErCzB,EAAO,EACFV,EAAImC,EAAOnC,EAAIsF,EAAKtF,GAAKsG,EAChC5F,EAAO+E,EAAUf,EAAQ1E,EAAGA,EAAIsG,EAAS3B,GAEzCxD,KAAKuF,MAAMH,GACPpF,KAAK4D,MAAM,GAAKrE,EAAO,SACzBS,KAAK4D,MAAM,IAAMrE,EAEjBS,KAAKwF,OAAOjG,GAIhB,GAAY,IAAR+F,EAAW,CACb,IAAIG,EAAM,EAGV,IAFAlG,EAAO+E,EAAUf,EAAQ1E,EAAG0E,EAAOzE,OAAQ0E,GAEtC3E,EAAI,EAAGA,EAAIyG,EAAKzG,IACnB4G,GAAOjC,EAGTxD,KAAKuF,MAAME,GACPzF,KAAK4D,MAAM,GAAKrE,EAAO,SACzBS,KAAK4D,MAAM,IAAMrE,EAEjBS,KAAKwF,OAAOjG,KAKlB+D,EAAGlD,UAAUsF,KAAO,SAAeC,GACjCA,EAAK/B,MAAQ,IAAInF,MAAMuB,KAAKlB,QAC5B,IAAK,IAAID,EAAI,EAAGA,EAAImB,KAAKlB,OAAQD,IAC/B8G,EAAK/B,MAAM/E,GAAKmB,KAAK4D,MAAM/E,GAE7B8G,EAAK7G,OAASkB,KAAKlB,OACnB6G,EAAKhC,SAAW3D,KAAK2D,SACrBgC,EAAKnE,IAAMxB,KAAKwB,KAGlB8B,EAAGlD,UAAUwF,MAAQ,WACnB,IAAIxB,EAAI,IAAId,EAAG,MAEf,OADAtD,KAAK0F,KAAKtB,GACHA,GAGTd,EAAGlD,UAAUyF,QAAU,SAAkB3E,GACvC,MAAOlB,KAAKlB,OAASoC,EACnBlB,KAAK4D,MAAM5D,KAAKlB,UAAY,EAE9B,OAAOkB,MAITsD,EAAGlD,UAAU2E,MAAQ,WACnB,MAAO/E,KAAKlB,OAAS,GAAqC,IAAhCkB,KAAK4D,MAAM5D,KAAKlB,OAAS,GACjDkB,KAAKlB,SAEP,OAAOkB,KAAK8F,aAGdxC,EAAGlD,UAAU0F,UAAY,WAKvB,OAHoB,IAAhB9F,KAAKlB,QAAkC,IAAlBkB,KAAK4D,MAAM,KAClC5D,KAAK2D,SAAW,GAEX3D,MAGTsD,EAAGlD,UAAU2F,QAAU,WACrB,OAAQ/F,KAAKwB,IAAM,UAAY,SAAWxB,KAAKP,SAAS,IAAM,KAiChE,IAAIuG,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,UAyM9D,SAASC,EAAY3B,GAGnB,IAFA,IAAIS,EAAI,IAAIxG,MAAM+F,EAAIhE,aAEb4F,EAAM,EAAGA,EAAMnB,EAAEnG,OAAQsH,IAAO,CACvC,IAAIlB,EAAOkB,EAAM,GAAM,EACnBC,EAAOD,EAAM,GAEjBnB,EAAEmB,IAAQ5B,EAAIZ,MAAMsB,GAAQ,GAAKmB,KAAWA,EAG9C,OAAOpB,EAmWT,SAASqB,EAAYC,EAAM/B,EAAKgC,GAC9BA,EAAI7C,SAAWa,EAAIb,SAAW4C,EAAK5C,SACnC,IAAIpD,EAAOgG,EAAKzH,OAAS0F,EAAI1F,OAAU,EACvC0H,EAAI1H,OAASyB,EACbA,EAAOA,EAAM,EAAK,EAGlB,IAAIK,EAAoB,EAAhB2F,EAAK3C,MAAM,GACf6C,EAAmB,EAAfjC,EAAIZ,MAAM,GACdQ,EAAIxD,EAAI6F,EAERpH,EAAS,SAAJ+E,EACLsC,EAAStC,EAAI,SAAa,EAC9BoC,EAAI5C,MAAM,GAAKvE,EAEf,IAAK,IAAIiC,EAAI,EAAGA,EAAIf,EAAKe,IAAK,CAM5B,IAHA,IAAIqF,EAASD,IAAU,GACnBE,EAAgB,SAARF,EACRG,EAAOnG,KAAK2D,IAAI/C,EAAGkD,EAAI1F,OAAS,GAC3BkG,EAAItE,KAAKkB,IAAI,EAAGN,EAAIiF,EAAKzH,OAAS,GAAIkG,GAAK6B,EAAM7B,IAAK,CAC7D,IAAInG,EAAKyC,EAAI0D,EAAK,EAClBpE,EAAoB,EAAhB2F,EAAK3C,MAAM/E,GACf4H,EAAmB,EAAfjC,EAAIZ,MAAMoB,GACdZ,EAAIxD,EAAI6F,EAAIG,EACZD,GAAWvC,EAAI,SAAa,EAC5BwC,EAAY,SAAJxC,EAEVoC,EAAI5C,MAAMtC,GAAa,EAARsF,EACfF,EAAiB,EAATC,EAQV,OANc,IAAVD,EACFF,EAAI5C,MAAMtC,GAAa,EAARoF,EAEfF,EAAI1H,SAGC0H,EAAIzB,QAzlBbzB,EAAGlD,UAAUX,SAAW,SAAmB+D,EAAMsD,GAI/C,IAAIN,EACJ,GAJAhD,EAAOA,GAAQ,GACfsD,EAAoB,EAAVA,GAAe,EAGZ,KAATtD,GAAwB,QAATA,EAAgB,CACjCgD,EAAM,GAGN,IAFA,IAAItB,EAAM,EACNwB,EAAQ,EACH7H,EAAI,EAAGA,EAAImB,KAAKlB,OAAQD,IAAK,CACpC,IAAIoG,EAAIjF,KAAK4D,MAAM/E,GACfU,GAA+B,UAArB0F,GAAKC,EAAOwB,IAAmBjH,SAAS,IACtDiH,EAASzB,IAAO,GAAKC,EAAQ,SAE3BsB,EADY,IAAVE,GAAe7H,IAAMmB,KAAKlB,OAAS,EAC/BkH,EAAM,EAAIzG,EAAKT,QAAUS,EAAOiH,EAEhCjH,EAAOiH,EAEftB,GAAO,EACHA,GAAO,KACTA,GAAO,GACPrG,KAGU,IAAV6H,IACFF,EAAME,EAAMjH,SAAS,IAAM+G,GAE7B,MAAOA,EAAI1H,OAASgI,IAAY,EAC9BN,EAAM,IAAMA,EAKd,OAHsB,IAAlBxG,KAAK2D,WACP6C,EAAM,IAAMA,GAEPA,EAGT,GAAIhD,KAAiB,EAAPA,IAAaA,GAAQ,GAAKA,GAAQ,GAAI,CAElD,IAAIuD,EAAYd,EAAWzC,GAEvBwD,EAAYd,EAAW1C,GAC3BgD,EAAM,GACN,IAAItH,EAAIc,KAAK4F,QACb1G,EAAEyE,SAAW,EACb,OAAQzE,EAAE+H,SAAU,CAClB,IAAI7C,EAAIlF,EAAEgI,KAAKF,GAAWvH,SAAS+D,GACnCtE,EAAIA,EAAEiI,MAAMH,GAKVR,EAHGtH,EAAE+H,SAGC7C,EAAIoC,EAFJR,EAAMe,EAAY3C,EAAEtF,QAAUsF,EAAIoC,EAKxCxG,KAAKiH,WACPT,EAAM,IAAMA,GAEd,MAAOA,EAAI1H,OAASgI,IAAY,EAC9BN,EAAM,IAAMA,EAKd,OAHsB,IAAlBxG,KAAK2D,WACP6C,EAAM,IAAMA,GAEPA,EAGT3D,GAAO,EAAO,oCAGhBS,EAAGlD,UAAUgH,SAAW,WACtB,IAAIC,EAAMrH,KAAK4D,MAAM,GASrB,OARoB,IAAhB5D,KAAKlB,OACPuI,GAAuB,SAAhBrH,KAAK4D,MAAM,GACO,IAAhB5D,KAAKlB,QAAkC,IAAlBkB,KAAK4D,MAAM,GAEzCyD,GAAO,iBAAoC,SAAhBrH,KAAK4D,MAAM,GAC7B5D,KAAKlB,OAAS,GACvB+D,GAAO,EAAO,8CAEU,IAAlB7C,KAAK2D,UAAmB0D,EAAMA,GAGxC/D,EAAGlD,UAAUkH,OAAS,WACpB,OAAOtH,KAAKP,SAAS,KAGvB6D,EAAGlD,UAAUmH,SAAW,SAAmB9D,EAAQ3E,GAEjD,OADA+D,EAAyB,qBAAXiB,GACP9D,KAAKwH,YAAY1D,EAAQL,EAAQ3E,IAG1CwE,EAAGlD,UAAU9B,QAAU,SAAkBmF,EAAQ3E,GAC/C,OAAOkB,KAAKwH,YAAY/I,MAAOgF,EAAQ3E,IAGzCwE,EAAGlD,UAAUoH,YAAc,SAAsBC,EAAWhE,EAAQ3E,GAClE,IAAI4I,EAAa1H,KAAK0H,aAClBC,EAAY7I,GAAU4B,KAAKkB,IAAI,EAAG8F,GACtC7E,EAAO6E,GAAcC,EAAW,yCAChC9E,EAAO8E,EAAY,EAAG,+BAEtB3H,KAAK+E,QACL,IAGI0B,EAAG5H,EAHH+I,EAA0B,OAAXnE,EACf7E,EAAM,IAAI6I,EAAUE,GAGpBE,EAAI7H,KAAK4F,QACb,GAAKgC,EAYE,CACL,IAAK/I,EAAI,GAAIgJ,EAAEZ,SAAUpI,IACvB4H,EAAIoB,EAAEC,MAAM,KACZD,EAAEE,OAAO,GAETnJ,EAAIC,GAAK4H,EAGX,KAAO5H,EAAI8I,EAAW9I,IACpBD,EAAIC,GAAK,MArBM,CAEjB,IAAKA,EAAI,EAAGA,EAAI8I,EAAYD,EAAY7I,IACtCD,EAAIC,GAAK,EAGX,IAAKA,EAAI,GAAIgJ,EAAEZ,SAAUpI,IACvB4H,EAAIoB,EAAEC,MAAM,KACZD,EAAEE,OAAO,GAETnJ,EAAI+I,EAAY9I,EAAI,GAAK4H,EAe7B,OAAO7H,GAGL8B,KAAKsH,MACP1E,EAAGlD,UAAU6H,WAAa,SAAqBhD,GAC7C,OAAO,GAAKvE,KAAKsH,MAAM/C,IAGzB3B,EAAGlD,UAAU6H,WAAa,SAAqBhD,GAC7C,IAAIiD,EAAIjD,EACJb,EAAI,EAiBR,OAhBI8D,GAAK,OACP9D,GAAK,GACL8D,KAAO,IAELA,GAAK,KACP9D,GAAK,EACL8D,KAAO,GAELA,GAAK,IACP9D,GAAK,EACL8D,KAAO,GAELA,GAAK,IACP9D,GAAK,EACL8D,KAAO,GAEF9D,EAAI8D,GAIf5E,EAAGlD,UAAU+H,UAAY,SAAoBlD,GAE3C,GAAU,IAANA,EAAS,OAAO,GAEpB,IAAIiD,EAAIjD,EACJb,EAAI,EAoBR,OAnBqB,KAAZ,KAAJ8D,KACH9D,GAAK,GACL8D,KAAO,IAEU,KAAV,IAAJA,KACH9D,GAAK,EACL8D,KAAO,GAES,KAAT,GAAJA,KACH9D,GAAK,EACL8D,KAAO,GAES,KAAT,EAAJA,KACH9D,GAAK,EACL8D,KAAO,GAES,KAAT,EAAJA,IACH9D,IAEKA,GAITd,EAAGlD,UAAUI,UAAY,WACvB,IAAIyE,EAAIjF,KAAK4D,MAAM5D,KAAKlB,OAAS,GAC7BM,EAAKY,KAAKiI,WAAWhD,GACzB,OAA2B,IAAnBjF,KAAKlB,OAAS,GAAUM,GAiBlCkE,EAAGlD,UAAUgI,SAAW,WACtB,GAAIpI,KAAKiH,SAAU,OAAO,EAG1B,IADA,IAAI7C,EAAI,EACCvF,EAAI,EAAGA,EAAImB,KAAKlB,OAAQD,IAAK,CACpC,IAAI4H,EAAIzG,KAAKmI,UAAUnI,KAAK4D,MAAM/E,IAElC,GADAuF,GAAKqC,EACK,KAANA,EAAU,MAEhB,OAAOrC,GAGTd,EAAGlD,UAAUsH,WAAa,WACxB,OAAOhH,KAAKC,KAAKX,KAAKQ,YAAc,IAGtC8C,EAAGlD,UAAUiI,OAAS,SAAiBC,GACrC,OAAsB,IAAlBtI,KAAK2D,SACA3D,KAAKuI,MAAMC,MAAMF,GAAOG,MAAM,GAEhCzI,KAAK4F,SAGdtC,EAAGlD,UAAUsI,SAAW,SAAmBJ,GACzC,OAAItI,KAAKgC,MAAMsG,EAAQ,GACdtI,KAAK2I,KAAKL,GAAOG,MAAM,GAAGG,OAE5B5I,KAAK4F,SAGdtC,EAAGlD,UAAUyI,MAAQ,WACnB,OAAyB,IAAlB7I,KAAK2D,UAIdL,EAAGlD,UAAU0I,IAAM,WACjB,OAAO9I,KAAK4F,QAAQgD,QAGtBtF,EAAGlD,UAAUwI,KAAO,WAKlB,OAJK5I,KAAKiH,WACRjH,KAAK2D,UAAY,GAGZ3D,MAITsD,EAAGlD,UAAU2I,KAAO,SAAevE,GACjC,MAAOxE,KAAKlB,OAAS0F,EAAI1F,OACvBkB,KAAK4D,MAAM5D,KAAKlB,UAAY,EAG9B,IAAK,IAAID,EAAI,EAAGA,EAAI2F,EAAI1F,OAAQD,IAC9BmB,KAAK4D,MAAM/E,GAAKmB,KAAK4D,MAAM/E,GAAK2F,EAAIZ,MAAM/E,GAG5C,OAAOmB,KAAK+E,SAGdzB,EAAGlD,UAAU4I,IAAM,SAAcxE,GAE/B,OADA3B,EAA0C,KAAlC7C,KAAK2D,SAAWa,EAAIb,WACrB3D,KAAK+I,KAAKvE,IAInBlB,EAAGlD,UAAU6I,GAAK,SAAazE,GAC7B,OAAIxE,KAAKlB,OAAS0F,EAAI1F,OAAekB,KAAK4F,QAAQoD,IAAIxE,GAC/CA,EAAIoB,QAAQoD,IAAIhJ,OAGzBsD,EAAGlD,UAAU8I,IAAM,SAAc1E,GAC/B,OAAIxE,KAAKlB,OAAS0F,EAAI1F,OAAekB,KAAK4F,QAAQmD,KAAKvE,GAChDA,EAAIoB,QAAQmD,KAAK/I,OAI1BsD,EAAGlD,UAAU+I,MAAQ,SAAgB3E,GAEnC,IAAIiC,EAEFA,EADEzG,KAAKlB,OAAS0F,EAAI1F,OAChB0F,EAEAxE,KAGN,IAAK,IAAInB,EAAI,EAAGA,EAAI4H,EAAE3H,OAAQD,IAC5BmB,KAAK4D,MAAM/E,GAAKmB,KAAK4D,MAAM/E,GAAK2F,EAAIZ,MAAM/E,GAK5C,OAFAmB,KAAKlB,OAAS2H,EAAE3H,OAETkB,KAAK+E,SAGdzB,EAAGlD,UAAUgJ,KAAO,SAAe5E,GAEjC,OADA3B,EAA0C,KAAlC7C,KAAK2D,SAAWa,EAAIb,WACrB3D,KAAKmJ,MAAM3E,IAIpBlB,EAAGlD,UAAUiJ,IAAM,SAAc7E,GAC/B,OAAIxE,KAAKlB,OAAS0F,EAAI1F,OAAekB,KAAK4F,QAAQwD,KAAK5E,GAChDA,EAAIoB,QAAQwD,KAAKpJ,OAG1BsD,EAAGlD,UAAUkJ,KAAO,SAAe9E,GACjC,OAAIxE,KAAKlB,OAAS0F,EAAI1F,OAAekB,KAAK4F,QAAQuD,MAAM3E,GACjDA,EAAIoB,QAAQuD,MAAMnJ,OAI3BsD,EAAGlD,UAAUmJ,MAAQ,SAAgB/E,GAEnC,IAAI5D,EACA6F,EACAzG,KAAKlB,OAAS0F,EAAI1F,QACpB8B,EAAIZ,KACJyG,EAAIjC,IAEJ5D,EAAI4D,EACJiC,EAAIzG,MAGN,IAAK,IAAInB,EAAI,EAAGA,EAAI4H,EAAE3H,OAAQD,IAC5BmB,KAAK4D,MAAM/E,GAAK+B,EAAEgD,MAAM/E,GAAK4H,EAAE7C,MAAM/E,GAGvC,GAAImB,OAASY,EACX,KAAO/B,EAAI+B,EAAE9B,OAAQD,IACnBmB,KAAK4D,MAAM/E,GAAK+B,EAAEgD,MAAM/E,GAM5B,OAFAmB,KAAKlB,OAAS8B,EAAE9B,OAETkB,KAAK+E,SAGdzB,EAAGlD,UAAUoJ,KAAO,SAAehF,GAEjC,OADA3B,EAA0C,KAAlC7C,KAAK2D,SAAWa,EAAIb,WACrB3D,KAAKuJ,MAAM/E,IAIpBlB,EAAGlD,UAAUqJ,IAAM,SAAcjF,GAC/B,OAAIxE,KAAKlB,OAAS0F,EAAI1F,OAAekB,KAAK4F,QAAQ4D,KAAKhF,GAChDA,EAAIoB,QAAQ4D,KAAKxJ,OAG1BsD,EAAGlD,UAAUsJ,KAAO,SAAelF,GACjC,OAAIxE,KAAKlB,OAAS0F,EAAI1F,OAAekB,KAAK4F,QAAQ2D,MAAM/E,GACjDA,EAAIoB,QAAQ2D,MAAMvJ,OAI3BsD,EAAGlD,UAAUoI,MAAQ,SAAgBF,GACnCzF,EAAwB,kBAAVyF,GAAsBA,GAAS,GAE7C,IAAIqB,EAAsC,EAAxBjJ,KAAKC,KAAK2H,EAAQ,IAChCsB,EAAWtB,EAAQ,GAGvBtI,KAAK6F,QAAQ8D,GAETC,EAAW,GACbD,IAIF,IAAK,IAAI9K,EAAI,EAAGA,EAAI8K,EAAa9K,IAC/BmB,KAAK4D,MAAM/E,GAAsB,UAAhBmB,KAAK4D,MAAM/E,GAS9B,OALI+K,EAAW,IACb5J,KAAK4D,MAAM/E,IAAMmB,KAAK4D,MAAM/E,GAAM,UAAc,GAAK+K,GAIhD5J,KAAK+E,SAGdzB,EAAGlD,UAAUuI,KAAO,SAAeL,GACjC,OAAOtI,KAAK4F,QAAQ4C,MAAMF,IAI5BhF,EAAGlD,UAAUyJ,KAAO,SAAezD,EAAKtD,GACtCD,EAAsB,kBAARuD,GAAoBA,GAAO,GAEzC,IAAIlB,EAAOkB,EAAM,GAAM,EACnBC,EAAOD,EAAM,GAUjB,OARApG,KAAK6F,QAAQX,EAAM,GAGjBlF,KAAK4D,MAAMsB,GADTpC,EACgB9C,KAAK4D,MAAMsB,GAAQ,GAAKmB,EAExBrG,KAAK4D,MAAMsB,KAAS,GAAKmB,GAGtCrG,KAAK+E,SAIdzB,EAAGlD,UAAU0J,KAAO,SAAetF,GACjC,IAAIJ,EAkBAxD,EAAG6F,EAfP,GAAsB,IAAlBzG,KAAK2D,UAAmC,IAAjBa,EAAIb,SAI7B,OAHA3D,KAAK2D,SAAW,EAChBS,EAAIpE,KAAK+J,KAAKvF,GACdxE,KAAK2D,UAAY,EACV3D,KAAK8F,YAGP,GAAsB,IAAlB9F,KAAK2D,UAAmC,IAAjBa,EAAIb,SAIpC,OAHAa,EAAIb,SAAW,EACfS,EAAIpE,KAAK+J,KAAKvF,GACdA,EAAIb,SAAW,EACRS,EAAE0B,YAKP9F,KAAKlB,OAAS0F,EAAI1F,QACpB8B,EAAIZ,KACJyG,EAAIjC,IAEJ5D,EAAI4D,EACJiC,EAAIzG,MAIN,IADA,IAAI0G,EAAQ,EACH7H,EAAI,EAAGA,EAAI4H,EAAE3H,OAAQD,IAC5BuF,GAAkB,EAAbxD,EAAEgD,MAAM/E,KAAwB,EAAb4H,EAAE7C,MAAM/E,IAAU6H,EAC1C1G,KAAK4D,MAAM/E,GAAS,SAAJuF,EAChBsC,EAAQtC,IAAM,GAEhB,KAAiB,IAAVsC,GAAe7H,EAAI+B,EAAE9B,OAAQD,IAClCuF,GAAkB,EAAbxD,EAAEgD,MAAM/E,IAAU6H,EACvB1G,KAAK4D,MAAM/E,GAAS,SAAJuF,EAChBsC,EAAQtC,IAAM,GAIhB,GADApE,KAAKlB,OAAS8B,EAAE9B,OACF,IAAV4H,EACF1G,KAAK4D,MAAM5D,KAAKlB,QAAU4H,EAC1B1G,KAAKlB,cAEA,GAAI8B,IAAMZ,KACf,KAAOnB,EAAI+B,EAAE9B,OAAQD,IACnBmB,KAAK4D,MAAM/E,GAAK+B,EAAEgD,MAAM/E,GAI5B,OAAOmB,MAITsD,EAAGlD,UAAUgB,IAAM,SAAcoD,GAC/B,IAAI5F,EACJ,OAAqB,IAAjB4F,EAAIb,UAAoC,IAAlB3D,KAAK2D,UAC7Ba,EAAIb,SAAW,EACf/E,EAAMoB,KAAKmB,IAAIqD,GACfA,EAAIb,UAAY,EACT/E,GACmB,IAAjB4F,EAAIb,UAAoC,IAAlB3D,KAAK2D,UACpC3D,KAAK2D,SAAW,EAChB/E,EAAM4F,EAAIrD,IAAInB,MACdA,KAAK2D,SAAW,EACT/E,GAGLoB,KAAKlB,OAAS0F,EAAI1F,OAAekB,KAAK4F,QAAQkE,KAAKtF,GAEhDA,EAAIoB,QAAQkE,KAAK9J,OAI1BsD,EAAGlD,UAAU2J,KAAO,SAAevF,GAEjC,GAAqB,IAAjBA,EAAIb,SAAgB,CACtBa,EAAIb,SAAW,EACf,IAAIS,EAAIpE,KAAK8J,KAAKtF,GAElB,OADAA,EAAIb,SAAW,EACRS,EAAE0B,YAGJ,GAAsB,IAAlB9F,KAAK2D,SAId,OAHA3D,KAAK2D,SAAW,EAChB3D,KAAK8J,KAAKtF,GACVxE,KAAK2D,SAAW,EACT3D,KAAK8F,YAId,IAWIlF,EAAG6F,EAXH3F,EAAMd,KAAKc,IAAI0D,GAGnB,GAAY,IAAR1D,EAIF,OAHAd,KAAK2D,SAAW,EAChB3D,KAAKlB,OAAS,EACdkB,KAAK4D,MAAM,GAAK,EACT5D,KAKLc,EAAM,GACRF,EAAIZ,KACJyG,EAAIjC,IAEJ5D,EAAI4D,EACJiC,EAAIzG,MAIN,IADA,IAAI0G,EAAQ,EACH7H,EAAI,EAAGA,EAAI4H,EAAE3H,OAAQD,IAC5BuF,GAAkB,EAAbxD,EAAEgD,MAAM/E,KAAwB,EAAb4H,EAAE7C,MAAM/E,IAAU6H,EAC1CA,EAAQtC,GAAK,GACbpE,KAAK4D,MAAM/E,GAAS,SAAJuF,EAElB,KAAiB,IAAVsC,GAAe7H,EAAI+B,EAAE9B,OAAQD,IAClCuF,GAAkB,EAAbxD,EAAEgD,MAAM/E,IAAU6H,EACvBA,EAAQtC,GAAK,GACbpE,KAAK4D,MAAM/E,GAAS,SAAJuF,EAIlB,GAAc,IAAVsC,GAAe7H,EAAI+B,EAAE9B,QAAU8B,IAAMZ,KACvC,KAAOnB,EAAI+B,EAAE9B,OAAQD,IACnBmB,KAAK4D,MAAM/E,GAAK+B,EAAEgD,MAAM/E,GAU5B,OANAmB,KAAKlB,OAAS4B,KAAKkB,IAAI5B,KAAKlB,OAAQD,GAEhC+B,IAAMZ,OACRA,KAAK2D,SAAW,GAGX3D,KAAK+E,SAIdzB,EAAGlD,UAAUe,IAAM,SAAcqD,GAC/B,OAAOxE,KAAK4F,QAAQmE,KAAKvF,IA+C3B,IAAIwF,EAAc,SAAsBzD,EAAM/B,EAAKgC,GACjD,IAIInH,EACA4K,EACA7K,EANAwB,EAAI2F,EAAK3C,MACT6C,EAAIjC,EAAIZ,MACRsG,EAAI1D,EAAI5C,MACR1E,EAAI,EAIJiL,EAAY,EAAPvJ,EAAE,GACPwJ,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP1J,EAAE,GACP2J,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP7J,EAAE,GACP8J,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPhK,EAAE,GACPiK,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPnK,EAAE,GACPoK,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPtK,EAAE,GACPuK,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPzK,EAAE,GACP0K,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP5K,EAAE,GACP6K,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP/K,EAAE,GACPgL,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPlL,EAAE,GACPmL,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPxF,EAAE,GACPyF,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP3F,EAAE,GACP4F,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP9F,EAAE,GACP+F,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPjG,EAAE,GACPkG,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPpG,EAAE,GACPqG,EAAW,KAALD,EACNE,GAAMF,IAAO,GACbG,GAAY,EAAPvG,EAAE,GACPwG,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAP1G,EAAE,GACP2G,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAP7G,EAAE,GACP8G,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAPhH,EAAE,GACPiH,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAPnH,EAAE,GACPoH,GAAW,KAALD,GACNE,GAAMF,KAAO,GAEjBpH,EAAI7C,SAAW4C,EAAK5C,SAAWa,EAAIb,SACnC6C,EAAI1H,OAAS,GAEbO,EAAKqB,KAAKqN,KAAK3D,EAAK8B,GACpBjC,EAAMvJ,KAAKqN,KAAK3D,EAAK+B,GACrBlC,EAAOA,EAAMvJ,KAAKqN,KAAK1D,EAAK6B,GAAQ,EACpC9M,EAAKsB,KAAKqN,KAAK1D,EAAK8B,GACpB,IAAI6B,IAAQ9O,EAAIG,EAAM,KAAa,KAAN4K,IAAiB,IAAO,EACrD/K,GAAOE,GAAM6K,IAAQ,IAAO,IAAM+D,KAAO,IAAO,EAChDA,IAAM,SAEN3O,EAAKqB,KAAKqN,KAAKxD,EAAK2B,GACpBjC,EAAMvJ,KAAKqN,KAAKxD,EAAK4B,GACrBlC,EAAOA,EAAMvJ,KAAKqN,KAAKvD,EAAK0B,GAAQ,EACpC9M,EAAKsB,KAAKqN,KAAKvD,EAAK2B,GACpB9M,EAAMA,EAAKqB,KAAKqN,KAAK3D,EAAKiC,GAAQ,EAClCpC,EAAOA,EAAMvJ,KAAKqN,KAAK3D,EAAKkC,GAAQ,EACpCrC,EAAOA,EAAMvJ,KAAKqN,KAAK1D,EAAKgC,GAAQ,EACpCjN,EAAMA,EAAKsB,KAAKqN,KAAK1D,EAAKiC,GAAQ,EAClC,IAAI2B,IAAQ/O,EAAIG,EAAM,KAAa,KAAN4K,IAAiB,IAAO,EACrD/K,GAAOE,GAAM6K,IAAQ,IAAO,IAAMgE,KAAO,IAAO,EAChDA,IAAM,SAEN5O,EAAKqB,KAAKqN,KAAKrD,EAAKwB,GACpBjC,EAAMvJ,KAAKqN,KAAKrD,EAAKyB,GACrBlC,EAAOA,EAAMvJ,KAAKqN,KAAKpD,EAAKuB,GAAQ,EACpC9M,EAAKsB,KAAKqN,KAAKpD,EAAKwB,GACpB9M,EAAMA,EAAKqB,KAAKqN,KAAKxD,EAAK8B,GAAQ,EAClCpC,EAAOA,EAAMvJ,KAAKqN,KAAKxD,EAAK+B,GAAQ,EACpCrC,EAAOA,EAAMvJ,KAAKqN,KAAKvD,EAAK6B,GAAQ,EACpCjN,EAAMA,EAAKsB,KAAKqN,KAAKvD,EAAK8B,GAAQ,EAClCjN,EAAMA,EAAKqB,KAAKqN,KAAK3D,EAAKoC,GAAQ,EAClCvC,EAAOA,EAAMvJ,KAAKqN,KAAK3D,EAAKqC,GAAQ,EACpCxC,EAAOA,EAAMvJ,KAAKqN,KAAK1D,EAAKmC,GAAQ,EACpCpN,EAAMA,EAAKsB,KAAKqN,KAAK1D,EAAKoC,GAAQ,EAClC,IAAIyB,IAAQhP,EAAIG,EAAM,KAAa,KAAN4K,IAAiB,IAAO,EACrD/K,GAAOE,GAAM6K,IAAQ,IAAO,IAAMiE,KAAO,IAAO,EAChDA,IAAM,SAEN7O,EAAKqB,KAAKqN,KAAKlD,EAAKqB,GACpBjC,EAAMvJ,KAAKqN,KAAKlD,EAAKsB,GACrBlC,EAAOA,EAAMvJ,KAAKqN,KAAKjD,EAAKoB,GAAQ,EACpC9M,EAAKsB,KAAKqN,KAAKjD,EAAKqB,GACpB9M,EAAMA,EAAKqB,KAAKqN,KAAKrD,EAAK2B,GAAQ,EAClCpC,EAAOA,EAAMvJ,KAAKqN,KAAKrD,EAAK4B,GAAQ,EACpCrC,EAAOA,EAAMvJ,KAAKqN,KAAKpD,EAAK0B,GAAQ,EACpCjN,EAAMA,EAAKsB,KAAKqN,KAAKpD,EAAK2B,GAAQ,EAClCjN,EAAMA,EAAKqB,KAAKqN,KAAKxD,EAAKiC,GAAQ,EAClCvC,EAAOA,EAAMvJ,KAAKqN,KAAKxD,EAAKkC,GAAQ,EACpCxC,EAAOA,EAAMvJ,KAAKqN,KAAKvD,EAAKgC,GAAQ,EACpCpN,EAAMA,EAAKsB,KAAKqN,KAAKvD,EAAKiC,GAAQ,EAClCpN,EAAMA,EAAKqB,KAAKqN,KAAK3D,EAAKuC,GAAQ,EAClC1C,EAAOA,EAAMvJ,KAAKqN,KAAK3D,EAAKwC,GAAQ,EACpC3C,EAAOA,EAAMvJ,KAAKqN,KAAK1D,EAAKsC,GAAQ,EACpCvN,EAAMA,EAAKsB,KAAKqN,KAAK1D,EAAKuC,GAAQ,EAClC,IAAIuB,IAAQjP,EAAIG,EAAM,KAAa,KAAN4K,IAAiB,IAAO,EACrD/K,GAAOE,GAAM6K,IAAQ,IAAO,IAAMkE,KAAO,IAAO,EAChDA,IAAM,SAEN9O,EAAKqB,KAAKqN,KAAK/C,EAAKkB,GACpBjC,EAAMvJ,KAAKqN,KAAK/C,EAAKmB,GACrBlC,EAAOA,EAAMvJ,KAAKqN,KAAK9C,EAAKiB,GAAQ,EACpC9M,EAAKsB,KAAKqN,KAAK9C,EAAKkB,GACpB9M,EAAMA,EAAKqB,KAAKqN,KAAKlD,EAAKwB,GAAQ,EAClCpC,EAAOA,EAAMvJ,KAAKqN,KAAKlD,EAAKyB,GAAQ,EACpCrC,EAAOA,EAAMvJ,KAAKqN,KAAKjD,EAAKuB,GAAQ,EACpCjN,EAAMA,EAAKsB,KAAKqN,KAAKjD,EAAKwB,GAAQ,EAClCjN,EAAMA,EAAKqB,KAAKqN,KAAKrD,EAAK8B,GAAQ,EAClCvC,EAAOA,EAAMvJ,KAAKqN,KAAKrD,EAAK+B,GAAQ,EACpCxC,EAAOA,EAAMvJ,KAAKqN,KAAKpD,EAAK6B,GAAQ,EACpCpN,EAAMA,EAAKsB,KAAKqN,KAAKpD,EAAK8B,GAAQ,EAClCpN,EAAMA,EAAKqB,KAAKqN,KAAKxD,EAAKoC,GAAQ,EAClC1C,EAAOA,EAAMvJ,KAAKqN,KAAKxD,EAAKqC,GAAQ,EACpC3C,EAAOA,EAAMvJ,KAAKqN,KAAKvD,EAAKmC,GAAQ,EACpCvN,EAAMA,EAAKsB,KAAKqN,KAAKvD,EAAKoC,GAAQ,EAClCvN,EAAMA,EAAKqB,KAAKqN,KAAK3D,EAAK0C,GAAQ,EAClC7C,EAAOA,EAAMvJ,KAAKqN,KAAK3D,EAAK2C,IAAQ,EACpC9C,EAAOA,EAAMvJ,KAAKqN,KAAK1D,EAAKyC,GAAQ,EACpC1N,EAAMA,EAAKsB,KAAKqN,KAAK1D,EAAK0C,IAAQ,EAClC,IAAIqB,IAAQlP,EAAIG,EAAM,KAAa,KAAN4K,IAAiB,IAAO,EACrD/K,GAAOE,GAAM6K,IAAQ,IAAO,IAAMmE,KAAO,IAAO,EAChDA,IAAM,SAEN/O,EAAKqB,KAAKqN,KAAK5C,EAAKe,GACpBjC,EAAMvJ,KAAKqN,KAAK5C,EAAKgB,GACrBlC,EAAOA,EAAMvJ,KAAKqN,KAAK3C,EAAKc,GAAQ,EACpC9M,EAAKsB,KAAKqN,KAAK3C,EAAKe,GACpB9M,EAAMA,EAAKqB,KAAKqN,KAAK/C,EAAKqB,GAAQ,EAClCpC,EAAOA,EAAMvJ,KAAKqN,KAAK/C,EAAKsB,GAAQ,EACpCrC,EAAOA,EAAMvJ,KAAKqN,KAAK9C,EAAKoB,GAAQ,EACpCjN,EAAMA,EAAKsB,KAAKqN,KAAK9C,EAAKqB,GAAQ,EAClCjN,EAAMA,EAAKqB,KAAKqN,KAAKlD,EAAK2B,GAAQ,EAClCvC,EAAOA,EAAMvJ,KAAKqN,KAAKlD,EAAK4B,GAAQ,EACpCxC,EAAOA,EAAMvJ,KAAKqN,KAAKjD,EAAK0B,GAAQ,EACpCpN,EAAMA,EAAKsB,KAAKqN,KAAKjD,EAAK2B,GAAQ,EAClCpN,EAAMA,EAAKqB,KAAKqN,KAAKrD,EAAKiC,GAAQ,EAClC1C,EAAOA,EAAMvJ,KAAKqN,KAAKrD,EAAKkC,GAAQ,EACpC3C,EAAOA,EAAMvJ,KAAKqN,KAAKpD,EAAKgC,GAAQ,EACpCvN,EAAMA,EAAKsB,KAAKqN,KAAKpD,EAAKiC,GAAQ,EAClCvN,EAAMA,EAAKqB,KAAKqN,KAAKxD,EAAKuC,GAAQ,EAClC7C,EAAOA,EAAMvJ,KAAKqN,KAAKxD,EAAKwC,IAAQ,EACpC9C,EAAOA,EAAMvJ,KAAKqN,KAAKvD,EAAKsC,GAAQ,EACpC1N,EAAMA,EAAKsB,KAAKqN,KAAKvD,EAAKuC,IAAQ,EAClC1N,EAAMA,EAAKqB,KAAKqN,KAAK3D,EAAK6C,IAAQ,EAClChD,EAAOA,EAAMvJ,KAAKqN,KAAK3D,EAAK8C,IAAQ,EACpCjD,EAAOA,EAAMvJ,KAAKqN,KAAK1D,EAAK4C,IAAQ,EACpC7N,EAAMA,EAAKsB,KAAKqN,KAAK1D,EAAK6C,IAAQ,EAClC,IAAImB,IAAQnP,EAAIG,EAAM,KAAa,KAAN4K,IAAiB,IAAO,EACrD/K,GAAOE,GAAM6K,IAAQ,IAAO,IAAMoE,KAAO,IAAO,EAChDA,IAAM,SAENhP,EAAKqB,KAAKqN,KAAKzC,EAAKY,GACpBjC,EAAMvJ,KAAKqN,KAAKzC,EAAKa,GACrBlC,EAAOA,EAAMvJ,KAAKqN,KAAKxC,EAAKW,GAAQ,EACpC9M,EAAKsB,KAAKqN,KAAKxC,EAAKY,GACpB9M,EAAMA,EAAKqB,KAAKqN,KAAK5C,EAAKkB,GAAQ,EAClCpC,EAAOA,EAAMvJ,KAAKqN,KAAK5C,EAAKmB,GAAQ,EACpCrC,EAAOA,EAAMvJ,KAAKqN,KAAK3C,EAAKiB,GAAQ,EACpCjN,EAAMA,EAAKsB,KAAKqN,KAAK3C,EAAKkB,GAAQ,EAClCjN,EAAMA,EAAKqB,KAAKqN,KAAK/C,EAAKwB,GAAQ,EAClCvC,EAAOA,EAAMvJ,KAAKqN,KAAK/C,EAAKyB,GAAQ,EACpCxC,EAAOA,EAAMvJ,KAAKqN,KAAK9C,EAAKuB,GAAQ,EACpCpN,EAAMA,EAAKsB,KAAKqN,KAAK9C,EAAKwB,GAAQ,EAClCpN,EAAMA,EAAKqB,KAAKqN,KAAKlD,EAAK8B,GAAQ,EAClC1C,EAAOA,EAAMvJ,KAAKqN,KAAKlD,EAAK+B,GAAQ,EACpC3C,EAAOA,EAAMvJ,KAAKqN,KAAKjD,EAAK6B,GAAQ,EACpCvN,EAAMA,EAAKsB,KAAKqN,KAAKjD,EAAK8B,GAAQ,EAClCvN,EAAMA,EAAKqB,KAAKqN,KAAKrD,EAAKoC,GAAQ,EAClC7C,EAAOA,EAAMvJ,KAAKqN,KAAKrD,EAAKqC,IAAQ,EACpC9C,EAAOA,EAAMvJ,KAAKqN,KAAKpD,EAAKmC,GAAQ,EACpC1N,EAAMA,EAAKsB,KAAKqN,KAAKpD,EAAKoC,IAAQ,EAClC1N,EAAMA,EAAKqB,KAAKqN,KAAKxD,EAAK0C,IAAQ,EAClChD,EAAOA,EAAMvJ,KAAKqN,KAAKxD,EAAK2C,IAAQ,EACpCjD,EAAOA,EAAMvJ,KAAKqN,KAAKvD,EAAKyC,IAAQ,EACpC7N,EAAMA,EAAKsB,KAAKqN,KAAKvD,EAAK0C,IAAQ,EAClC7N,EAAMA,EAAKqB,KAAKqN,KAAK3D,EAAKgD,IAAQ,EAClCnD,EAAOA,EAAMvJ,KAAKqN,KAAK3D,EAAKiD,IAAQ,EACpCpD,EAAOA,EAAMvJ,KAAKqN,KAAK1D,EAAK+C,IAAQ,EACpChO,EAAMA,EAAKsB,KAAKqN,KAAK1D,EAAKgD,IAAQ,EAClC,IAAIiB,IAAQpP,EAAIG,EAAM,KAAa,KAAN4K,IAAiB,IAAO,EACrD/K,GAAOE,GAAM6K,IAAQ,IAAO,IAAMqE,KAAO,IAAO,EAChDA,IAAM,SAENjP,EAAKqB,KAAKqN,KAAKtC,EAAKS,GACpBjC,EAAMvJ,KAAKqN,KAAKtC,EAAKU,GACrBlC,EAAOA,EAAMvJ,KAAKqN,KAAKrC,EAAKQ,GAAQ,EACpC9M,EAAKsB,KAAKqN,KAAKrC,EAAKS,GACpB9M,EAAMA,EAAKqB,KAAKqN,KAAKzC,EAAKe,GAAQ,EAClCpC,EAAOA,EAAMvJ,KAAKqN,KAAKzC,EAAKgB,GAAQ,EACpCrC,EAAOA,EAAMvJ,KAAKqN,KAAKxC,EAAKc,GAAQ,EACpCjN,EAAMA,EAAKsB,KAAKqN,KAAKxC,EAAKe,GAAQ,EAClCjN,EAAMA,EAAKqB,KAAKqN,KAAK5C,EAAKqB,GAAQ,EAClCvC,EAAOA,EAAMvJ,KAAKqN,KAAK5C,EAAKsB,GAAQ,EACpCxC,EAAOA,EAAMvJ,KAAKqN,KAAK3C,EAAKoB,GAAQ,EACpCpN,EAAMA,EAAKsB,KAAKqN,KAAK3C,EAAKqB,GAAQ,EAClCpN,EAAMA,EAAKqB,KAAKqN,KAAK/C,EAAK2B,GAAQ,EAClC1C,EAAOA,EAAMvJ,KAAKqN,KAAK/C,EAAK4B,GAAQ,EACpC3C,EAAOA,EAAMvJ,KAAKqN,KAAK9C,EAAK0B,GAAQ,EACpCvN,EAAMA,EAAKsB,KAAKqN,KAAK9C,EAAK2B,GAAQ,EAClCvN,EAAMA,EAAKqB,KAAKqN,KAAKlD,EAAKiC,GAAQ,EAClC7C,EAAOA,EAAMvJ,KAAKqN,KAAKlD,EAAKkC,IAAQ,EACpC9C,EAAOA,EAAMvJ,KAAKqN,KAAKjD,EAAKgC,GAAQ,EACpC1N,EAAMA,EAAKsB,KAAKqN,KAAKjD,EAAKiC,IAAQ,EAClC1N,EAAMA,EAAKqB,KAAKqN,KAAKrD,EAAKuC,IAAQ,EAClChD,EAAOA,EAAMvJ,KAAKqN,KAAKrD,EAAKwC,IAAQ,EACpCjD,EAAOA,EAAMvJ,KAAKqN,KAAKpD,EAAKsC,IAAQ,EACpC7N,EAAMA,EAAKsB,KAAKqN,KAAKpD,EAAKuC,IAAQ,EAClC7N,EAAMA,EAAKqB,KAAKqN,KAAKxD,EAAK6C,IAAQ,EAClCnD,EAAOA,EAAMvJ,KAAKqN,KAAKxD,EAAK8C,IAAQ,EACpCpD,EAAOA,EAAMvJ,KAAKqN,KAAKvD,EAAK4C,IAAQ,EACpChO,EAAMA,EAAKsB,KAAKqN,KAAKvD,EAAK6C,IAAQ,EAClChO,EAAMA,EAAKqB,KAAKqN,KAAK3D,EAAKmD,IAAQ,EAClCtD,EAAOA,EAAMvJ,KAAKqN,KAAK3D,EAAKoD,IAAQ,EACpCvD,EAAOA,EAAMvJ,KAAKqN,KAAK1D,EAAKkD,IAAQ,EACpCnO,EAAMA,EAAKsB,KAAKqN,KAAK1D,EAAKmD,IAAQ,EAClC,IAAIe,IAAQrP,EAAIG,EAAM,KAAa,KAAN4K,IAAiB,IAAO,EACrD/K,GAAOE,GAAM6K,IAAQ,IAAO,IAAMsE,KAAO,IAAO,EAChDA,IAAM,SAENlP,EAAKqB,KAAKqN,KAAKnC,EAAKM,GACpBjC,EAAMvJ,KAAKqN,KAAKnC,EAAKO,GACrBlC,EAAOA,EAAMvJ,KAAKqN,KAAKlC,EAAKK,GAAQ,EACpC9M,EAAKsB,KAAKqN,KAAKlC,EAAKM,GACpB9M,EAAMA,EAAKqB,KAAKqN,KAAKtC,EAAKY,GAAQ,EAClCpC,EAAOA,EAAMvJ,KAAKqN,KAAKtC,EAAKa,GAAQ,EACpCrC,EAAOA,EAAMvJ,KAAKqN,KAAKrC,EAAKW,GAAQ,EACpCjN,EAAMA,EAAKsB,KAAKqN,KAAKrC,EAAKY,GAAQ,EAClCjN,EAAMA,EAAKqB,KAAKqN,KAAKzC,EAAKkB,GAAQ,EAClCvC,EAAOA,EAAMvJ,KAAKqN,KAAKzC,EAAKmB,GAAQ,EACpCxC,EAAOA,EAAMvJ,KAAKqN,KAAKxC,EAAKiB,GAAQ,EACpCpN,EAAMA,EAAKsB,KAAKqN,KAAKxC,EAAKkB,GAAQ,EAClCpN,EAAMA,EAAKqB,KAAKqN,KAAK5C,EAAKwB,GAAQ,EAClC1C,EAAOA,EAAMvJ,KAAKqN,KAAK5C,EAAKyB,GAAQ,EACpC3C,EAAOA,EAAMvJ,KAAKqN,KAAK3C,EAAKuB,GAAQ,EACpCvN,EAAMA,EAAKsB,KAAKqN,KAAK3C,EAAKwB,GAAQ,EAClCvN,EAAMA,EAAKqB,KAAKqN,KAAK/C,EAAK8B,GAAQ,EAClC7C,EAAOA,EAAMvJ,KAAKqN,KAAK/C,EAAK+B,IAAQ,EACpC9C,EAAOA,EAAMvJ,KAAKqN,KAAK9C,EAAK6B,GAAQ,EACpC1N,EAAMA,EAAKsB,KAAKqN,KAAK9C,EAAK8B,IAAQ,EAClC1N,EAAMA,EAAKqB,KAAKqN,KAAKlD,EAAKoC,IAAQ,EAClChD,EAAOA,EAAMvJ,KAAKqN,KAAKlD,EAAKqC,IAAQ,EACpCjD,EAAOA,EAAMvJ,KAAKqN,KAAKjD,EAAKmC,IAAQ,EACpC7N,EAAMA,EAAKsB,KAAKqN,KAAKjD,EAAKoC,IAAQ,EAClC7N,EAAMA,EAAKqB,KAAKqN,KAAKrD,EAAK0C,IAAQ,EAClCnD,EAAOA,EAAMvJ,KAAKqN,KAAKrD,EAAK2C,IAAQ,EACpCpD,EAAOA,EAAMvJ,KAAKqN,KAAKpD,EAAKyC,IAAQ,EACpChO,EAAMA,EAAKsB,KAAKqN,KAAKpD,EAAK0C,IAAQ,EAClChO,EAAMA,EAAKqB,KAAKqN,KAAKxD,EAAKgD,IAAQ,EAClCtD,EAAOA,EAAMvJ,KAAKqN,KAAKxD,EAAKiD,IAAQ,EACpCvD,EAAOA,EAAMvJ,KAAKqN,KAAKvD,EAAK+C,IAAQ,EACpCnO,EAAMA,EAAKsB,KAAKqN,KAAKvD,EAAKgD,IAAQ,EAClCnO,EAAMA,EAAKqB,KAAKqN,KAAK3D,EAAKsD,IAAQ,EAClCzD,EAAOA,EAAMvJ,KAAKqN,KAAK3D,EAAKuD,IAAQ,EACpC1D,EAAOA,EAAMvJ,KAAKqN,KAAK1D,EAAKqD,IAAQ,EACpCtO,EAAMA,EAAKsB,KAAKqN,KAAK1D,EAAKsD,IAAQ,EAClC,IAAIa,IAAQtP,EAAIG,EAAM,KAAa,KAAN4K,IAAiB,IAAO,EACrD/K,GAAOE,GAAM6K,IAAQ,IAAO,IAAMuE,KAAO,IAAO,EAChDA,IAAM,SAENnP,EAAKqB,KAAKqN,KAAKhC,EAAKG,GACpBjC,EAAMvJ,KAAKqN,KAAKhC,EAAKI,GACrBlC,EAAOA,EAAMvJ,KAAKqN,KAAK/B,EAAKE,GAAQ,EACpC9M,EAAKsB,KAAKqN,KAAK/B,EAAKG,GACpB9M,EAAMA,EAAKqB,KAAKqN,KAAKnC,EAAKS,GAAQ,EAClCpC,EAAOA,EAAMvJ,KAAKqN,KAAKnC,EAAKU,GAAQ,EACpCrC,EAAOA,EAAMvJ,KAAKqN,KAAKlC,EAAKQ,GAAQ,EACpCjN,EAAMA,EAAKsB,KAAKqN,KAAKlC,EAAKS,GAAQ,EAClCjN,EAAMA,EAAKqB,KAAKqN,KAAKtC,EAAKe,GAAQ,EAClCvC,EAAOA,EAAMvJ,KAAKqN,KAAKtC,EAAKgB,GAAQ,EACpCxC,EAAOA,EAAMvJ,KAAKqN,KAAKrC,EAAKc,GAAQ,EACpCpN,EAAMA,EAAKsB,KAAKqN,KAAKrC,EAAKe,GAAQ,EAClCpN,EAAMA,EAAKqB,KAAKqN,KAAKzC,EAAKqB,GAAQ,EAClC1C,EAAOA,EAAMvJ,KAAKqN,KAAKzC,EAAKsB,GAAQ,EACpC3C,EAAOA,EAAMvJ,KAAKqN,KAAKxC,EAAKoB,GAAQ,EACpCvN,EAAMA,EAAKsB,KAAKqN,KAAKxC,EAAKqB,GAAQ,EAClCvN,EAAMA,EAAKqB,KAAKqN,KAAK5C,EAAK2B,GAAQ,EAClC7C,EAAOA,EAAMvJ,KAAKqN,KAAK5C,EAAK4B,IAAQ,EACpC9C,EAAOA,EAAMvJ,KAAKqN,KAAK3C,EAAK0B,GAAQ,EACpC1N,EAAMA,EAAKsB,KAAKqN,KAAK3C,EAAK2B,IAAQ,EAClC1N,EAAMA,EAAKqB,KAAKqN,KAAK/C,EAAKiC,IAAQ,EAClChD,EAAOA,EAAMvJ,KAAKqN,KAAK/C,EAAKkC,IAAQ,EACpCjD,EAAOA,EAAMvJ,KAAKqN,KAAK9C,EAAKgC,IAAQ,EACpC7N,EAAMA,EAAKsB,KAAKqN,KAAK9C,EAAKiC,IAAQ,EAClC7N,EAAMA,EAAKqB,KAAKqN,KAAKlD,EAAKuC,IAAQ,EAClCnD,EAAOA,EAAMvJ,KAAKqN,KAAKlD,EAAKwC,IAAQ,EACpCpD,EAAOA,EAAMvJ,KAAKqN,KAAKjD,EAAKsC,IAAQ,EACpChO,EAAMA,EAAKsB,KAAKqN,KAAKjD,EAAKuC,IAAQ,EAClChO,EAAMA,EAAKqB,KAAKqN,KAAKrD,EAAK6C,IAAQ,EAClCtD,EAAOA,EAAMvJ,KAAKqN,KAAKrD,EAAK8C,IAAQ,EACpCvD,EAAOA,EAAMvJ,KAAKqN,KAAKpD,EAAK4C,IAAQ,EACpCnO,EAAMA,EAAKsB,KAAKqN,KAAKpD,EAAK6C,IAAQ,EAClCnO,EAAMA,EAAKqB,KAAKqN,KAAKxD,EAAKmD,IAAQ,EAClCzD,EAAOA,EAAMvJ,KAAKqN,KAAKxD,EAAKoD,IAAQ,EACpC1D,EAAOA,EAAMvJ,KAAKqN,KAAKvD,EAAKkD,IAAQ,EACpCtO,EAAMA,EAAKsB,KAAKqN,KAAKvD,EAAKmD,IAAQ,EAClCtO,EAAMA,EAAKqB,KAAKqN,KAAK3D,EAAKyD,IAAQ,EAClC5D,EAAOA,EAAMvJ,KAAKqN,KAAK3D,EAAK0D,IAAQ,EACpC7D,EAAOA,EAAMvJ,KAAKqN,KAAK1D,EAAKwD,IAAQ,EACpCzO,EAAMA,EAAKsB,KAAKqN,KAAK1D,EAAKyD,IAAQ,EAClC,IAAIW,IAAQvP,EAAIG,EAAM,KAAa,KAAN4K,IAAiB,IAAO,EACrD/K,GAAOE,GAAM6K,IAAQ,IAAO,IAAMwE,KAAO,IAAO,EAChDA,IAAM,SAENpP,EAAKqB,KAAKqN,KAAKhC,EAAKM,GACpBpC,EAAMvJ,KAAKqN,KAAKhC,EAAKO,GACrBrC,EAAOA,EAAMvJ,KAAKqN,KAAK/B,EAAKK,GAAQ,EACpCjN,EAAKsB,KAAKqN,KAAK/B,EAAKM,GACpBjN,EAAMA,EAAKqB,KAAKqN,KAAKnC,EAAKY,GAAQ,EAClCvC,EAAOA,EAAMvJ,KAAKqN,KAAKnC,EAAKa,GAAQ,EACpCxC,EAAOA,EAAMvJ,KAAKqN,KAAKlC,EAAKW,GAAQ,EACpCpN,EAAMA,EAAKsB,KAAKqN,KAAKlC,EAAKY,GAAQ,EAClCpN,EAAMA,EAAKqB,KAAKqN,KAAKtC,EAAKkB,GAAQ,EAClC1C,EAAOA,EAAMvJ,KAAKqN,KAAKtC,EAAKmB,GAAQ,EACpC3C,EAAOA,EAAMvJ,KAAKqN,KAAKrC,EAAKiB,GAAQ,EACpCvN,EAAMA,EAAKsB,KAAKqN,KAAKrC,EAAKkB,GAAQ,EAClCvN,EAAMA,EAAKqB,KAAKqN,KAAKzC,EAAKwB,GAAQ,EAClC7C,EAAOA,EAAMvJ,KAAKqN,KAAKzC,EAAKyB,IAAQ,EACpC9C,EAAOA,EAAMvJ,KAAKqN,KAAKxC,EAAKuB,GAAQ,EACpC1N,EAAMA,EAAKsB,KAAKqN,KAAKxC,EAAKwB,IAAQ,EAClC1N,EAAMA,EAAKqB,KAAKqN,KAAK5C,EAAK8B,IAAQ,EAClChD,EAAOA,EAAMvJ,KAAKqN,KAAK5C,EAAK+B,IAAQ,EACpCjD,EAAOA,EAAMvJ,KAAKqN,KAAK3C,EAAK6B,IAAQ,EACpC7N,EAAMA,EAAKsB,KAAKqN,KAAK3C,EAAK8B,IAAQ,EAClC7N,EAAMA,EAAKqB,KAAKqN,KAAK/C,EAAKoC,IAAQ,EAClCnD,EAAOA,EAAMvJ,KAAKqN,KAAK/C,EAAKqC,IAAQ,EACpCpD,EAAOA,EAAMvJ,KAAKqN,KAAK9C,EAAKmC,IAAQ,EACpChO,EAAMA,EAAKsB,KAAKqN,KAAK9C,EAAKoC,IAAQ,EAClChO,EAAMA,EAAKqB,KAAKqN,KAAKlD,EAAK0C,IAAQ,EAClCtD,EAAOA,EAAMvJ,KAAKqN,KAAKlD,EAAK2C,IAAQ,EACpCvD,EAAOA,EAAMvJ,KAAKqN,KAAKjD,EAAKyC,IAAQ,EACpCnO,EAAMA,EAAKsB,KAAKqN,KAAKjD,EAAK0C,IAAQ,EAClCnO,EAAMA,EAAKqB,KAAKqN,KAAKrD,EAAKgD,IAAQ,EAClCzD,EAAOA,EAAMvJ,KAAKqN,KAAKrD,EAAKiD,IAAQ,EACpC1D,EAAOA,EAAMvJ,KAAKqN,KAAKpD,EAAK+C,IAAQ,EACpCtO,EAAMA,EAAKsB,KAAKqN,KAAKpD,EAAKgD,IAAQ,EAClCtO,EAAMA,EAAKqB,KAAKqN,KAAKxD,EAAKsD,IAAQ,EAClC5D,EAAOA,EAAMvJ,KAAKqN,KAAKxD,EAAKuD,IAAQ,EACpC7D,EAAOA,EAAMvJ,KAAKqN,KAAKvD,EAAKqD,IAAQ,EACpCzO,EAAMA,EAAKsB,KAAKqN,KAAKvD,EAAKsD,IAAQ,EAClC,IAAIY,IAASxP,EAAIG,EAAM,KAAa,KAAN4K,IAAiB,IAAO,EACtD/K,GAAOE,GAAM6K,IAAQ,IAAO,IAAMyE,KAAQ,IAAO,EACjDA,IAAO,SAEPrP,EAAKqB,KAAKqN,KAAKhC,EAAKS,GACpBvC,EAAMvJ,KAAKqN,KAAKhC,EAAKU,GACrBxC,EAAOA,EAAMvJ,KAAKqN,KAAK/B,EAAKQ,GAAQ,EACpCpN,EAAKsB,KAAKqN,KAAK/B,EAAKS,GACpBpN,EAAMA,EAAKqB,KAAKqN,KAAKnC,EAAKe,GAAQ,EAClC1C,EAAOA,EAAMvJ,KAAKqN,KAAKnC,EAAKgB,GAAQ,EACpC3C,EAAOA,EAAMvJ,KAAKqN,KAAKlC,EAAKc,GAAQ,EACpCvN,EAAMA,EAAKsB,KAAKqN,KAAKlC,EAAKe,GAAQ,EAClCvN,EAAMA,EAAKqB,KAAKqN,KAAKtC,EAAKqB,GAAQ,EAClC7C,EAAOA,EAAMvJ,KAAKqN,KAAKtC,EAAKsB,IAAQ,EACpC9C,EAAOA,EAAMvJ,KAAKqN,KAAKrC,EAAKoB,GAAQ,EACpC1N,EAAMA,EAAKsB,KAAKqN,KAAKrC,EAAKqB,IAAQ,EAClC1N,EAAMA,EAAKqB,KAAKqN,KAAKzC,EAAK2B,IAAQ,EAClChD,EAAOA,EAAMvJ,KAAKqN,KAAKzC,EAAK4B,IAAQ,EACpCjD,EAAOA,EAAMvJ,KAAKqN,KAAKxC,EAAK0B,IAAQ,EACpC7N,EAAMA,EAAKsB,KAAKqN,KAAKxC,EAAK2B,IAAQ,EAClC7N,EAAMA,EAAKqB,KAAKqN,KAAK5C,EAAKiC,IAAQ,EAClCnD,EAAOA,EAAMvJ,KAAKqN,KAAK5C,EAAKkC,IAAQ,EACpCpD,EAAOA,EAAMvJ,KAAKqN,KAAK3C,EAAKgC,IAAQ,EACpChO,EAAMA,EAAKsB,KAAKqN,KAAK3C,EAAKiC,IAAQ,EAClChO,EAAMA,EAAKqB,KAAKqN,KAAK/C,EAAKuC,IAAQ,EAClCtD,EAAOA,EAAMvJ,KAAKqN,KAAK/C,EAAKwC,IAAQ,EACpCvD,EAAOA,EAAMvJ,KAAKqN,KAAK9C,EAAKsC,IAAQ,EACpCnO,EAAMA,EAAKsB,KAAKqN,KAAK9C,EAAKuC,IAAQ,EAClCnO,EAAMA,EAAKqB,KAAKqN,KAAKlD,EAAK6C,IAAQ,EAClCzD,EAAOA,EAAMvJ,KAAKqN,KAAKlD,EAAK8C,IAAQ,EACpC1D,EAAOA,EAAMvJ,KAAKqN,KAAKjD,EAAK4C,IAAQ,EACpCtO,EAAMA,EAAKsB,KAAKqN,KAAKjD,EAAK6C,IAAQ,EAClCtO,EAAMA,EAAKqB,KAAKqN,KAAKrD,EAAKmD,IAAQ,EAClC5D,EAAOA,EAAMvJ,KAAKqN,KAAKrD,EAAKoD,IAAQ,EACpC7D,EAAOA,EAAMvJ,KAAKqN,KAAKpD,EAAKkD,IAAQ,EACpCzO,EAAMA,EAAKsB,KAAKqN,KAAKpD,EAAKmD,IAAQ,EAClC,IAAIa,IAASzP,EAAIG,EAAM,KAAa,KAAN4K,IAAiB,IAAO,EACtD/K,GAAOE,GAAM6K,IAAQ,IAAO,IAAM0E,KAAQ,IAAO,EACjDA,IAAO,SAEPtP,EAAKqB,KAAKqN,KAAKhC,EAAKY,GACpB1C,EAAMvJ,KAAKqN,KAAKhC,EAAKa,GACrB3C,EAAOA,EAAMvJ,KAAKqN,KAAK/B,EAAKW,GAAQ,EACpCvN,EAAKsB,KAAKqN,KAAK/B,EAAKY,GACpBvN,EAAMA,EAAKqB,KAAKqN,KAAKnC,EAAKkB,GAAQ,EAClC7C,EAAOA,EAAMvJ,KAAKqN,KAAKnC,EAAKmB,IAAQ,EACpC9C,EAAOA,EAAMvJ,KAAKqN,KAAKlC,EAAKiB,GAAQ,EACpC1N,EAAMA,EAAKsB,KAAKqN,KAAKlC,EAAKkB,IAAQ,EAClC1N,EAAMA,EAAKqB,KAAKqN,KAAKtC,EAAKwB,IAAQ,EAClChD,EAAOA,EAAMvJ,KAAKqN,KAAKtC,EAAKyB,IAAQ,EACpCjD,EAAOA,EAAMvJ,KAAKqN,KAAKrC,EAAKuB,IAAQ,EACpC7N,EAAMA,EAAKsB,KAAKqN,KAAKrC,EAAKwB,IAAQ,EAClC7N,EAAMA,EAAKqB,KAAKqN,KAAKzC,EAAK8B,IAAQ,EAClCnD,EAAOA,EAAMvJ,KAAKqN,KAAKzC,EAAK+B,IAAQ,EACpCpD,EAAOA,EAAMvJ,KAAKqN,KAAKxC,EAAK6B,IAAQ,EACpChO,EAAMA,EAAKsB,KAAKqN,KAAKxC,EAAK8B,IAAQ,EAClChO,EAAMA,EAAKqB,KAAKqN,KAAK5C,EAAKoC,IAAQ,EAClCtD,EAAOA,EAAMvJ,KAAKqN,KAAK5C,EAAKqC,IAAQ,EACpCvD,EAAOA,EAAMvJ,KAAKqN,KAAK3C,EAAKmC,IAAQ,EACpCnO,EAAMA,EAAKsB,KAAKqN,KAAK3C,EAAKoC,IAAQ,EAClCnO,EAAMA,EAAKqB,KAAKqN,KAAK/C,EAAK0C,IAAQ,EAClCzD,EAAOA,EAAMvJ,KAAKqN,KAAK/C,EAAK2C,IAAQ,EACpC1D,EAAOA,EAAMvJ,KAAKqN,KAAK9C,EAAKyC,IAAQ,EACpCtO,EAAMA,EAAKsB,KAAKqN,KAAK9C,EAAK0C,IAAQ,EAClCtO,EAAMA,EAAKqB,KAAKqN,KAAKlD,EAAKgD,IAAQ,EAClC5D,EAAOA,EAAMvJ,KAAKqN,KAAKlD,EAAKiD,IAAQ,EACpC7D,EAAOA,EAAMvJ,KAAKqN,KAAKjD,EAAK+C,IAAQ,EACpCzO,EAAMA,EAAKsB,KAAKqN,KAAKjD,EAAKgD,IAAQ,EAClC,IAAIc,IAAS1P,EAAIG,EAAM,KAAa,KAAN4K,IAAiB,IAAO,EACtD/K,GAAOE,GAAM6K,IAAQ,IAAO,IAAM2E,KAAQ,IAAO,EACjDA,IAAO,SAEPvP,EAAKqB,KAAKqN,KAAKhC,EAAKe,GACpB7C,EAAMvJ,KAAKqN,KAAKhC,EAAKgB,IACrB9C,EAAOA,EAAMvJ,KAAKqN,KAAK/B,EAAKc,GAAQ,EACpC1N,EAAKsB,KAAKqN,KAAK/B,EAAKe,IACpB1N,EAAMA,EAAKqB,KAAKqN,KAAKnC,EAAKqB,IAAQ,EAClChD,EAAOA,EAAMvJ,KAAKqN,KAAKnC,EAAKsB,IAAQ,EACpCjD,EAAOA,EAAMvJ,KAAKqN,KAAKlC,EAAKoB,IAAQ,EACpC7N,EAAMA,EAAKsB,KAAKqN,KAAKlC,EAAKqB,IAAQ,EAClC7N,EAAMA,EAAKqB,KAAKqN,KAAKtC,EAAK2B,IAAQ,EAClCnD,EAAOA,EAAMvJ,KAAKqN,KAAKtC,EAAK4B,IAAQ,EACpCpD,EAAOA,EAAMvJ,KAAKqN,KAAKrC,EAAK0B,IAAQ,EACpChO,EAAMA,EAAKsB,KAAKqN,KAAKrC,EAAK2B,IAAQ,EAClChO,EAAMA,EAAKqB,KAAKqN,KAAKzC,EAAKiC,IAAQ,EAClCtD,EAAOA,EAAMvJ,KAAKqN,KAAKzC,EAAKkC,IAAQ,EACpCvD,EAAOA,EAAMvJ,KAAKqN,KAAKxC,EAAKgC,IAAQ,EACpCnO,EAAMA,EAAKsB,KAAKqN,KAAKxC,EAAKiC,IAAQ,EAClCnO,EAAMA,EAAKqB,KAAKqN,KAAK5C,EAAKuC,IAAQ,EAClCzD,EAAOA,EAAMvJ,KAAKqN,KAAK5C,EAAKwC,IAAQ,EACpC1D,EAAOA,EAAMvJ,KAAKqN,KAAK3C,EAAKsC,IAAQ,EACpCtO,EAAMA,EAAKsB,KAAKqN,KAAK3C,EAAKuC,IAAQ,EAClCtO,EAAMA,EAAKqB,KAAKqN,KAAK/C,EAAK6C,IAAQ,EAClC5D,EAAOA,EAAMvJ,KAAKqN,KAAK/C,EAAK8C,IAAQ,EACpC7D,EAAOA,EAAMvJ,KAAKqN,KAAK9C,EAAK4C,IAAQ,EACpCzO,EAAMA,EAAKsB,KAAKqN,KAAK9C,EAAK6C,IAAQ,EAClC,IAAIe,IAAS3P,EAAIG,EAAM,KAAa,KAAN4K,IAAiB,IAAO,EACtD/K,GAAOE,GAAM6K,IAAQ,IAAO,IAAM4E,KAAQ,IAAO,EACjDA,IAAO,SAEPxP,EAAKqB,KAAKqN,KAAKhC,EAAKkB,IACpBhD,EAAMvJ,KAAKqN,KAAKhC,EAAKmB,IACrBjD,EAAOA,EAAMvJ,KAAKqN,KAAK/B,EAAKiB,IAAQ,EACpC7N,EAAKsB,KAAKqN,KAAK/B,EAAKkB,IACpB7N,EAAMA,EAAKqB,KAAKqN,KAAKnC,EAAKwB,IAAQ,EAClCnD,EAAOA,EAAMvJ,KAAKqN,KAAKnC,EAAKyB,IAAQ,EACpCpD,EAAOA,EAAMvJ,KAAKqN,KAAKlC,EAAKuB,IAAQ,EACpChO,EAAMA,EAAKsB,KAAKqN,KAAKlC,EAAKwB,IAAQ,EAClChO,EAAMA,EAAKqB,KAAKqN,KAAKtC,EAAK8B,IAAQ,EAClCtD,EAAOA,EAAMvJ,KAAKqN,KAAKtC,EAAK+B,IAAQ,EACpCvD,EAAOA,EAAMvJ,KAAKqN,KAAKrC,EAAK6B,IAAQ,EACpCnO,EAAMA,EAAKsB,KAAKqN,KAAKrC,EAAK8B,IAAQ,EAClCnO,EAAMA,EAAKqB,KAAKqN,KAAKzC,EAAKoC,IAAQ,EAClCzD,EAAOA,EAAMvJ,KAAKqN,KAAKzC,EAAKqC,IAAQ,EACpC1D,EAAOA,EAAMvJ,KAAKqN,KAAKxC,EAAKmC,IAAQ,EACpCtO,EAAMA,EAAKsB,KAAKqN,KAAKxC,EAAKoC,IAAQ,EAClCtO,EAAMA,EAAKqB,KAAKqN,KAAK5C,EAAK0C,IAAQ,EAClC5D,EAAOA,EAAMvJ,KAAKqN,KAAK5C,EAAK2C,IAAQ,EACpC7D,EAAOA,EAAMvJ,KAAKqN,KAAK3C,EAAKyC,IAAQ,EACpCzO,EAAMA,EAAKsB,KAAKqN,KAAK3C,EAAK0C,IAAQ,EAClC,IAAIgB,IAAS5P,EAAIG,EAAM,KAAa,KAAN4K,IAAiB,IAAO,EACtD/K,GAAOE,GAAM6K,IAAQ,IAAO,IAAM6E,KAAQ,IAAO,EACjDA,IAAO,SAEPzP,EAAKqB,KAAKqN,KAAKhC,EAAKqB,IACpBnD,EAAMvJ,KAAKqN,KAAKhC,EAAKsB,IACrBpD,EAAOA,EAAMvJ,KAAKqN,KAAK/B,EAAKoB,IAAQ,EACpChO,EAAKsB,KAAKqN,KAAK/B,EAAKqB,IACpBhO,EAAMA,EAAKqB,KAAKqN,KAAKnC,EAAK2B,IAAQ,EAClCtD,EAAOA,EAAMvJ,KAAKqN,KAAKnC,EAAK4B,IAAQ,EACpCvD,EAAOA,EAAMvJ,KAAKqN,KAAKlC,EAAK0B,IAAQ,EACpCnO,EAAMA,EAAKsB,KAAKqN,KAAKlC,EAAK2B,IAAQ,EAClCnO,EAAMA,EAAKqB,KAAKqN,KAAKtC,EAAKiC,IAAQ,EAClCzD,EAAOA,EAAMvJ,KAAKqN,KAAKtC,EAAKkC,IAAQ,EACpC1D,EAAOA,EAAMvJ,KAAKqN,KAAKrC,EAAKgC,IAAQ,EACpCtO,EAAMA,EAAKsB,KAAKqN,KAAKrC,EAAKiC,IAAQ,EAClCtO,EAAMA,EAAKqB,KAAKqN,KAAKzC,EAAKuC,IAAQ,EAClC5D,EAAOA,EAAMvJ,KAAKqN,KAAKzC,EAAKwC,IAAQ,EACpC7D,EAAOA,EAAMvJ,KAAKqN,KAAKxC,EAAKsC,IAAQ,EACpCzO,EAAMA,EAAKsB,KAAKqN,KAAKxC,EAAKuC,IAAQ,EAClC,IAAIiB,IAAS7P,EAAIG,EAAM,KAAa,KAAN4K,IAAiB,IAAO,EACtD/K,GAAOE,GAAM6K,IAAQ,IAAO,IAAM8E,KAAQ,IAAO,EACjDA,IAAO,SAEP1P,EAAKqB,KAAKqN,KAAKhC,EAAKwB,IACpBtD,EAAMvJ,KAAKqN,KAAKhC,EAAKyB,IACrBvD,EAAOA,EAAMvJ,KAAKqN,KAAK/B,EAAKuB,IAAQ,EACpCnO,EAAKsB,KAAKqN,KAAK/B,EAAKwB,IACpBnO,EAAMA,EAAKqB,KAAKqN,KAAKnC,EAAK8B,IAAQ,EAClCzD,EAAOA,EAAMvJ,KAAKqN,KAAKnC,EAAK+B,IAAQ,EACpC1D,EAAOA,EAAMvJ,KAAKqN,KAAKlC,EAAK6B,IAAQ,EACpCtO,EAAMA,EAAKsB,KAAKqN,KAAKlC,EAAK8B,IAAQ,EAClCtO,EAAMA,EAAKqB,KAAKqN,KAAKtC,EAAKoC,IAAQ,EAClC5D,EAAOA,EAAMvJ,KAAKqN,KAAKtC,EAAKqC,IAAQ,EACpC7D,EAAOA,EAAMvJ,KAAKqN,KAAKrC,EAAKmC,IAAQ,EACpCzO,EAAMA,EAAKsB,KAAKqN,KAAKrC,EAAKoC,IAAQ,EAClC,IAAIkB,IAAS9P,EAAIG,EAAM,KAAa,KAAN4K,IAAiB,IAAO,EACtD/K,GAAOE,GAAM6K,IAAQ,IAAO,IAAM+E,KAAQ,IAAO,EACjDA,IAAO,SAEP3P,EAAKqB,KAAKqN,KAAKhC,EAAK2B,IACpBzD,EAAMvJ,KAAKqN,KAAKhC,EAAK4B,IACrB1D,EAAOA,EAAMvJ,KAAKqN,KAAK/B,EAAK0B,IAAQ,EACpCtO,EAAKsB,KAAKqN,KAAK/B,EAAK2B,IACpBtO,EAAMA,EAAKqB,KAAKqN,KAAKnC,EAAKiC,IAAQ,EAClC5D,EAAOA,EAAMvJ,KAAKqN,KAAKnC,EAAKkC,IAAQ,EACpC7D,EAAOA,EAAMvJ,KAAKqN,KAAKlC,EAAKgC,IAAQ,EACpCzO,EAAMA,EAAKsB,KAAKqN,KAAKlC,EAAKiC,IAAQ,EAClC,IAAImB,IAAS/P,EAAIG,EAAM,KAAa,KAAN4K,IAAiB,IAAO,EACtD/K,GAAOE,GAAM6K,IAAQ,IAAO,IAAMgF,KAAQ,IAAO,EACjDA,IAAO,SAEP5P,EAAKqB,KAAKqN,KAAKhC,EAAK8B,IACpB5D,EAAMvJ,KAAKqN,KAAKhC,EAAK+B,IACrB7D,EAAOA,EAAMvJ,KAAKqN,KAAK/B,EAAK6B,IAAQ,EACpCzO,EAAKsB,KAAKqN,KAAK/B,EAAK8B,IACpB,IAAIoB,IAAShQ,EAAIG,EAAM,KAAa,KAAN4K,IAAiB,IAAO,EA0BtD,OAzBA/K,GAAOE,GAAM6K,IAAQ,IAAO,IAAMiF,KAAQ,IAAO,EACjDA,IAAO,SACPhF,EAAE,GAAK8D,GACP9D,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,IAANhQ,IACFgL,EAAE,IAAMhL,EACRsH,EAAI1H,UAEC0H,GAQT,SAAS2I,EAAU5I,EAAM/B,EAAKgC,GAC5BA,EAAI7C,SAAWa,EAAIb,SAAW4C,EAAK5C,SACnC6C,EAAI1H,OAASyH,EAAKzH,OAAS0F,EAAI1F,OAI/B,IAFA,IAAI4H,EAAQ,EACR0I,EAAU,EACL9N,EAAI,EAAGA,EAAIkF,EAAI1H,OAAS,EAAGwC,IAAK,CAGvC,IAAIqF,EAASyI,EACbA,EAAU,EAGV,IAFA,IAAIxI,EAAgB,SAARF,EACRG,EAAOnG,KAAK2D,IAAI/C,EAAGkD,EAAI1F,OAAS,GAC3BkG,EAAItE,KAAKkB,IAAI,EAAGN,EAAIiF,EAAKzH,OAAS,GAAIkG,GAAK6B,EAAM7B,IAAK,CAC7D,IAAInG,EAAIyC,EAAI0D,EACRpE,EAAoB,EAAhB2F,EAAK3C,MAAM/E,GACf4H,EAAmB,EAAfjC,EAAIZ,MAAMoB,GACdZ,EAAIxD,EAAI6F,EAERpH,EAAS,SAAJ+E,EACTuC,EAAUA,GAAWvC,EAAI,SAAa,GAAM,EAC5C/E,EAAMA,EAAKuH,EAAS,EACpBA,EAAa,SAALvH,EACRsH,EAAUA,GAAUtH,IAAO,IAAO,EAElC+P,GAAWzI,IAAW,GACtBA,GAAU,SAEZH,EAAI5C,MAAMtC,GAAKsF,EACfF,EAAQC,EACRA,EAASyI,EAQX,OANc,IAAV1I,EACFF,EAAI5C,MAAMtC,GAAKoF,EAEfF,EAAI1H,SAGC0H,EAAIzB,QAGb,SAASsK,EAAY9I,EAAM/B,EAAKgC,GAC9B,IAAI8I,EAAO,IAAIC,EACf,OAAOD,EAAKE,KAAKjJ,EAAM/B,EAAKgC,GAsB9B,SAAS+I,EAAMlN,EAAGoN,GAChBzP,KAAKqC,EAAIA,EACTrC,KAAKyP,EAAIA,EAvEN/O,KAAKqN,OACR/D,EAAc1D,GAiDhBhD,EAAGlD,UAAUsP,MAAQ,SAAgBlL,EAAKgC,GACxC,IAAI5H,EACA2B,EAAMP,KAAKlB,OAAS0F,EAAI1F,OAW5B,OATEF,EADkB,KAAhBoB,KAAKlB,QAAgC,KAAf0F,EAAI1F,OACtBkL,EAAYhK,KAAMwE,EAAKgC,GACpBjG,EAAM,GACT+F,EAAWtG,KAAMwE,EAAKgC,GACnBjG,EAAM,KACT4O,EAASnP,KAAMwE,EAAKgC,GAEpB6I,EAAWrP,KAAMwE,EAAKgC,GAGvB5H,GAWT2Q,EAAKnP,UAAUuP,QAAU,SAAkBC,GAGzC,IAFA,IAAI1H,EAAI,IAAIzJ,MAAMmR,GACdC,EAAIvM,EAAGlD,UAAU6H,WAAW2H,GAAK,EAC5B/Q,EAAI,EAAGA,EAAI+Q,EAAG/Q,IACrBqJ,EAAErJ,GAAKmB,KAAK8P,OAAOjR,EAAGgR,EAAGD,GAG3B,OAAO1H,GAITqH,EAAKnP,UAAU0P,OAAS,SAAiBzN,EAAGwN,EAAGD,GAC7C,GAAU,IAANvN,GAAWA,IAAMuN,EAAI,EAAG,OAAOvN,EAGnC,IADA,IAAI0N,EAAK,EACAlR,EAAI,EAAGA,EAAIgR,EAAGhR,IACrBkR,IAAW,EAAJ1N,IAAWwN,EAAIhR,EAAI,EAC1BwD,IAAM,EAGR,OAAO0N,GAKTR,EAAKnP,UAAU4P,QAAU,SAAkBC,EAAKC,EAAKC,EAAKC,EAAMC,EAAMT,GACpE,IAAK,IAAI/Q,EAAI,EAAGA,EAAI+Q,EAAG/Q,IACrBuR,EAAKvR,GAAKqR,EAAID,EAAIpR,IAClBwR,EAAKxR,GAAKsR,EAAIF,EAAIpR,KAItB0Q,EAAKnP,UAAUkQ,UAAY,SAAoBJ,EAAKC,EAAKC,EAAMC,EAAMT,EAAGK,GACtEjQ,KAAKgQ,QAAQC,EAAKC,EAAKC,EAAKC,EAAMC,EAAMT,GAExC,IAAK,IAAI7N,EAAI,EAAGA,EAAI6N,EAAG7N,IAAM,EAM3B,IALA,IAAI8N,EAAI9N,GAAK,EAETwO,EAAQ7P,KAAK8P,IAAI,EAAI9P,KAAK+P,GAAKZ,GAC/Ba,EAAQhQ,KAAKiQ,IAAI,EAAIjQ,KAAK+P,GAAKZ,GAE1Be,EAAI,EAAGA,EAAIhB,EAAGgB,GAAKf,EAI1B,IAHA,IAAIgB,EAASN,EACTO,EAASJ,EAEJ1L,EAAI,EAAGA,EAAIjD,EAAGiD,IAAK,CAC1B,IAAI+L,EAAKX,EAAKQ,EAAI5L,GACdgM,EAAKX,EAAKO,EAAI5L,GAEdiM,EAAKb,EAAKQ,EAAI5L,EAAIjD,GAClBmP,EAAKb,EAAKO,EAAI5L,EAAIjD,GAElBoP,EAAKN,EAASI,EAAKH,EAASI,EAEhCA,EAAKL,EAASK,EAAKJ,EAASG,EAC5BA,EAAKE,EAELf,EAAKQ,EAAI5L,GAAK+L,EAAKE,EACnBZ,EAAKO,EAAI5L,GAAKgM,EAAKE,EAEnBd,EAAKQ,EAAI5L,EAAIjD,GAAKgP,EAAKE,EACvBZ,EAAKO,EAAI5L,EAAIjD,GAAKiP,EAAKE,EAGnBlM,IAAM6K,IACRsB,EAAKZ,EAAQM,EAASH,EAAQI,EAE9BA,EAASP,EAAQO,EAASJ,EAAQG,EAClCA,EAASM,KAOnB5B,EAAKnP,UAAUgR,YAAc,SAAsB9Q,EAAG+Q,GACpD,IAAIzB,EAAqB,EAAjBlP,KAAKkB,IAAIyP,EAAG/Q,GAChBgR,EAAU,EAAJ1B,EACN/Q,EAAI,EACR,IAAK+Q,EAAIA,EAAI,EAAI,EAAGA,EAAGA,KAAU,EAC/B/Q,IAGF,OAAO,GAAKA,EAAI,EAAIyS,GAGtB/B,EAAKnP,UAAUmR,UAAY,SAAoBrB,EAAKC,EAAKP,GACvD,KAAIA,GAAK,GAET,IAAK,IAAI/Q,EAAI,EAAGA,EAAI+Q,EAAI,EAAG/Q,IAAK,CAC9B,IAAIqJ,EAAIgI,EAAIrR,GAEZqR,EAAIrR,GAAKqR,EAAIN,EAAI/Q,EAAI,GACrBqR,EAAIN,EAAI/Q,EAAI,GAAKqJ,EAEjBA,EAAIiI,EAAItR,GAERsR,EAAItR,IAAMsR,EAAIP,EAAI/Q,EAAI,GACtBsR,EAAIP,EAAI/Q,EAAI,IAAMqJ,IAItBqH,EAAKnP,UAAUoR,aAAe,SAAuBC,EAAI7B,GAEvD,IADA,IAAIlJ,EAAQ,EACH7H,EAAI,EAAGA,EAAI+Q,EAAI,EAAG/Q,IAAK,CAC9B,IAAIoG,EAAoC,KAAhCvE,KAAKgR,MAAMD,EAAG,EAAI5S,EAAI,GAAK+Q,GACjClP,KAAKgR,MAAMD,EAAG,EAAI5S,GAAK+Q,GACvBlJ,EAEF+K,EAAG5S,GAAS,SAAJoG,EAGNyB,EADEzB,EAAI,SACE,EAEAA,EAAI,SAAY,EAI5B,OAAOwM,GAGTlC,EAAKnP,UAAUuR,WAAa,SAAqBF,EAAIlR,EAAK2P,EAAKN,GAE7D,IADA,IAAIlJ,EAAQ,EACH7H,EAAI,EAAGA,EAAI0B,EAAK1B,IACvB6H,GAAyB,EAAR+K,EAAG5S,GAEpBqR,EAAI,EAAIrR,GAAa,KAAR6H,EAAgBA,KAAkB,GAC/CwJ,EAAI,EAAIrR,EAAI,GAAa,KAAR6H,EAAgBA,KAAkB,GAIrD,IAAK7H,EAAI,EAAI0B,EAAK1B,EAAI+Q,IAAK/Q,EACzBqR,EAAIrR,GAAK,EAGXgE,EAAiB,IAAV6D,GACP7D,EAA6B,MAAb,KAAR6D,KAGV6I,EAAKnP,UAAUwR,KAAO,SAAehC,GAEnC,IADA,IAAIiC,EAAK,IAAIpT,MAAMmR,GACV/Q,EAAI,EAAGA,EAAI+Q,EAAG/Q,IACrBgT,EAAGhT,GAAK,EAGV,OAAOgT,GAGTtC,EAAKnP,UAAUoP,KAAO,SAAenN,EAAGoN,EAAGjJ,GACzC,IAAIoJ,EAAI,EAAI5P,KAAKoR,YAAY/O,EAAEvD,OAAQ2Q,EAAE3Q,QAErCmR,EAAMjQ,KAAK2P,QAAQC,GAEnBkC,EAAI9R,KAAK4R,KAAKhC,GAEdM,EAAM,IAAIzR,MAAMmR,GAChBmC,EAAO,IAAItT,MAAMmR,GACjBoC,EAAO,IAAIvT,MAAMmR,GAEjBqC,EAAO,IAAIxT,MAAMmR,GACjBsC,EAAQ,IAAIzT,MAAMmR,GAClBuC,EAAQ,IAAI1T,MAAMmR,GAElBwC,EAAO5L,EAAI5C,MACfwO,EAAKtT,OAAS8Q,EAEd5P,KAAK2R,WAAWtP,EAAEuB,MAAOvB,EAAEvD,OAAQoR,EAAKN,GACxC5P,KAAK2R,WAAWlC,EAAE7L,MAAO6L,EAAE3Q,OAAQmT,EAAMrC,GAEzC5P,KAAKsQ,UAAUJ,EAAK4B,EAAGC,EAAMC,EAAMpC,EAAGK,GACtCjQ,KAAKsQ,UAAU2B,EAAMH,EAAGI,EAAOC,EAAOvC,EAAGK,GAEzC,IAAK,IAAIpR,EAAI,EAAGA,EAAI+Q,EAAG/Q,IAAK,CAC1B,IAAIsS,EAAKY,EAAKlT,GAAKqT,EAAMrT,GAAKmT,EAAKnT,GAAKsT,EAAMtT,GAC9CmT,EAAKnT,GAAKkT,EAAKlT,GAAKsT,EAAMtT,GAAKmT,EAAKnT,GAAKqT,EAAMrT,GAC/CkT,EAAKlT,GAAKsS,EAUZ,OAPAnR,KAAKuR,UAAUQ,EAAMC,EAAMpC,GAC3B5P,KAAKsQ,UAAUyB,EAAMC,EAAMI,EAAMN,EAAGlC,EAAGK,GACvCjQ,KAAKuR,UAAUa,EAAMN,EAAGlC,GACxB5P,KAAKwR,aAAaY,EAAMxC,GAExBpJ,EAAI7C,SAAWtB,EAAEsB,SAAW8L,EAAE9L,SAC9B6C,EAAI1H,OAASuD,EAAEvD,OAAS2Q,EAAE3Q,OACnB0H,EAAIzB,SAIbzB,EAAGlD,UAAUmE,IAAM,SAAcC,GAC/B,IAAIgC,EAAM,IAAIlD,EAAG,MAEjB,OADAkD,EAAI5C,MAAQ,IAAInF,MAAMuB,KAAKlB,OAAS0F,EAAI1F,QACjCkB,KAAK0P,MAAMlL,EAAKgC,IAIzBlD,EAAGlD,UAAUiS,KAAO,SAAe7N,GACjC,IAAIgC,EAAM,IAAIlD,EAAG,MAEjB,OADAkD,EAAI5C,MAAQ,IAAInF,MAAMuB,KAAKlB,OAAS0F,EAAI1F,QACjCuQ,EAAWrP,KAAMwE,EAAKgC,IAI/BlD,EAAGlD,UAAU2N,KAAO,SAAevJ,GACjC,OAAOxE,KAAK4F,QAAQ8J,MAAMlL,EAAKxE,OAGjCsD,EAAGlD,UAAUmF,MAAQ,SAAgBf,GACnC3B,EAAsB,kBAAR2B,GACd3B,EAAO2B,EAAM,UAIb,IADA,IAAIkC,EAAQ,EACH7H,EAAI,EAAGA,EAAImB,KAAKlB,OAAQD,IAAK,CACpC,IAAIoG,GAAqB,EAAhBjF,KAAK4D,MAAM/E,IAAU2F,EAC1BnF,GAAU,SAAJ4F,IAA0B,SAARyB,GAC5BA,IAAU,GACVA,GAAUzB,EAAI,SAAa,EAE3ByB,GAASrH,IAAO,GAChBW,KAAK4D,MAAM/E,GAAU,SAALQ,EAQlB,OALc,IAAVqH,IACF1G,KAAK4D,MAAM/E,GAAK6H,EAChB1G,KAAKlB,UAGAkB,MAGTsD,EAAGlD,UAAUkS,KAAO,SAAe9N,GACjC,OAAOxE,KAAK4F,QAAQL,MAAMf,IAI5BlB,EAAGlD,UAAUmS,IAAM,WACjB,OAAOvS,KAAKuE,IAAIvE,OAIlBsD,EAAGlD,UAAUoS,KAAO,WAClB,OAAOxS,KAAK+N,KAAK/N,KAAK4F,UAIxBtC,EAAGlD,UAAUqF,IAAM,SAAcjB,GAC/B,IAAIS,EAAIkB,EAAW3B,GACnB,GAAiB,IAAbS,EAAEnG,OAAc,OAAO,IAAIwE,EAAG,GAIlC,IADA,IAAI1E,EAAMoB,KACDnB,EAAI,EAAGA,EAAIoG,EAAEnG,OAAQD,IAAKD,EAAMA,EAAI2T,MAC3C,GAAa,IAATtN,EAAEpG,GAAU,MAGlB,KAAMA,EAAIoG,EAAEnG,OACV,IAAK,IAAI+I,EAAIjJ,EAAI2T,MAAO1T,EAAIoG,EAAEnG,OAAQD,IAAKgJ,EAAIA,EAAE0K,MAClC,IAATtN,EAAEpG,KAEND,EAAMA,EAAI2F,IAAIsD,IAIlB,OAAOjJ,GAIT0E,EAAGlD,UAAUqS,OAAS,SAAiBC,GACrC7P,EAAuB,kBAAT6P,GAAqBA,GAAQ,GAC3C,IAGI7T,EAHAuF,EAAIsO,EAAO,GACX3Q,GAAK2Q,EAAOtO,GAAK,GACjBuO,EAAa,WAAe,GAAKvO,GAAQ,GAAKA,EAGlD,GAAU,IAANA,EAAS,CACX,IAAIsC,EAAQ,EAEZ,IAAK7H,EAAI,EAAGA,EAAImB,KAAKlB,OAAQD,IAAK,CAChC,IAAI+T,EAAW5S,KAAK4D,MAAM/E,GAAK8T,EAC3BzT,GAAsB,EAAhBc,KAAK4D,MAAM/E,IAAU+T,GAAaxO,EAC5CpE,KAAK4D,MAAM/E,GAAKK,EAAIwH,EACpBA,EAAQkM,IAAc,GAAKxO,EAGzBsC,IACF1G,KAAK4D,MAAM/E,GAAK6H,EAChB1G,KAAKlB,UAIT,GAAU,IAANiD,EAAS,CACX,IAAKlD,EAAImB,KAAKlB,OAAS,EAAGD,GAAK,EAAGA,IAChCmB,KAAK4D,MAAM/E,EAAIkD,GAAK/B,KAAK4D,MAAM/E,GAGjC,IAAKA,EAAI,EAAGA,EAAIkD,EAAGlD,IACjBmB,KAAK4D,MAAM/E,GAAK,EAGlBmB,KAAKlB,QAAUiD,EAGjB,OAAO/B,KAAK+E,SAGdzB,EAAGlD,UAAUyS,MAAQ,SAAgBH,GAGnC,OADA7P,EAAyB,IAAlB7C,KAAK2D,UACL3D,KAAKyS,OAAOC,IAMrBpP,EAAGlD,UAAU2H,OAAS,SAAiB2K,EAAMI,EAAMC,GAEjD,IAAIC,EADJnQ,EAAuB,kBAAT6P,GAAqBA,GAAQ,GAGzCM,EADEF,GACGA,EAAQA,EAAO,IAAO,GAEvB,EAGN,IAAI1O,EAAIsO,EAAO,GACX3Q,EAAIrB,KAAK2D,KAAKqO,EAAOtO,GAAK,GAAIpE,KAAKlB,QACnCmU,EAAO,SAAc,WAAc7O,GAAMA,EACzC8O,EAAcH,EAMlB,GAJAC,GAAKjR,EACLiR,EAAItS,KAAKkB,IAAI,EAAGoR,GAGZE,EAAa,CACf,IAAK,IAAIrU,EAAI,EAAGA,EAAIkD,EAAGlD,IACrBqU,EAAYtP,MAAM/E,GAAKmB,KAAK4D,MAAM/E,GAEpCqU,EAAYpU,OAASiD,EAGvB,GAAU,IAANA,QAEG,GAAI/B,KAAKlB,OAASiD,EAEvB,IADA/B,KAAKlB,QAAUiD,EACVlD,EAAI,EAAGA,EAAImB,KAAKlB,OAAQD,IAC3BmB,KAAK4D,MAAM/E,GAAKmB,KAAK4D,MAAM/E,EAAIkD,QAGjC/B,KAAK4D,MAAM,GAAK,EAChB5D,KAAKlB,OAAS,EAGhB,IAAI4H,EAAQ,EACZ,IAAK7H,EAAImB,KAAKlB,OAAS,EAAGD,GAAK,IAAgB,IAAV6H,GAAe7H,GAAKmU,GAAInU,IAAK,CAChE,IAAIU,EAAuB,EAAhBS,KAAK4D,MAAM/E,GACtBmB,KAAK4D,MAAM/E,GAAM6H,GAAU,GAAKtC,EAAO7E,IAAS6E,EAChDsC,EAAQnH,EAAO0T,EAajB,OATIC,GAAyB,IAAVxM,IACjBwM,EAAYtP,MAAMsP,EAAYpU,UAAY4H,GAGxB,IAAhB1G,KAAKlB,SACPkB,KAAK4D,MAAM,GAAK,EAChB5D,KAAKlB,OAAS,GAGTkB,KAAK+E,SAGdzB,EAAGlD,UAAU+S,MAAQ,SAAgBT,EAAMI,EAAMC,GAG/C,OADAlQ,EAAyB,IAAlB7C,KAAK2D,UACL3D,KAAK+H,OAAO2K,EAAMI,EAAMC,IAIjCzP,EAAGlD,UAAUgT,KAAO,SAAeV,GACjC,OAAO1S,KAAK4F,QAAQiN,MAAMH,IAG5BpP,EAAGlD,UAAUiT,MAAQ,SAAgBX,GACnC,OAAO1S,KAAK4F,QAAQ6M,OAAOC,IAI7BpP,EAAGlD,UAAU8B,KAAO,SAAewQ,GACjC,OAAO1S,KAAK4F,QAAQuN,MAAMT,IAG5BpP,EAAGlD,UAAUkT,MAAQ,SAAgBZ,GACnC,OAAO1S,KAAK4F,QAAQmC,OAAO2K,IAI7BpP,EAAGlD,UAAU4B,MAAQ,SAAgBoE,GACnCvD,EAAsB,kBAARuD,GAAoBA,GAAO,GACzC,IAAIhC,EAAIgC,EAAM,GACVrE,GAAKqE,EAAMhC,GAAK,GAChByD,EAAI,GAAKzD,EAGb,GAAIpE,KAAKlB,QAAUiD,EAAG,OAAO,EAG7B,IAAIkD,EAAIjF,KAAK4D,MAAM7B,GAEnB,SAAUkD,EAAI4C,IAIhBvE,EAAGlD,UAAUmT,OAAS,SAAiBb,GACrC7P,EAAuB,kBAAT6P,GAAqBA,GAAQ,GAC3C,IAAItO,EAAIsO,EAAO,GACX3Q,GAAK2Q,EAAOtO,GAAK,GAIrB,GAFAvB,EAAyB,IAAlB7C,KAAK2D,SAAgB,2CAExB3D,KAAKlB,QAAUiD,EACjB,OAAO/B,KAQT,GALU,IAANoE,GACFrC,IAEF/B,KAAKlB,OAAS4B,KAAK2D,IAAItC,EAAG/B,KAAKlB,QAErB,IAANsF,EAAS,CACX,IAAI6O,EAAO,SAAc,WAAc7O,GAAMA,EAC7CpE,KAAK4D,MAAM5D,KAAKlB,OAAS,IAAMmU,EAGjC,OAAOjT,KAAK+E,SAIdzB,EAAGlD,UAAUoT,MAAQ,SAAgBd,GACnC,OAAO1S,KAAK4F,QAAQ2N,OAAOb,IAI7BpP,EAAGlD,UAAUqI,MAAQ,SAAgBjE,GAGnC,OAFA3B,EAAsB,kBAAR2B,GACd3B,EAAO2B,EAAM,UACTA,EAAM,EAAUxE,KAAKyT,OAAOjP,GAGV,IAAlBxE,KAAK2D,SACa,IAAhB3D,KAAKlB,SAAiC,EAAhBkB,KAAK4D,MAAM,IAAUY,GAC7CxE,KAAK4D,MAAM,GAAKY,GAAuB,EAAhBxE,KAAK4D,MAAM,IAClC5D,KAAK2D,SAAW,EACT3D,OAGTA,KAAK2D,SAAW,EAChB3D,KAAKyT,MAAMjP,GACXxE,KAAK2D,SAAW,EACT3D,MAIFA,KAAKwF,OAAOhB,IAGrBlB,EAAGlD,UAAUoF,OAAS,SAAiBhB,GACrCxE,KAAK4D,MAAM,IAAMY,EAGjB,IAAK,IAAI3F,EAAI,EAAGA,EAAImB,KAAKlB,QAAUkB,KAAK4D,MAAM/E,IAAM,SAAWA,IAC7DmB,KAAK4D,MAAM/E,IAAM,SACbA,IAAMmB,KAAKlB,OAAS,EACtBkB,KAAK4D,MAAM/E,EAAI,GAAK,EAEpBmB,KAAK4D,MAAM/E,EAAI,KAKnB,OAFAmB,KAAKlB,OAAS4B,KAAKkB,IAAI5B,KAAKlB,OAAQD,EAAI,GAEjCmB,MAITsD,EAAGlD,UAAUqT,MAAQ,SAAgBjP,GAGnC,GAFA3B,EAAsB,kBAAR2B,GACd3B,EAAO2B,EAAM,UACTA,EAAM,EAAG,OAAOxE,KAAKyI,OAAOjE,GAEhC,GAAsB,IAAlBxE,KAAK2D,SAIP,OAHA3D,KAAK2D,SAAW,EAChB3D,KAAKyI,MAAMjE,GACXxE,KAAK2D,SAAW,EACT3D,KAKT,GAFAA,KAAK4D,MAAM,IAAMY,EAEG,IAAhBxE,KAAKlB,QAAgBkB,KAAK4D,MAAM,GAAK,EACvC5D,KAAK4D,MAAM,IAAM5D,KAAK4D,MAAM,GAC5B5D,KAAK2D,SAAW,OAGhB,IAAK,IAAI9E,EAAI,EAAGA,EAAImB,KAAKlB,QAAUkB,KAAK4D,MAAM/E,GAAK,EAAGA,IACpDmB,KAAK4D,MAAM/E,IAAM,SACjBmB,KAAK4D,MAAM/E,EAAI,IAAM,EAIzB,OAAOmB,KAAK+E,SAGdzB,EAAGlD,UAAUsT,KAAO,SAAelP,GACjC,OAAOxE,KAAK4F,QAAQ6C,MAAMjE,IAG5BlB,EAAGlD,UAAU0B,KAAO,SAAe0C,GACjC,OAAOxE,KAAK4F,QAAQ6N,MAAMjP,IAG5BlB,EAAGlD,UAAUuT,KAAO,WAGlB,OAFA3T,KAAK2D,SAAW,EAET3D,MAGTsD,EAAGlD,UAAUmI,IAAM,WACjB,OAAOvI,KAAK4F,QAAQ+N,QAGtBrQ,EAAGlD,UAAUwT,aAAe,SAAuBpP,EAAKD,EAAKsP,GAC3D,IACIhV,EAIAoG,EALA1E,EAAMiE,EAAI1F,OAAS+U,EAGvB7T,KAAK6F,QAAQtF,GAGb,IAAImG,EAAQ,EACZ,IAAK7H,EAAI,EAAGA,EAAI2F,EAAI1F,OAAQD,IAAK,CAC/BoG,GAA6B,EAAxBjF,KAAK4D,MAAM/E,EAAIgV,IAAcnN,EAClC,IAAIhC,GAAwB,EAAfF,EAAIZ,MAAM/E,IAAU0F,EACjCU,GAAa,SAARP,EACLgC,GAASzB,GAAK,KAAQP,EAAQ,SAAa,GAC3C1E,KAAK4D,MAAM/E,EAAIgV,GAAa,SAAJ5O,EAE1B,KAAOpG,EAAImB,KAAKlB,OAAS+U,EAAOhV,IAC9BoG,GAA6B,EAAxBjF,KAAK4D,MAAM/E,EAAIgV,IAAcnN,EAClCA,EAAQzB,GAAK,GACbjF,KAAK4D,MAAM/E,EAAIgV,GAAa,SAAJ5O,EAG1B,GAAc,IAAVyB,EAAa,OAAO1G,KAAK+E,QAK7B,IAFAlC,GAAkB,IAAX6D,GACPA,EAAQ,EACH7H,EAAI,EAAGA,EAAImB,KAAKlB,OAAQD,IAC3BoG,IAAsB,EAAhBjF,KAAK4D,MAAM/E,IAAU6H,EAC3BA,EAAQzB,GAAK,GACbjF,KAAK4D,MAAM/E,GAAS,SAAJoG,EAIlB,OAFAjF,KAAK2D,SAAW,EAET3D,KAAK+E,SAGdzB,EAAGlD,UAAU0T,SAAW,SAAmBtP,EAAKuP,GAC9C,IAAIF,EAAQ7T,KAAKlB,OAAS0F,EAAI1F,OAE1B8B,EAAIZ,KAAK4F,QACTa,EAAIjC,EAGJwP,EAA8B,EAAxBvN,EAAE7C,MAAM6C,EAAE3H,OAAS,GACzBmV,EAAUjU,KAAKiI,WAAW+L,GAC9BH,EAAQ,GAAKI,EACC,IAAVJ,IACFpN,EAAIA,EAAE4M,MAAMQ,GACZjT,EAAE6R,OAAOoB,GACTG,EAA8B,EAAxBvN,EAAE7C,MAAM6C,EAAE3H,OAAS,IAI3B,IACI+I,EADAwJ,EAAIzQ,EAAE9B,OAAS2H,EAAE3H,OAGrB,GAAa,QAATiV,EAAgB,CAClBlM,EAAI,IAAIvE,EAAG,MACXuE,EAAE/I,OAASuS,EAAI,EACfxJ,EAAEjE,MAAQ,IAAInF,MAAMoJ,EAAE/I,QACtB,IAAK,IAAID,EAAI,EAAGA,EAAIgJ,EAAE/I,OAAQD,IAC5BgJ,EAAEjE,MAAM/E,GAAK,EAIjB,IAAIqV,EAAOtT,EAAEgF,QAAQgO,aAAanN,EAAG,EAAG4K,GAClB,IAAlB6C,EAAKvQ,WACP/C,EAAIsT,EACArM,IACFA,EAAEjE,MAAMyN,GAAK,IAIjB,IAAK,IAAIrM,EAAIqM,EAAI,EAAGrM,GAAK,EAAGA,IAAK,CAC/B,IAAImP,EAAmC,UAAL,EAAxBvT,EAAEgD,MAAM6C,EAAE3H,OAASkG,KACE,EAA5BpE,EAAEgD,MAAM6C,EAAE3H,OAASkG,EAAI,IAI1BmP,EAAKzT,KAAK2D,IAAK8P,EAAKH,EAAO,EAAG,UAE9BpT,EAAEgT,aAAanN,EAAG0N,EAAInP,GACtB,MAAsB,IAAfpE,EAAE+C,SACPwQ,IACAvT,EAAE+C,SAAW,EACb/C,EAAEgT,aAAanN,EAAG,EAAGzB,GAChBpE,EAAEqG,WACLrG,EAAE+C,UAAY,GAGdkE,IACFA,EAAEjE,MAAMoB,GAAKmP,GAajB,OAVItM,GACFA,EAAE9C,QAEJnE,EAAEmE,QAGW,QAATgP,GAA4B,IAAVF,GACpBjT,EAAEmH,OAAO8L,GAGJ,CACLO,IAAKvM,GAAK,KACVvC,IAAK1E,IAQT0C,EAAGlD,UAAUiU,OAAS,SAAiB7P,EAAKuP,EAAMO,GAGhD,OAFAzR,GAAQ2B,EAAIyC,UAERjH,KAAKiH,SACA,CACLmN,IAAK,IAAI9Q,EAAG,GACZgC,IAAK,IAAIhC,EAAG,IAKM,IAAlBtD,KAAK2D,UAAmC,IAAjBa,EAAIb,UAC7B/E,EAAMoB,KAAK8I,MAAMuL,OAAO7P,EAAKuP,GAEhB,QAATA,IACFK,EAAMxV,EAAIwV,IAAItL,OAGH,QAATiL,IACFzO,EAAM1G,EAAI0G,IAAIwD,MACVwL,GAA6B,IAAjBhP,EAAI3B,UAClB2B,EAAIwE,KAAKtF,IAIN,CACL4P,IAAKA,EACL9O,IAAKA,IAIa,IAAlBtF,KAAK2D,UAAmC,IAAjBa,EAAIb,UAC7B/E,EAAMoB,KAAKqU,OAAO7P,EAAIsE,MAAOiL,GAEhB,QAATA,IACFK,EAAMxV,EAAIwV,IAAItL,OAGT,CACLsL,IAAKA,EACL9O,IAAK1G,EAAI0G,MAI0B,KAAlCtF,KAAK2D,SAAWa,EAAIb,WACvB/E,EAAMoB,KAAK8I,MAAMuL,OAAO7P,EAAIsE,MAAOiL,GAEtB,QAATA,IACFzO,EAAM1G,EAAI0G,IAAIwD,MACVwL,GAA6B,IAAjBhP,EAAI3B,UAClB2B,EAAIyE,KAAKvF,IAIN,CACL4P,IAAKxV,EAAIwV,IACT9O,IAAKA,IAOLd,EAAI1F,OAASkB,KAAKlB,QAAUkB,KAAKc,IAAI0D,GAAO,EACvC,CACL4P,IAAK,IAAI9Q,EAAG,GACZgC,IAAKtF,MAKU,IAAfwE,EAAI1F,OACO,QAATiV,EACK,CACLK,IAAKpU,KAAKuU,KAAK/P,EAAIZ,MAAM,IACzB0B,IAAK,MAII,QAATyO,EACK,CACLK,IAAK,KACL9O,IAAK,IAAIhC,EAAGtD,KAAKkH,KAAK1C,EAAIZ,MAAM,MAI7B,CACLwQ,IAAKpU,KAAKuU,KAAK/P,EAAIZ,MAAM,IACzB0B,IAAK,IAAIhC,EAAGtD,KAAKkH,KAAK1C,EAAIZ,MAAM,MAI7B5D,KAAK8T,SAAStP,EAAKuP,GAlF1B,IAAIK,EAAK9O,EAAK1G,GAsFhB0E,EAAGlD,UAAUgU,IAAM,SAAc5P,GAC/B,OAAOxE,KAAKqU,OAAO7P,EAAK,OAAO,GAAO4P,KAIxC9Q,EAAGlD,UAAUkF,IAAM,SAAcd,GAC/B,OAAOxE,KAAKqU,OAAO7P,EAAK,OAAO,GAAOc,KAGxChC,EAAGlD,UAAUoU,KAAO,SAAehQ,GACjC,OAAOxE,KAAKqU,OAAO7P,EAAK,OAAO,GAAMc,KAIvChC,EAAGlD,UAAUqU,SAAW,SAAmBjQ,GACzC,IAAIkQ,EAAK1U,KAAKqU,OAAO7P,GAGrB,GAAIkQ,EAAGpP,IAAI2B,SAAU,OAAOyN,EAAGN,IAE/B,IAAI9O,EAA0B,IAApBoP,EAAGN,IAAIzQ,SAAiB+Q,EAAGpP,IAAIyE,KAAKvF,GAAOkQ,EAAGpP,IAEpDqP,EAAOnQ,EAAI8O,MAAM,GACjBsB,EAAKpQ,EAAIsD,MAAM,GACfhH,EAAMwE,EAAIxE,IAAI6T,GAGlB,OAAI7T,EAAM,GAAY,IAAP8T,GAAoB,IAAR9T,EAAkB4T,EAAGN,IAGrB,IAApBM,EAAGN,IAAIzQ,SAAiB+Q,EAAGN,IAAIX,MAAM,GAAKiB,EAAGN,IAAI3L,MAAM,IAGhEnF,EAAGlD,UAAU8G,KAAO,SAAe1C,GACjC3B,EAAO2B,GAAO,UAId,IAHA,IAAIoM,GAAK,GAAK,IAAMpM,EAEhBqQ,EAAM,EACDhW,EAAImB,KAAKlB,OAAS,EAAGD,GAAK,EAAGA,IACpCgW,GAAOjE,EAAIiE,GAAuB,EAAhB7U,KAAK4D,MAAM/E,KAAW2F,EAG1C,OAAOqQ,GAITvR,EAAGlD,UAAU+G,MAAQ,SAAgB3C,GACnC3B,EAAO2B,GAAO,UAGd,IADA,IAAIkC,EAAQ,EACH7H,EAAImB,KAAKlB,OAAS,EAAGD,GAAK,EAAGA,IAAK,CACzC,IAAIoG,GAAqB,EAAhBjF,KAAK4D,MAAM/E,IAAkB,SAAR6H,EAC9B1G,KAAK4D,MAAM/E,GAAMoG,EAAIT,EAAO,EAC5BkC,EAAQzB,EAAIT,EAGd,OAAOxE,KAAK+E,SAGdzB,EAAGlD,UAAUmU,KAAO,SAAe/P,GACjC,OAAOxE,KAAK4F,QAAQuB,MAAM3C,IAG5BlB,EAAGlD,UAAU0U,KAAO,SAAelE,GACjC/N,EAAsB,IAAf+N,EAAEjN,UACTd,GAAQ+N,EAAE3J,UAEV,IAAI5E,EAAIrC,KACJyP,EAAImB,EAAEhL,QAGRvD,EADiB,IAAfA,EAAEsB,SACAtB,EAAEmS,KAAK5D,GAEPvO,EAAEuD,QAIR,IAAImP,EAAI,IAAIzR,EAAG,GACX0R,EAAI,IAAI1R,EAAG,GAGX2R,EAAI,IAAI3R,EAAG,GACX4R,EAAI,IAAI5R,EAAG,GAEXb,EAAI,EAER,MAAOJ,EAAE8S,UAAY1F,EAAE0F,SACrB9S,EAAE0F,OAAO,GACT0H,EAAE1H,OAAO,KACPtF,EAGJ,IAAI2S,EAAK3F,EAAE7J,QACPyP,EAAKhT,EAAEuD,QAEX,OAAQvD,EAAE4E,SAAU,CAClB,IAAK,IAAIpI,EAAI,EAAGyW,EAAK,EAAyB,KAArBjT,EAAEuB,MAAM,GAAK0R,IAAazW,EAAI,KAAMA,EAAGyW,IAAO,GACvE,GAAIzW,EAAI,EAAG,CACTwD,EAAE0F,OAAOlJ,GACT,MAAOA,KAAM,GACPkW,EAAEQ,SAAWP,EAAEO,WACjBR,EAAEjL,KAAKsL,GACPJ,EAAEjL,KAAKsL,IAGTN,EAAEhN,OAAO,GACTiN,EAAEjN,OAAO,GAIb,IAAK,IAAI/C,EAAI,EAAGwQ,EAAK,EAAyB,KAArB/F,EAAE7L,MAAM,GAAK4R,IAAaxQ,EAAI,KAAMA,EAAGwQ,IAAO,GACvE,GAAIxQ,EAAI,EAAG,CACTyK,EAAE1H,OAAO/C,GACT,MAAOA,KAAM,GACPiQ,EAAEM,SAAWL,EAAEK,WACjBN,EAAEnL,KAAKsL,GACPF,EAAEnL,KAAKsL,IAGTJ,EAAElN,OAAO,GACTmN,EAAEnN,OAAO,GAIT1F,EAAEvB,IAAI2O,IAAM,GACdpN,EAAE0H,KAAK0F,GACPsF,EAAEhL,KAAKkL,GACPD,EAAEjL,KAAKmL,KAEPzF,EAAE1F,KAAK1H,GACP4S,EAAElL,KAAKgL,GACPG,EAAEnL,KAAKiL,IAIX,MAAO,CACLpU,EAAGqU,EACHxO,EAAGyO,EACHxS,IAAK+M,EAAEgD,OAAOhQ,KAOlBa,EAAGlD,UAAUqV,OAAS,SAAiB7E,GACrC/N,EAAsB,IAAf+N,EAAEjN,UACTd,GAAQ+N,EAAE3J,UAEV,IAAIrG,EAAIZ,KACJyG,EAAImK,EAAEhL,QAGRhF,EADiB,IAAfA,EAAE+C,SACA/C,EAAE4T,KAAK5D,GAEPhQ,EAAEgF,QAGR,IAuCIhH,EAvCA8W,EAAK,IAAIpS,EAAG,GACZqS,EAAK,IAAIrS,EAAG,GAEZsS,EAAQnP,EAAEb,QAEd,MAAOhF,EAAE+B,KAAK,GAAK,GAAK8D,EAAE9D,KAAK,GAAK,EAAG,CACrC,IAAK,IAAI9D,EAAI,EAAGyW,EAAK,EAAyB,KAArB1U,EAAEgD,MAAM,GAAK0R,IAAazW,EAAI,KAAMA,EAAGyW,IAAO,GACvE,GAAIzW,EAAI,EAAG,CACT+B,EAAEmH,OAAOlJ,GACT,MAAOA,KAAM,EACP6W,EAAGH,SACLG,EAAG5L,KAAK8L,GAGVF,EAAG3N,OAAO,GAId,IAAK,IAAI/C,EAAI,EAAGwQ,EAAK,EAAyB,KAArB/O,EAAE7C,MAAM,GAAK4R,IAAaxQ,EAAI,KAAMA,EAAGwQ,IAAO,GACvE,GAAIxQ,EAAI,EAAG,CACTyB,EAAEsB,OAAO/C,GACT,MAAOA,KAAM,EACP2Q,EAAGJ,SACLI,EAAG7L,KAAK8L,GAGVD,EAAG5N,OAAO,GAIVnH,EAAEE,IAAI2F,IAAM,GACd7F,EAAEmJ,KAAKtD,GACPiP,EAAG3L,KAAK4L,KAERlP,EAAEsD,KAAKnJ,GACP+U,EAAG5L,KAAK2L,IAeZ,OATE9W,EADgB,IAAdgC,EAAE+B,KAAK,GACH+S,EAEAC,EAGJ/W,EAAI+D,KAAK,GAAK,GAChB/D,EAAIkL,KAAK8G,GAGJhS,GAGT0E,EAAGlD,UAAUsC,IAAM,SAAc8B,GAC/B,GAAIxE,KAAKiH,SAAU,OAAOzC,EAAI+D,MAC9B,GAAI/D,EAAIyC,SAAU,OAAOjH,KAAKuI,MAE9B,IAAI3H,EAAIZ,KAAK4F,QACTa,EAAIjC,EAAIoB,QACZhF,EAAE+C,SAAW,EACb8C,EAAE9C,SAAW,EAGb,IAAK,IAAIkQ,EAAQ,EAAGjT,EAAEuU,UAAY1O,EAAE0O,SAAUtB,IAC5CjT,EAAEmH,OAAO,GACTtB,EAAEsB,OAAO,GAGX,EAAG,CACD,MAAOnH,EAAEuU,SACPvU,EAAEmH,OAAO,GAEX,MAAOtB,EAAE0O,SACP1O,EAAEsB,OAAO,GAGX,IAAI3D,EAAIxD,EAAEE,IAAI2F,GACd,GAAIrC,EAAI,EAAG,CAET,IAAI8D,EAAItH,EACRA,EAAI6F,EACJA,EAAIyB,OACC,GAAU,IAAN9D,GAAyB,IAAdqC,EAAE9D,KAAK,GAC3B,MAGF/B,EAAEmJ,KAAKtD,SACA,GAET,OAAOA,EAAEgM,OAAOoB,IAIlBvQ,EAAGlD,UAAUyV,KAAO,SAAerR,GACjC,OAAOxE,KAAK8U,KAAKtQ,GAAK5D,EAAE4T,KAAKhQ,IAG/BlB,EAAGlD,UAAU+U,OAAS,WACpB,OAA+B,KAAP,EAAhBnV,KAAK4D,MAAM,KAGrBN,EAAGlD,UAAUmV,MAAQ,WACnB,OAA+B,KAAP,EAAhBvV,KAAK4D,MAAM,KAIrBN,EAAGlD,UAAU0H,MAAQ,SAAgBtD,GACnC,OAAOxE,KAAK4D,MAAM,GAAKY,GAIzBlB,EAAGlD,UAAU0V,MAAQ,SAAgB1P,GACnCvD,EAAsB,kBAARuD,GACd,IAAIhC,EAAIgC,EAAM,GACVrE,GAAKqE,EAAMhC,GAAK,GAChByD,EAAI,GAAKzD,EAGb,GAAIpE,KAAKlB,QAAUiD,EAGjB,OAFA/B,KAAK6F,QAAQ9D,EAAI,GACjB/B,KAAK4D,MAAM7B,IAAM8F,EACV7H,KAKT,IADA,IAAI0G,EAAQmB,EACHhJ,EAAIkD,EAAa,IAAV2E,GAAe7H,EAAImB,KAAKlB,OAAQD,IAAK,CACnD,IAAIoG,EAAoB,EAAhBjF,KAAK4D,MAAM/E,GACnBoG,GAAKyB,EACLA,EAAQzB,IAAM,GACdA,GAAK,SACLjF,KAAK4D,MAAM/E,GAAKoG,EAMlB,OAJc,IAAVyB,IACF1G,KAAK4D,MAAM/E,GAAK6H,EAChB1G,KAAKlB,UAEAkB,MAGTsD,EAAGlD,UAAU6G,OAAS,WACpB,OAAuB,IAAhBjH,KAAKlB,QAAkC,IAAlBkB,KAAK4D,MAAM,IAGzCN,EAAGlD,UAAUuC,KAAO,SAAe6B,GACjC,IAOI5F,EAPA+E,EAAWa,EAAM,EAErB,GAAsB,IAAlBxE,KAAK2D,WAAmBA,EAAU,OAAQ,EAC9C,GAAsB,IAAlB3D,KAAK2D,UAAkBA,EAAU,OAAO,EAK5C,GAHA3D,KAAK+E,QAGD/E,KAAKlB,OAAS,EAChBF,EAAM,MACD,CACD+E,IACFa,GAAOA,GAGT3B,EAAO2B,GAAO,SAAW,qBAEzB,IAAIS,EAAoB,EAAhBjF,KAAK4D,MAAM,GACnBhF,EAAMqG,IAAMT,EAAM,EAAIS,EAAIT,GAAO,EAAI,EAEvC,OAAsB,IAAlBxE,KAAK2D,SAA8B,GAAN/E,EAC1BA,GAOT0E,EAAGlD,UAAUU,IAAM,SAAc0D,GAC/B,GAAsB,IAAlBxE,KAAK2D,UAAmC,IAAjBa,EAAIb,SAAgB,OAAQ,EACvD,GAAsB,IAAlB3D,KAAK2D,UAAmC,IAAjBa,EAAIb,SAAgB,OAAO,EAEtD,IAAI/E,EAAMoB,KAAK+V,KAAKvR,GACpB,OAAsB,IAAlBxE,KAAK2D,SAA8B,GAAN/E,EAC1BA,GAIT0E,EAAGlD,UAAU2V,KAAO,SAAevR,GAEjC,GAAIxE,KAAKlB,OAAS0F,EAAI1F,OAAQ,OAAO,EACrC,GAAIkB,KAAKlB,OAAS0F,EAAI1F,OAAQ,OAAQ,EAGtC,IADA,IAAIF,EAAM,EACDC,EAAImB,KAAKlB,OAAS,EAAGD,GAAK,EAAGA,IAAK,CACzC,IAAI+B,EAAoB,EAAhBZ,KAAK4D,MAAM/E,GACf4H,EAAmB,EAAfjC,EAAIZ,MAAM/E,GAElB,GAAI+B,IAAM6F,EAAV,CACI7F,EAAI6F,EACN7H,GAAO,EACEgC,EAAI6F,IACb7H,EAAM,GAER,OAEF,OAAOA,GAGT0E,EAAGlD,UAAU4V,IAAM,SAAcxR,GAC/B,OAA0B,IAAnBxE,KAAK2C,KAAK6B,IAGnBlB,EAAGlD,UAAU6V,GAAK,SAAazR,GAC7B,OAAyB,IAAlBxE,KAAKc,IAAI0D,IAGlBlB,EAAGlD,UAAU8V,KAAO,SAAe1R,GACjC,OAAOxE,KAAK2C,KAAK6B,IAAQ,GAG3BlB,EAAGlD,UAAU+V,IAAM,SAAc3R,GAC/B,OAAOxE,KAAKc,IAAI0D,IAAQ,GAG1BlB,EAAGlD,UAAUgW,IAAM,SAAc5R,GAC/B,OAA2B,IAApBxE,KAAK2C,KAAK6B,IAGnBlB,EAAGlD,UAAUiW,GAAK,SAAa7R,GAC7B,OAA0B,IAAnBxE,KAAKc,IAAI0D,IAGlBlB,EAAGlD,UAAUkW,KAAO,SAAe9R,GACjC,OAAOxE,KAAK2C,KAAK6B,IAAQ,GAG3BlB,EAAGlD,UAAUmW,IAAM,SAAc/R,GAC/B,OAAOxE,KAAKc,IAAI0D,IAAQ,GAG1BlB,EAAGlD,UAAUoW,IAAM,SAAchS,GAC/B,OAA0B,IAAnBxE,KAAK2C,KAAK6B,IAGnBlB,EAAGlD,UAAUqW,GAAK,SAAajS,GAC7B,OAAyB,IAAlBxE,KAAKc,IAAI0D,IAOlBlB,EAAG9B,IAAM,SAAcgD,GACrB,OAAO,IAAIkS,EAAIlS,IAGjBlB,EAAGlD,UAAUuB,MAAQ,SAAgBgV,GAGnC,OAFA9T,GAAQ7C,KAAKwB,IAAK,yCAClBqB,EAAyB,IAAlB7C,KAAK2D,SAAgB,iCACrBgT,EAAIC,UAAU5W,MAAM6W,UAAUF,IAGvCrT,EAAGlD,UAAUwC,QAAU,WAErB,OADAC,EAAO7C,KAAKwB,IAAK,wDACVxB,KAAKwB,IAAIsV,YAAY9W,OAG9BsD,EAAGlD,UAAUyW,UAAY,SAAoBF,GAE3C,OADA3W,KAAKwB,IAAMmV,EACJ3W,MAGTsD,EAAGlD,UAAU2W,SAAW,SAAmBJ,GAEzC,OADA9T,GAAQ7C,KAAKwB,IAAK,yCACXxB,KAAK6W,UAAUF,IAGxBrT,EAAGlD,UAAU4W,OAAS,SAAiBxS,GAErC,OADA3B,EAAO7C,KAAKwB,IAAK,sCACVxB,KAAKwB,IAAIJ,IAAIpB,KAAMwE,IAG5BlB,EAAGlD,UAAU6W,QAAU,SAAkBzS,GAEvC,OADA3B,EAAO7C,KAAKwB,IAAK,uCACVxB,KAAKwB,IAAIsI,KAAK9J,KAAMwE,IAG7BlB,EAAGlD,UAAU8W,OAAS,SAAiB1S,GAErC,OADA3B,EAAO7C,KAAKwB,IAAK,sCACVxB,KAAKwB,IAAIL,IAAInB,KAAMwE,IAG5BlB,EAAGlD,UAAU+W,QAAU,SAAkB3S,GAEvC,OADA3B,EAAO7C,KAAKwB,IAAK,uCACVxB,KAAKwB,IAAIuI,KAAK/J,KAAMwE,IAG7BlB,EAAGlD,UAAUgX,OAAS,SAAiB5S,GAErC,OADA3B,EAAO7C,KAAKwB,IAAK,sCACVxB,KAAKwB,IAAI6V,IAAIrX,KAAMwE,IAG5BlB,EAAGlD,UAAUkX,OAAS,SAAiB9S,GAGrC,OAFA3B,EAAO7C,KAAKwB,IAAK,sCACjBxB,KAAKwB,IAAI+V,SAASvX,KAAMwE,GACjBxE,KAAKwB,IAAI+C,IAAIvE,KAAMwE,IAG5BlB,EAAGlD,UAAUoX,QAAU,SAAkBhT,GAGvC,OAFA3B,EAAO7C,KAAKwB,IAAK,sCACjBxB,KAAKwB,IAAI+V,SAASvX,KAAMwE,GACjBxE,KAAKwB,IAAIuM,KAAK/N,KAAMwE,IAG7BlB,EAAGlD,UAAUmC,OAAS,WAGpB,OAFAM,EAAO7C,KAAKwB,IAAK,sCACjBxB,KAAKwB,IAAIiW,SAASzX,MACXA,KAAKwB,IAAI+Q,IAAIvS,OAGtBsD,EAAGlD,UAAUsX,QAAU,WAGrB,OAFA7U,EAAO7C,KAAKwB,IAAK,uCACjBxB,KAAKwB,IAAIiW,SAASzX,MACXA,KAAKwB,IAAIgR,KAAKxS,OAIvBsD,EAAGlD,UAAUuX,QAAU,WAGrB,OAFA9U,EAAO7C,KAAKwB,IAAK,uCACjBxB,KAAKwB,IAAIiW,SAASzX,MACXA,KAAKwB,IAAIoW,KAAK5X,OAGvBsD,EAAGlD,UAAUyX,QAAU,WAGrB,OAFAhV,EAAO7C,KAAKwB,IAAK,uCACjBxB,KAAKwB,IAAIiW,SAASzX,MACXA,KAAKwB,IAAIqU,KAAK7V,OAIvBsD,EAAGlD,UAAU0X,OAAS,WAGpB,OAFAjV,EAAO7C,KAAKwB,IAAK,sCACjBxB,KAAKwB,IAAIiW,SAASzX,MACXA,KAAKwB,IAAIsH,IAAI9I,OAGtBsD,EAAGlD,UAAUkC,OAAS,SAAiBkC,GAGrC,OAFA3B,EAAO7C,KAAKwB,MAAQgD,EAAIhD,IAAK,qBAC7BxB,KAAKwB,IAAIiW,SAASzX,MACXA,KAAKwB,IAAIiE,IAAIzF,KAAMwE,IAI5B,IAAIuT,EAAS,CACXC,KAAM,KACNC,KAAM,KACNC,KAAM,KACNC,OAAQ,MAIV,SAASC,EAAQC,EAAMzH,GAErB5Q,KAAKqY,KAAOA,EACZrY,KAAK4Q,EAAI,IAAItN,EAAGsN,EAAG,IACnB5Q,KAAKM,EAAIN,KAAK4Q,EAAEpQ,YAChBR,KAAKsB,EAAI,IAAIgC,EAAG,GAAGmP,OAAOzS,KAAKM,GAAGyJ,KAAK/J,KAAK4Q,GAE5C5Q,KAAKsY,IAAMtY,KAAKuY,OAiDlB,SAASC,IACPJ,EAAOK,KACLzY,KACA,OACA,2EA+DJ,SAAS0Y,IACPN,EAAOK,KACLzY,KACA,OACA,kEAIJ,SAAS2Y,IACPP,EAAOK,KACLzY,KACA,OACA,yDAIJ,SAAS4Y,IAEPR,EAAOK,KACLzY,KACA,QACA,uEA8CJ,SAAS0W,EAAKrF,GACZ,GAAiB,kBAANA,EAAgB,CACzB,IAAIjP,EAAQkB,EAAGuV,OAAOxH,GACtBrR,KAAKqR,EAAIjP,EAAMwO,EACf5Q,KAAKoC,MAAQA,OAEbS,EAAOwO,EAAE2E,IAAI,GAAI,kCACjBhW,KAAKqR,EAAIA,EACTrR,KAAKoC,MAAQ,KAkOjB,SAAS0W,EAAMzH,GACbqF,EAAI+B,KAAKzY,KAAMqR,GAEfrR,KAAK6T,MAAQ7T,KAAKqR,EAAE7Q,YAChBR,KAAK6T,MAAQ,KAAO,IACtB7T,KAAK6T,OAAS,GAAM7T,KAAK6T,MAAQ,IAGnC7T,KAAKoE,EAAI,IAAId,EAAG,GAAGmP,OAAOzS,KAAK6T,OAC/B7T,KAAK4U,GAAK5U,KAAK+Y,KAAK/Y,KAAKoE,EAAEmO,OAC3BvS,KAAKgZ,KAAOhZ,KAAKoE,EAAEqR,OAAOzV,KAAKqR,GAE/BrR,KAAKiZ,KAAOjZ,KAAKgZ,KAAKzU,IAAIvE,KAAKoE,GAAGqP,MAAM,GAAGW,IAAIpU,KAAKqR,GACpDrR,KAAKiZ,KAAOjZ,KAAKiZ,KAAKzE,KAAKxU,KAAKoE,GAChCpE,KAAKiZ,KAAOjZ,KAAKoE,EAAEjD,IAAInB,KAAKiZ,MA5a9Bb,EAAOhY,UAAUmY,KAAO,WACtB,IAAID,EAAM,IAAIhV,EAAG,MAEjB,OADAgV,EAAI1U,MAAQ,IAAInF,MAAMiC,KAAKC,KAAKX,KAAKM,EAAI,KAClCgY,GAGTF,EAAOhY,UAAU8Y,QAAU,SAAkB1U,GAG3C,IACI2U,EADA/U,EAAII,EAGR,GACExE,KAAKoZ,MAAMhV,EAAGpE,KAAKsY,KACnBlU,EAAIpE,KAAKqZ,MAAMjV,GACfA,EAAIA,EAAE0F,KAAK9J,KAAKsY,KAChBa,EAAO/U,EAAE5D,kBACF2Y,EAAOnZ,KAAKM,GAErB,IAAIQ,EAAMqY,EAAOnZ,KAAKM,GAAK,EAAI8D,EAAE2R,KAAK/V,KAAK4Q,GAgB3C,OAfY,IAAR9P,GACFsD,EAAER,MAAM,GAAK,EACbQ,EAAEtF,OAAS,GACFgC,EAAM,EACfsD,EAAE2F,KAAK/J,KAAK4Q,QAEI0I,IAAZlV,EAAEW,MAEJX,EAAEW,QAGFX,EAAEmV,SAICnV,GAGTgU,EAAOhY,UAAUgZ,MAAQ,SAAgBI,EAAOhT,GAC9CgT,EAAMzR,OAAO/H,KAAKM,EAAG,EAAGkG,IAG1B4R,EAAOhY,UAAUiZ,MAAQ,SAAgB7U,GACvC,OAAOA,EAAIuJ,KAAK/N,KAAKsB,IASvB0B,EAASwV,EAAMJ,GAEfI,EAAKpY,UAAUgZ,MAAQ,SAAgBI,EAAOC,GAK5C,IAHA,IAAIxG,EAAO,QAEPyG,EAAShZ,KAAK2D,IAAImV,EAAM1a,OAAQ,GAC3BD,EAAI,EAAGA,EAAI6a,EAAQ7a,IAC1B4a,EAAO7V,MAAM/E,GAAK2a,EAAM5V,MAAM/E,GAIhC,GAFA4a,EAAO3a,OAAS4a,EAEZF,EAAM1a,QAAU,EAGlB,OAFA0a,EAAM5V,MAAM,GAAK,OACjB4V,EAAM1a,OAAS,GAKjB,IAAI6a,EAAOH,EAAM5V,MAAM,GAGvB,IAFA6V,EAAO7V,MAAM6V,EAAO3a,UAAY6a,EAAO1G,EAElCpU,EAAI,GAAIA,EAAI2a,EAAM1a,OAAQD,IAAK,CAClC,IAAI+a,EAAwB,EAAjBJ,EAAM5V,MAAM/E,GACvB2a,EAAM5V,MAAM/E,EAAI,KAAQ+a,EAAO3G,IAAS,EAAM0G,IAAS,GACvDA,EAAOC,EAETD,KAAU,GACVH,EAAM5V,MAAM/E,EAAI,IAAM8a,EACT,IAATA,GAAcH,EAAM1a,OAAS,GAC/B0a,EAAM1a,QAAU,GAEhB0a,EAAM1a,QAAU,GAIpB0Z,EAAKpY,UAAUiZ,MAAQ,SAAgB7U,GAErCA,EAAIZ,MAAMY,EAAI1F,QAAU,EACxB0F,EAAIZ,MAAMY,EAAI1F,OAAS,GAAK,EAC5B0F,EAAI1F,QAAU,EAId,IADA,IAAIO,EAAK,EACAR,EAAI,EAAGA,EAAI2F,EAAI1F,OAAQD,IAAK,CACnC,IAAIoG,EAAmB,EAAfT,EAAIZ,MAAM/E,GAClBQ,GAAU,IAAJ4F,EACNT,EAAIZ,MAAM/E,GAAU,SAALQ,EACfA,EAAS,GAAJ4F,GAAa5F,EAAK,SAAa,GAUtC,OANkC,IAA9BmF,EAAIZ,MAAMY,EAAI1F,OAAS,KACzB0F,EAAI1F,SAC8B,IAA9B0F,EAAIZ,MAAMY,EAAI1F,OAAS,IACzB0F,EAAI1F,UAGD0F,GASTxB,EAAS0V,EAAMN,GAQfpV,EAAS2V,EAAMP,GASfpV,EAAS4V,EAAQR,GAEjBQ,EAAOxY,UAAUiZ,MAAQ,SAAgB7U,GAGvC,IADA,IAAIkC,EAAQ,EACH7H,EAAI,EAAGA,EAAI2F,EAAI1F,OAAQD,IAAK,CACnC,IAAIO,EAA0B,IAAL,EAAfoF,EAAIZ,MAAM/E,IAAiB6H,EACjCrH,EAAU,SAALD,EACTA,KAAQ,GAERoF,EAAIZ,MAAM/E,GAAKQ,EACfqH,EAAQtH,EAKV,OAHc,IAAVsH,IACFlC,EAAIZ,MAAMY,EAAI1F,UAAY4H,GAErBlC,GAITlB,EAAGuV,OAAS,SAAgBR,GAE1B,GAAIN,EAAOM,GAAO,OAAON,EAAOM,GAEhC,IAAIjW,EACJ,GAAa,SAATiW,EACFjW,EAAQ,IAAIoW,OACP,GAAa,SAATH,EACTjW,EAAQ,IAAIsW,OACP,GAAa,SAATL,EACTjW,EAAQ,IAAIuW,MACP,IAAa,WAATN,EAGT,MAAM,IAAItV,MAAM,iBAAmBsV,GAFnCjW,EAAQ,IAAIwW,EAMd,OAFAb,EAAOM,GAAQjW,EAERA,GAkBTsU,EAAItW,UAAUqX,SAAW,SAAmB7W,GAC1CiC,EAAsB,IAAfjC,EAAE+C,SAAgB,iCACzBd,EAAOjC,EAAEY,IAAK,oCAGhBkV,EAAItW,UAAUmX,SAAW,SAAmB3W,EAAG6F,GAC7C5D,EAAqC,KAA7BjC,EAAE+C,SAAW8C,EAAE9C,UAAiB,iCACxCd,EAAOjC,EAAEY,KAAOZ,EAAEY,MAAQiF,EAAEjF,IAC1B,oCAGJkV,EAAItW,UAAU2Y,KAAO,SAAenY,GAClC,OAAIZ,KAAKoC,MAAcpC,KAAKoC,MAAM8W,QAAQtY,GAAGiW,UAAU7W,MAChDY,EAAE4T,KAAKxU,KAAKqR,GAAGwF,UAAU7W,OAGlC0W,EAAItW,UAAU0I,IAAM,SAAclI,GAChC,OAAIA,EAAEqG,SACGrG,EAAEgF,QAGJ5F,KAAKqR,EAAElQ,IAAIP,GAAGiW,UAAU7W,OAGjC0W,EAAItW,UAAUgB,IAAM,SAAcR,EAAG6F,GACnCzG,KAAKuX,SAAS3W,EAAG6F,GAEjB,IAAI7H,EAAMgC,EAAEQ,IAAIqF,GAIhB,OAHI7H,EAAIkC,IAAId,KAAKqR,IAAM,GACrBzS,EAAImL,KAAK/J,KAAKqR,GAETzS,EAAIiY,UAAU7W,OAGvB0W,EAAItW,UAAU0J,KAAO,SAAelJ,EAAG6F,GACrCzG,KAAKuX,SAAS3W,EAAG6F,GAEjB,IAAI7H,EAAMgC,EAAEkJ,KAAKrD,GAIjB,OAHI7H,EAAIkC,IAAId,KAAKqR,IAAM,GACrBzS,EAAImL,KAAK/J,KAAKqR,GAETzS,GAGT8X,EAAItW,UAAUe,IAAM,SAAcP,EAAG6F,GACnCzG,KAAKuX,SAAS3W,EAAG6F,GAEjB,IAAI7H,EAAMgC,EAAEO,IAAIsF,GAIhB,OAHI7H,EAAI+D,KAAK,GAAK,GAChB/D,EAAIkL,KAAK9J,KAAKqR,GAETzS,EAAIiY,UAAU7W,OAGvB0W,EAAItW,UAAU2J,KAAO,SAAenJ,EAAG6F,GACrCzG,KAAKuX,SAAS3W,EAAG6F,GAEjB,IAAI7H,EAAMgC,EAAEmJ,KAAKtD,GAIjB,OAHI7H,EAAI+D,KAAK,GAAK,GAChB/D,EAAIkL,KAAK9J,KAAKqR,GAETzS,GAGT8X,EAAItW,UAAUiX,IAAM,SAAczW,EAAG4D,GAEnC,OADAxE,KAAKyX,SAAS7W,GACPZ,KAAK+Y,KAAKnY,EAAEyS,MAAM7O,KAG3BkS,EAAItW,UAAU2N,KAAO,SAAenN,EAAG6F,GAErC,OADAzG,KAAKuX,SAAS3W,EAAG6F,GACVzG,KAAK+Y,KAAKnY,EAAEmN,KAAKtH,KAG1BiQ,EAAItW,UAAUmE,IAAM,SAAc3D,EAAG6F,GAEnC,OADAzG,KAAKuX,SAAS3W,EAAG6F,GACVzG,KAAK+Y,KAAKnY,EAAE2D,IAAIkC,KAGzBiQ,EAAItW,UAAUoS,KAAO,SAAe5R,GAClC,OAAOZ,KAAK+N,KAAKnN,EAAGA,EAAEgF,UAGxB8Q,EAAItW,UAAUmS,IAAM,SAAc3R,GAChC,OAAOZ,KAAKuE,IAAI3D,EAAGA,IAGrB8V,EAAItW,UAAUwX,KAAO,SAAehX,GAClC,GAAIA,EAAEqG,SAAU,OAAOrG,EAAEgF,QAEzB,IAAIiU,EAAO7Z,KAAKqR,EAAEvJ,MAAM,GAIxB,GAHAjF,EAAOgX,EAAO,IAAM,GAGP,IAATA,EAAY,CACd,IAAIpU,EAAMzF,KAAKqR,EAAEjQ,IAAI,IAAIkC,EAAG,IAAIyE,OAAO,GACvC,OAAO/H,KAAKyF,IAAI7E,EAAG6E,GAMrB,IAAIoC,EAAI7H,KAAKqR,EAAEvP,KAAK,GAChBC,EAAI,EACR,OAAQ8F,EAAEZ,UAA2B,IAAfY,EAAEC,MAAM,GAC5B/F,IACA8F,EAAEE,OAAO,GAEXlF,GAAQgF,EAAEZ,UAEV,IAAI6S,EAAM,IAAIxW,EAAG,GAAG3B,MAAM3B,MACtB+Z,EAAOD,EAAIhC,SAIXkC,EAAOha,KAAKqR,EAAEvP,KAAK,GAAGiG,OAAO,GAC7BkS,EAAIja,KAAKqR,EAAE7Q,YACfyZ,EAAI,IAAI3W,EAAG,EAAI2W,EAAIA,GAAGtY,MAAM3B,MAE5B,MAAuC,IAAhCA,KAAKyF,IAAIwU,EAAGD,GAAMlZ,IAAIiZ,GAC3BE,EAAEhD,QAAQ8C,GAGZ,IAAI7a,EAAIc,KAAKyF,IAAIwU,EAAGpS,GAChBzD,EAAIpE,KAAKyF,IAAI7E,EAAGiH,EAAE6L,KAAK,GAAG3L,OAAO,IACjCG,EAAIlI,KAAKyF,IAAI7E,EAAGiH,GAChBwJ,EAAItP,EACR,MAAsB,IAAfmG,EAAEpH,IAAIgZ,GAAY,CAEvB,IADA,IAAIxB,EAAMpQ,EACDrJ,EAAI,EAAoB,IAAjByZ,EAAIxX,IAAIgZ,GAAYjb,IAClCyZ,EAAMA,EAAI/V,SAEZM,EAAOhE,EAAIwS,GACX,IAAI5K,EAAIzG,KAAKyF,IAAIvG,EAAG,IAAIoE,EAAG,GAAGmP,OAAOpB,EAAIxS,EAAI,IAE7CuF,EAAIA,EAAEkT,OAAO7Q,GACbvH,EAAIuH,EAAElE,SACN2F,EAAIA,EAAEoP,OAAOpY,GACbmS,EAAIxS,EAGN,OAAOuF,GAGTsS,EAAItW,UAAUyV,KAAO,SAAejV,GAClC,IAAIsZ,EAAMtZ,EAAE6U,OAAOzV,KAAKqR,GACxB,OAAqB,IAAjB6I,EAAIvW,UACNuW,EAAIvW,SAAW,EACR3D,KAAK+Y,KAAKmB,GAAKpC,UAEf9X,KAAK+Y,KAAKmB,IAIrBxD,EAAItW,UAAUqF,IAAM,SAAc7E,EAAG4D,GACnC,GAAIA,EAAIyC,SAAU,OAAO,IAAI3D,EAAG,GAAG3B,MAAM3B,MACzC,GAAoB,IAAhBwE,EAAI7B,KAAK,GAAU,OAAO/B,EAAEgF,QAEhC,IAAIuU,EAAa,EACbC,EAAM,IAAI3b,MAAM,GAAK0b,GACzBC,EAAI,GAAK,IAAI9W,EAAG,GAAG3B,MAAM3B,MACzBoa,EAAI,GAAKxZ,EACT,IAAK,IAAI/B,EAAI,EAAGA,EAAIub,EAAItb,OAAQD,IAC9Bub,EAAIvb,GAAKmB,KAAKuE,IAAI6V,EAAIvb,EAAI,GAAI+B,GAGhC,IAAIhC,EAAMwb,EAAI,GACVC,EAAU,EACVC,EAAa,EACbtZ,EAAQwD,EAAIhE,YAAc,GAK9B,IAJc,IAAVQ,IACFA,EAAQ,IAGLnC,EAAI2F,EAAI1F,OAAS,EAAGD,GAAK,EAAGA,IAAK,CAEpC,IADA,IAAIU,EAAOiF,EAAIZ,MAAM/E,GACZmG,EAAIhE,EAAQ,EAAGgE,GAAK,EAAGA,IAAK,CACnC,IAAIoB,EAAO7G,GAAQyF,EAAK,EACpBpG,IAAQwb,EAAI,KACdxb,EAAMoB,KAAKuS,IAAI3T,IAGL,IAARwH,GAAyB,IAAZiU,GAKjBA,IAAY,EACZA,GAAWjU,EACXkU,KACIA,IAAeH,GAAqB,IAANtb,GAAiB,IAANmG,KAE7CpG,EAAMoB,KAAKuE,IAAI3F,EAAKwb,EAAIC,IACxBC,EAAa,EACbD,EAAU,IAXRC,EAAa,EAajBtZ,EAAQ,GAGV,OAAOpC,GAGT8X,EAAItW,UAAUwW,UAAY,SAAoBpS,GAC5C,IAAIJ,EAAII,EAAIgQ,KAAKxU,KAAKqR,GAEtB,OAAOjN,IAAMI,EAAMJ,EAAEwB,QAAUxB,GAGjCsS,EAAItW,UAAU0W,YAAc,SAAsBtS,GAChD,IAAI5F,EAAM4F,EAAIoB,QAEd,OADAhH,EAAI4C,IAAM,KACH5C,GAOT0E,EAAG7B,KAAO,SAAe+C,GACvB,OAAO,IAAIsU,EAAKtU,IAmBlBxB,EAAS8V,EAAMpC,GAEfoC,EAAK1Y,UAAUwW,UAAY,SAAoBpS,GAC7C,OAAOxE,KAAK+Y,KAAKvU,EAAI6O,MAAMrT,KAAK6T,SAGlCiF,EAAK1Y,UAAU0W,YAAc,SAAsBtS,GACjD,IAAIJ,EAAIpE,KAAK+Y,KAAKvU,EAAID,IAAIvE,KAAKgZ,OAE/B,OADA5U,EAAE5C,IAAM,KACD4C,GAGT0U,EAAK1Y,UAAU2N,KAAO,SAAenN,EAAG6F,GACtC,GAAI7F,EAAEqG,UAAYR,EAAEQ,SAGlB,OAFArG,EAAEgD,MAAM,GAAK,EACbhD,EAAE9B,OAAS,EACJ8B,EAGT,IAAIsH,EAAItH,EAAEmN,KAAKtH,GACXvH,EAAIgJ,EAAEsL,MAAMxT,KAAK6T,OAAOtP,IAAIvE,KAAKiZ,MAAM1F,OAAOvT,KAAK6T,OAAOtP,IAAIvE,KAAKqR,GACnEkJ,EAAIrS,EAAE6B,KAAK7K,GAAG6I,OAAO/H,KAAK6T,OAC1BjV,EAAM2b,EAQV,OANIA,EAAEzZ,IAAId,KAAKqR,IAAM,EACnBzS,EAAM2b,EAAExQ,KAAK/J,KAAKqR,GACTkJ,EAAE5X,KAAK,GAAK,IACrB/D,EAAM2b,EAAEzQ,KAAK9J,KAAKqR,IAGbzS,EAAIiY,UAAU7W,OAGvB8Y,EAAK1Y,UAAUmE,IAAM,SAAc3D,EAAG6F,GACpC,GAAI7F,EAAEqG,UAAYR,EAAEQ,SAAU,OAAO,IAAI3D,EAAG,GAAGuT,UAAU7W,MAEzD,IAAIkI,EAAItH,EAAE2D,IAAIkC,GACVvH,EAAIgJ,EAAEsL,MAAMxT,KAAK6T,OAAOtP,IAAIvE,KAAKiZ,MAAM1F,OAAOvT,KAAK6T,OAAOtP,IAAIvE,KAAKqR,GACnEkJ,EAAIrS,EAAE6B,KAAK7K,GAAG6I,OAAO/H,KAAK6T,OAC1BjV,EAAM2b,EAOV,OANIA,EAAEzZ,IAAId,KAAKqR,IAAM,EACnBzS,EAAM2b,EAAExQ,KAAK/J,KAAKqR,GACTkJ,EAAE5X,KAAK,GAAK,IACrB/D,EAAM2b,EAAEzQ,KAAK9J,KAAKqR,IAGbzS,EAAIiY,UAAU7W,OAGvB8Y,EAAK1Y,UAAUyV,KAAO,SAAejV,GAEnC,IAAIhC,EAAMoB,KAAK+Y,KAAKnY,EAAE6U,OAAOzV,KAAKqR,GAAG9M,IAAIvE,KAAK4U,KAC9C,OAAOhW,EAAIiY,UAAU7W,QAt2GzB,CAw2GoCE,EAAQF,Q,4CCt2G5C,SAAS6C,EAAOC,EAAKvE,GACnB,IAAKuE,EACH,MAAM,IAAIC,MAAMxE,GAAO,oBAJ3B2B,EAAO7B,QAAUwE,EAOjBA,EAAO2X,MAAQ,SAAqB3K,EAAGzL,EAAG7F,GACxC,GAAIsR,GAAKzL,EACP,MAAM,IAAIrB,MAAMxE,GAAQ,qBAAuBsR,EAAI,OAASzL","file":"js/chunk-vendors~cf02cf8d.63a24266.js","sourcesContent":["'use strict';\n\nvar utils = exports;\n\nfunction toArray(msg, enc) {\n  if (Array.isArray(msg))\n    return msg.slice();\n  if (!msg)\n    return [];\n  var res = [];\n  if (typeof msg !== 'string') {\n    for (var i = 0; i < msg.length; i++)\n      res[i] = msg[i] | 0;\n    return res;\n  }\n  if (enc === 'hex') {\n    msg = msg.replace(/[^a-z0-9]+/ig, '');\n    if (msg.length % 2 !== 0)\n      msg = '0' + msg;\n    for (var i = 0; i < msg.length; i += 2)\n      res.push(parseInt(msg[i] + msg[i + 1], 16));\n  } else {\n    for (var i = 0; i < msg.length; i++) {\n      var c = msg.charCodeAt(i);\n      var hi = c >> 8;\n      var lo = c & 0xff;\n      if (hi)\n        res.push(hi, lo);\n      else\n        res.push(lo);\n    }\n  }\n  return res;\n}\nutils.toArray = toArray;\n\nfunction zero2(word) {\n  if (word.length === 1)\n    return '0' + word;\n  else\n    return word;\n}\nutils.zero2 = zero2;\n\nfunction toHex(msg) {\n  var res = '';\n  for (var i = 0; i < msg.length; i++)\n    res += zero2(msg[i].toString(16));\n  return res;\n}\nutils.toHex = toHex;\n\nutils.encode = function encode(arr, enc) {\n  if (enc === 'hex')\n    return toHex(arr);\n  else\n    return arr;\n};\n","var bn = require('bn.js');\nvar brorand = require('brorand');\n\nfunction MillerRabin(rand) {\n  this.rand = rand || new brorand.Rand();\n}\nmodule.exports = MillerRabin;\n\nMillerRabin.create = function create(rand) {\n  return new MillerRabin(rand);\n};\n\nMillerRabin.prototype._randbelow = function _randbelow(n) {\n  var len = n.bitLength();\n  var min_bytes = Math.ceil(len / 8);\n\n  // Generage random bytes until a number less than n is found.\n  // This ensures that 0..n-1 have an equal probability of being selected.\n  do\n    var a = new bn(this.rand.generate(min_bytes));\n  while (a.cmp(n) >= 0);\n\n  return a;\n};\n\nMillerRabin.prototype._randrange = function _randrange(start, stop) {\n  // Generate a random number greater than or equal to start and less than stop.\n  var size = stop.sub(start);\n  return start.add(this._randbelow(size));\n};\n\nMillerRabin.prototype.test = function test(n, k, cb) {\n  var len = n.bitLength();\n  var red = bn.mont(n);\n  var rone = new bn(1).toRed(red);\n\n  if (!k)\n    k = Math.max(1, (len / 48) | 0);\n\n  // Find d and s, (n - 1) = (2 ^ s) * d;\n  var n1 = n.subn(1);\n  for (var s = 0; !n1.testn(s); s++) {}\n  var d = n.shrn(s);\n\n  var rn1 = n1.toRed(red);\n\n  var prime = true;\n  for (; k > 0; k--) {\n    var a = this._randrange(new bn(2), n1);\n    if (cb)\n      cb(a);\n\n    var x = a.toRed(red).redPow(d);\n    if (x.cmp(rone) === 0 || x.cmp(rn1) === 0)\n      continue;\n\n    for (var i = 1; i < s; i++) {\n      x = x.redSqr();\n\n      if (x.cmp(rone) === 0)\n        return false;\n      if (x.cmp(rn1) === 0)\n        break;\n    }\n\n    if (i === s)\n      return false;\n  }\n\n  return prime;\n};\n\nMillerRabin.prototype.getDivisor = function getDivisor(n, k) {\n  var len = n.bitLength();\n  var red = bn.mont(n);\n  var rone = new bn(1).toRed(red);\n\n  if (!k)\n    k = Math.max(1, (len / 48) | 0);\n\n  // Find d and s, (n - 1) = (2 ^ s) * d;\n  var n1 = n.subn(1);\n  for (var s = 0; !n1.testn(s); s++) {}\n  var d = n.shrn(s);\n\n  var rn1 = n1.toRed(red);\n\n  for (; k > 0; k--) {\n    var a = this._randrange(new bn(2), n1);\n\n    var g = n.gcd(a);\n    if (g.cmpn(1) !== 0)\n      return g;\n\n    var x = a.toRed(red).redPow(d);\n    if (x.cmp(rone) === 0 || x.cmp(rn1) === 0)\n      continue;\n\n    for (var i = 1; i < s; i++) {\n      x = x.redSqr();\n\n      if (x.cmp(rone) === 0)\n        return x.fromRed().subn(1).gcd(n);\n      if (x.cmp(rn1) === 0)\n        break;\n    }\n\n    if (i === s) {\n      x = x.redSqr();\n      return x.fromRed().subn(1).gcd(n);\n    }\n  }\n\n  return false;\n};\n","(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    for (var i = start; i < len; i++) {\n      var c = str.charCodeAt(i) - 48;\n\n      r <<= 4;\n\n      // 'a' - 'f'\n      if (c >= 49 && c <= 54) {\n        r |= c - 49 + 0xa;\n\n      // 'A' - 'F'\n      } else if (c >= 17 && c <= 22) {\n        r |= c - 17 + 0xa;\n\n      // '0' - '9'\n      } else {\n        r |= c & 0xf;\n      }\n    }\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 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        r += c - 49 + 0xa;\n\n      // 'A'\n      } else if (c >= 17) {\n        r += c - 17 + 0xa;\n\n      // '0' - '9'\n      } else {\n        r += c;\n      }\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  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  BN.prototype.inspect = 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.modn(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);\n  };\n\n  BN.prototype.toBuffer = function toBuffer (endian, length) {\n    assert(typeof Buffer !== 'undefined');\n    return this.toArrayLike(Buffer, endian, length);\n  };\n\n  BN.prototype.toArray = function toArray (endian, length) {\n    return this.toArrayLike(Array, endian, length);\n  };\n\n  BN.prototype.toArrayLike = function toArrayLike (ArrayType, endian, length) {\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    this.strip();\n    var littleEndian = endian === 'le';\n    var res = new ArrayType(reqLength);\n\n    var b, i;\n    var q = this.clone();\n    if (!littleEndian) {\n      // Assume big-endian\n      for (i = 0; i < reqLength - byteLength; i++) {\n        res[i] = 0;\n      }\n\n      for (i = 0; !q.isZero(); i++) {\n        b = q.andln(0xff);\n        q.iushrn(8);\n\n        res[reqLength - i - 1] = b;\n      }\n    } else {\n      for (i = 0; !q.isZero(); i++) {\n        b = q.andln(0xff);\n        q.iushrn(8);\n\n        res[i] = b;\n      }\n\n      for (; i < reqLength; i++) {\n        res[i] = 0;\n      }\n    }\n\n    return res;\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] & (1 << wbit)) >>> wbit;\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    var fftm = new FFTM();\n    return fftm.mulp(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    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 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.modn(num.words[0]))\n        };\n      }\n\n      return {\n        div: this.divn(num.words[0]),\n        mod: new BN(this.modn(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.modn = function modn (num) {\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 acc;\n  };\n\n  // In-place division by number\n  BN.prototype.idivn = function idivn (num) {\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    return this.strip();\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 BN v4 instance\n        r.strip();\n      } else {\n        // r is 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    return a.umod(this.m)._forceRed(this);\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","module.exports = assert;\n\nfunction assert(val, msg) {\n  if (!val)\n    throw new Error(msg || 'Assertion failed');\n}\n\nassert.equal = function assertEqual(l, r, msg) {\n  if (l != r)\n    throw new Error(msg || ('Assertion failed: ' + l + ' != ' + r));\n};\n"],"sourceRoot":""}