{"version":3,"sources":["webpack:///./node_modules/diffie-hellman/browser.js","webpack:///./node_modules/des.js/lib/des/cipher.js","webpack:///./node_modules/des.js/lib/des/cbc.js","webpack:///./node_modules/des.js/lib/des.js","webpack:///./node_modules/des.js/lib/des/ede.js","webpack:///./node_modules/ecdsa-sig-formatter/src/param-bytes-for-alg.js","webpack:///./node_modules/diffie-hellman/node_modules/bn.js/lib/bn.js","webpack:///./node_modules/des.js/lib/des/des.js","webpack:///./node_modules/diffie-hellman/lib/dh.js","webpack:///./node_modules/diffie-hellman/lib/generatePrime.js","webpack:///./node_modules/des.js/lib/des/utils.js","webpack:///./node_modules/ecdsa-sig-formatter/src/ecdsa-sig-formatter.js"],"names":["primes","DH","getDiffieHellman","mod","prime","Buffer","gen","ENCODINGS","createDiffieHellman","enc","generator","genc","isBuffer","undefined","generatePrime","exports","DiffieHellmanGroup","createDiffieHellmanGroup","DiffieHellman","assert","Cipher","options","this","type","blockSize","_init","buffer","Array","bufferOff","module","prototype","update","data","length","_updateDecrypt","_updateEncrypt","_buffer","off","min","Math","i","_flushBuffer","out","_update","inputOff","outputOff","count","max","ceil","final","first","last","_finalEncrypt","_finalDecrypt","concat","_pad","_unpad","equal","inherits","proto","CBCState","iv","instantiate","Base","CBC","call","_cbcInit","keys","Object","key","create","state","_cbcState","inp","inOff","outOff","superProto","constructor","super_","utils","DES","EDE","EDEState","k1","slice","k2","k3","ciphers","_edeState","getParamSize","keySize","result","paramBytesForAlg","ES256","ES384","ES512","getParamBytesForAlg","alg","paramBytes","Error","val","msg","ctor","superCtor","TempCtor","BN","number","base","endian","isBN","negative","words","red","wordSize","e","parseHex","str","start","end","r","len","c","charCodeAt","parseBase","mul","num","isArray","left","right","cmp","_initNumber","_initArray","toString","replace","_parseHex","_parseBase","strip","toArray","j","w","limbLen","limbPow","total","word","imuln","_iaddn","pow","copy","dest","clone","_expand","size","_normSign","inspect","zeros","groupSizes","groupBases","toBitArray","bitLength","bit","wbit","smallMulTo","self","a","b","lo","carry","k","ncarry","rword","maxJ","padding","groupSize","groupBase","isZero","modn","idivn","toNumber","ret","toJSON","toBuffer","toArrayLike","ArrayType","byteLength","reqLength","littleEndian","res","q","andln","iushrn","clz32","_countBits","t","_zeroBits","hi","zeroBits","toTwos","width","abs","inotn","iaddn","fromTwos","testn","notn","ineg","isNeg","neg","iuor","ior","or","uor","iuand","iand","and","uand","iuxor","ixor","xor","uxor","bytesNeeded","bitsLeft","setn","iadd","isub","add","sub","comb10MulTo","mid","o","a0","al0","ah0","a1","al1","ah1","a2","al2","ah2","a3","al3","ah3","a4","al4","ah4","a5","al5","ah5","a6","al6","ah6","a7","al7","ah7","a8","al8","ah8","a9","al9","ah9","b0","bl0","bh0","b1","bl1","bh1","b2","bl2","bh2","b3","bl3","bh3","b4","bl4","bh4","b5","bl5","bh5","b6","bl6","bh6","b7","bl7","bh7","b8","bl8","bh8","b9","bl9","bh9","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","x","y","mulTo","makeRBT","N","l","revBin","rb","permute","rbt","rws","iws","rtws","itws","transform","s","rtwdf","cos","PI","itwdf","sin","p","rtwdf_","itwdf_","re","ie","ro","io","rx","guessLen13b","n","m","odd","conjugate","normalize13b","ws","round","convert13b","stub","ph","_","rwst","iwst","nrws","nrwst","niwst","rmws","mulf","muln","sqr","isqr","iushln","bits","carryMask","newCarry","ishln","hint","extended","h","mask","maskedWords","ishrn","shln","ushln","shrn","ushrn","imaskn","maskn","isubn","addn","subn","iabs","_ishlnsubmul","shift","_wordDiv","mode","bhi","bhiBits","diff","qj","div","divmod","positive","divn","umod","divRound","dm","half","r2","acc","egcd","A","B","C","D","g","isEven","yp","xp","im","isOdd","jm","gcd","_invmp","x1","x2","delta","cmpn","invm","bincn","ucmp","gtn","gt","gten","gte","ltn","lt","lten","lte","eqn","eq","Red","toRed","ctx","convertTo","_forceRed","fromRed","convertFrom","forceRed","redAdd","redIAdd","redSub","redISub","redShl","shl","redMul","_verify2","redIMul","redSqr","_verify1","redISqr","redSqrt","sqrt","redInvm","redNeg","redPow","k256","p224","p192","p25519","MPrime","name","tmp","_tmp","K256","P224","P192","P25519","_prime","Mont","imod","rinv","minv","ireduce","rlen","split","imulK","_strip","input","output","outLen","prev","next","mod3","one","nOne","lpow","z","inv","windowSize","wnd","current","currentLen","mont","u","DESState","_desState","deriveKeys","shiftTable","kL","readUInt32BE","kR","pc1","r28shl","pc2","ip","_encrypt","_decrypt","writeUInt32BE","value","pad","lStart","rStart","keyL","keyR","expand","substitute","f","rip","MillerRabin","millerRabin","TWENTYFOUR","ELEVEN","TEN","THREE","SEVEN","randomBytes","setPublicKey","pub","_pub","setPrivateKey","priv","_priv","primeCache","checkPrime","hex","join","rem","error","simpleSieve","fermatTest","test","malleable","setGenerator","__prime","_primeLen","_primeCode","formatReturnValue","bn","buf","defineProperty","enumerable","get","__gen","generateKeys","_gen","getPublicKey","computeSecret","other","secret","getPrime","front","fill","getPrivateKey","getGenerator","findPrime","ONE","TWO","FIVE","FOUR","_getPrimes","limit","n2","bytes","inL","inR","outL","outR","pc2table","sTable","sb","permuteTable","padSplit","group","push","MAX_OCTET","CLASS_UNIVERSAL","PRIMITIVE_BIT","TAG_SEQ","TAG_INT","ENCODED_TAG_SEQ","ENCODED_TAG_INT","base64Url","base64","signatureAsBuffer","signature","from","TypeError","derToJose","maxEncodedParamLength","inputLength","offset","seqLength","rLength","rOffset","sLength","sOffset","rPadding","sPadding","dst","allocUnsafe","countPadding","stop","needsSign","joseToDer","signatureBytes","rsBytes","shortLength"],"mappings":"8GAAA,kBAAoB,EAAQ,QACxBA,EAAS,EAAQ,QAEjBC,EAAK,EAAQ,QAEjB,SAASC,EAAkBC,GACzB,IAAIC,EAAQ,IAAIC,EAAOL,EAAOG,GAAKC,MAAO,OACtCE,EAAM,IAAID,EAAOL,EAAOG,GAAKG,IAAK,OAEtC,OAAO,IAAIL,EAAGG,EAAOE,GAGvB,IAAIC,EAAY,CACd,QAAU,EAAM,KAAO,EAAM,QAAU,GAGzC,SAASC,EAAqBJ,EAAOK,EAAKC,EAAWC,GACnD,OAAIN,EAAOO,SAASH,SAA2BI,IAAnBN,EAAUE,GAC7BD,EAAoBJ,EAAO,SAAUK,EAAKC,IAGnDD,EAAMA,GAAO,SACbE,EAAOA,GAAQ,SACfD,EAAYA,GAAa,IAAIL,EAAO,CAAC,IAEhCA,EAAOO,SAASF,KACnBA,EAAY,IAAIL,EAAOK,EAAWC,IAGf,kBAAVP,EACF,IAAIH,EAAGa,EAAcV,EAAOM,GAAYA,GAAW,IAGvDL,EAAOO,SAASR,KACnBA,EAAQ,IAAIC,EAAOD,EAAOK,IAGrB,IAAIR,EAAGG,EAAOM,GAAW,KAGlCK,EAAQC,mBAAqBD,EAAQE,yBAA2BF,EAAQb,iBAAmBA,EAC3Fa,EAAQP,oBAAsBO,EAAQG,cAAgBV,I,iECvCtD,IAAIW,EAAS,EAAQ,QAErB,SAASC,EAAOC,GACdC,KAAKD,QAAUA,EAEfC,KAAKC,KAAOD,KAAKD,QAAQE,KACzBD,KAAKE,UAAY,EACjBF,KAAKG,QAELH,KAAKI,OAAS,IAAIC,MAAML,KAAKE,WAC7BF,KAAKM,UAAY,EAEnBC,EAAOd,QAAUK,EAEjBA,EAAOU,UAAUL,MAAQ,aAIzBL,EAAOU,UAAUC,OAAS,SAAgBC,GACxC,OAAoB,IAAhBA,EAAKC,OACA,GAES,YAAdX,KAAKC,KACAD,KAAKY,eAAeF,GAEpBV,KAAKa,eAAeH,IAG/BZ,EAAOU,UAAUM,QAAU,SAAiBJ,EAAMK,GAGhD,IADA,IAAIC,EAAMC,KAAKD,IAAIhB,KAAKI,OAAOO,OAASX,KAAKM,UAAWI,EAAKC,OAASI,GAC7DG,EAAI,EAAGA,EAAIF,EAAKE,IACvBlB,KAAKI,OAAOJ,KAAKM,UAAYY,GAAKR,EAAKK,EAAMG,GAI/C,OAHAlB,KAAKM,WAAaU,EAGXA,GAGTlB,EAAOU,UAAUW,aAAe,SAAsBC,EAAKL,GAGzD,OAFAf,KAAKqB,QAAQrB,KAAKI,OAAQ,EAAGgB,EAAKL,GAClCf,KAAKM,UAAY,EACVN,KAAKE,WAGdJ,EAAOU,UAAUK,eAAiB,SAAwBH,GACxD,IAAIY,EAAW,EACXC,EAAY,EAEZC,GAAUxB,KAAKM,UAAYI,EAAKC,QAAUX,KAAKE,UAAa,EAC5DkB,EAAM,IAAIf,MAAMmB,EAAQxB,KAAKE,WAEV,IAAnBF,KAAKM,YACPgB,GAAYtB,KAAKc,QAAQJ,EAAMY,GAE3BtB,KAAKM,YAAcN,KAAKI,OAAOO,SACjCY,GAAavB,KAAKmB,aAAaC,EAAKG,KAKxC,IADA,IAAIE,EAAMf,EAAKC,QAAWD,EAAKC,OAASW,GAAYtB,KAAKE,UAClDoB,EAAWG,EAAKH,GAAYtB,KAAKE,UACtCF,KAAKqB,QAAQX,EAAMY,EAAUF,EAAKG,GAClCA,GAAavB,KAAKE,UAIpB,KAAOoB,EAAWZ,EAAKC,OAAQW,IAAYtB,KAAKM,YAC9CN,KAAKI,OAAOJ,KAAKM,WAAaI,EAAKY,GAErC,OAAOF,GAGTtB,EAAOU,UAAUI,eAAiB,SAAwBF,GAQxD,IAPA,IAAIY,EAAW,EACXC,EAAY,EAEZC,EAAQP,KAAKS,MAAM1B,KAAKM,UAAYI,EAAKC,QAAUX,KAAKE,WAAa,EACrEkB,EAAM,IAAIf,MAAMmB,EAAQxB,KAAKE,WAG1BsB,EAAQ,EAAGA,IAChBF,GAAYtB,KAAKc,QAAQJ,EAAMY,GAC/BC,GAAavB,KAAKmB,aAAaC,EAAKG,GAMtC,OAFAD,GAAYtB,KAAKc,QAAQJ,EAAMY,GAExBF,GAGTtB,EAAOU,UAAUmB,MAAQ,SAAevB,GACtC,IAAIwB,EAIAC,EAMJ,OATIzB,IACFwB,EAAQ5B,KAAKS,OAAOL,IAIpByB,EADgB,YAAd7B,KAAKC,KACAD,KAAK8B,gBAEL9B,KAAK+B,gBAEVH,EACKA,EAAMI,OAAOH,GAEbA,GAGX/B,EAAOU,UAAUyB,KAAO,SAAc7B,EAAQW,GAC5C,GAAY,IAARA,EACF,OAAO,EAET,MAAOA,EAAMX,EAAOO,OAClBP,EAAOW,KAAS,EAElB,OAAO,GAGTjB,EAAOU,UAAUsB,cAAgB,WAC/B,IAAK9B,KAAKiC,KAAKjC,KAAKI,OAAQJ,KAAKM,WAC/B,MAAO,GAET,IAAIc,EAAM,IAAIf,MAAML,KAAKE,WAEzB,OADAF,KAAKqB,QAAQrB,KAAKI,OAAQ,EAAGgB,EAAK,GAC3BA,GAGTtB,EAAOU,UAAU0B,OAAS,SAAgB9B,GACxC,OAAOA,GAGTN,EAAOU,UAAUuB,cAAgB,WAC/BlC,EAAOsC,MAAMnC,KAAKM,UAAWN,KAAKE,UAAW,8BAC7C,IAAIkB,EAAM,IAAIf,MAAML,KAAKE,WAGzB,OAFAF,KAAKmB,aAAaC,EAAK,GAEhBpB,KAAKkC,OAAOd,K,oCCzIrB,IAAIvB,EAAS,EAAQ,QACjBuC,EAAW,EAAQ,QAEnBC,EAAQ,GAEZ,SAASC,EAASC,GAChB1C,EAAOsC,MAAMI,EAAG5B,OAAQ,EAAG,qBAE3BX,KAAKuC,GAAK,IAAIlC,MAAM,GACpB,IAAK,IAAIa,EAAI,EAAGA,EAAIlB,KAAKuC,GAAG5B,OAAQO,IAClClB,KAAKuC,GAAGrB,GAAKqB,EAAGrB,GAGpB,SAASsB,EAAYC,GACnB,SAASC,EAAI3C,GACX0C,EAAKE,KAAK3C,KAAMD,GAChBC,KAAK4C,WAEPR,EAASM,EAAKD,GAGd,IADA,IAAII,EAAOC,OAAOD,KAAKR,GACdnB,EAAI,EAAGA,EAAI2B,EAAKlC,OAAQO,IAAK,CACpC,IAAI6B,EAAMF,EAAK3B,GACfwB,EAAIlC,UAAUuC,GAAOV,EAAMU,GAO7B,OAJAL,EAAIM,OAAS,SAAgBjD,GAC3B,OAAO,IAAI2C,EAAI3C,IAGV2C,EAGTjD,EAAQ+C,YAAcA,EAEtBH,EAAMO,SAAW,WACf,IAAIK,EAAQ,IAAIX,EAAStC,KAAKD,QAAQwC,IACtCvC,KAAKkD,UAAYD,GAGnBZ,EAAMhB,QAAU,SAAiB8B,EAAKC,EAAOhC,EAAKiC,GAChD,IAAIJ,EAAQjD,KAAKkD,UACbI,EAAatD,KAAKuD,YAAYC,OAAOhD,UAErC+B,EAAKU,EAAMV,GACf,GAAkB,YAAdvC,KAAKC,KAAoB,CAC3B,IAAK,IAAIiB,EAAI,EAAGA,EAAIlB,KAAKE,UAAWgB,IAClCqB,EAAGrB,IAAMiC,EAAIC,EAAQlC,GAEvBoC,EAAWjC,QAAQsB,KAAK3C,KAAMuC,EAAI,EAAGnB,EAAKiC,GAE1C,IAASnC,EAAI,EAAGA,EAAIlB,KAAKE,UAAWgB,IAClCqB,EAAGrB,GAAKE,EAAIiC,EAASnC,OAClB,CACLoC,EAAWjC,QAAQsB,KAAK3C,KAAMmD,EAAKC,EAAOhC,EAAKiC,GAE/C,IAASnC,EAAI,EAAGA,EAAIlB,KAAKE,UAAWgB,IAClCE,EAAIiC,EAASnC,IAAMqB,EAAGrB,GAExB,IAASA,EAAI,EAAGA,EAAIlB,KAAKE,UAAWgB,IAClCqB,EAAGrB,GAAKiC,EAAIC,EAAQlC,M,kCC5D1BzB,EAAQgE,MAAQ,EAAQ,QACxBhE,EAAQK,OAAS,EAAQ,QACzBL,EAAQiE,IAAM,EAAQ,QACtBjE,EAAQiD,IAAM,EAAQ,QACtBjD,EAAQkE,IAAM,EAAQ,S,oCCJtB,IAAI9D,EAAS,EAAQ,QACjBuC,EAAW,EAAQ,QAEnBtC,EAAS,EAAQ,QACjB4D,EAAM,EAAQ,QAElB,SAASE,EAAS3D,EAAM8C,GACtBlD,EAAOsC,MAAMY,EAAIpC,OAAQ,GAAI,sBAE7B,IAAIkD,EAAKd,EAAIe,MAAM,EAAG,GAClBC,EAAKhB,EAAIe,MAAM,EAAG,IAClBE,EAAKjB,EAAIe,MAAM,GAAI,IAGrB9D,KAAKiE,QADM,YAAThE,EACa,CACbyD,EAAIV,OAAO,CAAE/C,KAAM,UAAW8C,IAAKc,IACnCH,EAAIV,OAAO,CAAE/C,KAAM,UAAW8C,IAAKgB,IACnCL,EAAIV,OAAO,CAAE/C,KAAM,UAAW8C,IAAKiB,KAGtB,CACbN,EAAIV,OAAO,CAAE/C,KAAM,UAAW8C,IAAKiB,IACnCN,EAAIV,OAAO,CAAE/C,KAAM,UAAW8C,IAAKgB,IACnCL,EAAIV,OAAO,CAAE/C,KAAM,UAAW8C,IAAKc,KAKzC,SAASF,EAAI5D,GACXD,EAAO6C,KAAK3C,KAAMD,GAElB,IAAIkD,EAAQ,IAAIW,EAAS5D,KAAKC,KAAMD,KAAKD,QAAQgD,KACjD/C,KAAKkE,UAAYjB,EAEnBb,EAASuB,EAAK7D,GAEdS,EAAOd,QAAUkE,EAEjBA,EAAIX,OAAS,SAAgBjD,GAC3B,OAAO,IAAI4D,EAAI5D,IAGjB4D,EAAInD,UAAUa,QAAU,SAAiB8B,EAAKC,EAAOhC,EAAKiC,GACxD,IAAIJ,EAAQjD,KAAKkE,UAEjBjB,EAAMgB,QAAQ,GAAG5C,QAAQ8B,EAAKC,EAAOhC,EAAKiC,GAC1CJ,EAAMgB,QAAQ,GAAG5C,QAAQD,EAAKiC,EAAQjC,EAAKiC,GAC3CJ,EAAMgB,QAAQ,GAAG5C,QAAQD,EAAKiC,EAAQjC,EAAKiC,IAG7CM,EAAInD,UAAUyB,KAAOyB,EAAIlD,UAAUyB,KACnC0B,EAAInD,UAAU0B,OAASwB,EAAIlD,UAAU0B,Q,oCCnDrC,SAASiC,EAAaC,GACrB,IAAIC,GAAWD,EAAU,EAAK,IAAMA,EAAU,IAAM,EAAI,EAAI,GAC5D,OAAOC,EAGR,IAAIC,EAAmB,CACtBC,MAAOJ,EAAa,KACpBK,MAAOL,EAAa,KACpBM,MAAON,EAAa,MAGrB,SAASO,EAAoBC,GAC5B,IAAIC,EAAaN,EAAiBK,GAClC,GAAIC,EACH,OAAOA,EAGR,MAAM,IAAIC,MAAM,sBAAwBF,EAAM,KAG/CpE,EAAOd,QAAUiF,G,wBCtBjB,2BACE,aAGA,SAAS7E,EAAQiF,EAAKC,GACpB,IAAKD,EAAK,MAAM,IAAID,MAAME,GAAO,oBAKnC,SAAS3C,EAAU4C,EAAMC,GACvBD,EAAKxB,OAASyB,EACd,IAAIC,EAAW,aACfA,EAAS1E,UAAYyE,EAAUzE,UAC/BwE,EAAKxE,UAAY,IAAI0E,EACrBF,EAAKxE,UAAU+C,YAAcyB,EAK/B,SAASG,EAAIC,EAAQC,EAAMC,GACzB,GAAIH,EAAGI,KAAKH,GACV,OAAOA,EAGTpF,KAAKwF,SAAW,EAChBxF,KAAKyF,MAAQ,KACbzF,KAAKW,OAAS,EAGdX,KAAK0F,IAAM,KAEI,OAAXN,IACW,OAATC,GAA0B,OAATA,IACnBC,EAASD,EACTA,EAAO,IAGTrF,KAAKG,MAAMiF,GAAU,EAAGC,GAAQ,GAAIC,GAAU,OAYlD,IAAIvG,EATkB,kBAAXwB,EACTA,EAAOd,QAAU0F,EAEjB1F,EAAQ0F,GAAKA,EAGfA,EAAGA,GAAKA,EACRA,EAAGQ,SAAW,GAGd,IACE5G,EAAS,EAAQ,GAAUA,OAC3B,MAAO6G,IAoIT,SAASC,EAAUC,EAAKC,EAAOC,GAG7B,IAFA,IAAIC,EAAI,EACJC,EAAMjF,KAAKD,IAAI8E,EAAInF,OAAQqF,GACtB9E,EAAI6E,EAAO7E,EAAIgF,EAAKhF,IAAK,CAChC,IAAIiF,EAAIL,EAAIM,WAAWlF,GAAK,GAE5B+E,IAAM,EAIJA,GADEE,GAAK,IAAMA,GAAK,GACbA,EAAI,GAAK,GAGLA,GAAK,IAAMA,GAAK,GACpBA,EAAI,GAAK,GAIL,GAAJA,EAGT,OAAOF,EAiCT,SAASI,EAAWP,EAAKC,EAAOC,EAAKM,GAGnC,IAFA,IAAIL,EAAI,EACJC,EAAMjF,KAAKD,IAAI8E,EAAInF,OAAQqF,GACtB9E,EAAI6E,EAAO7E,EAAIgF,EAAKhF,IAAK,CAChC,IAAIiF,EAAIL,EAAIM,WAAWlF,GAAK,GAE5B+E,GAAKK,EAIHL,GADEE,GAAK,GACFA,EAAI,GAAK,GAGLA,GAAK,GACTA,EAAI,GAAK,GAITA,EAGT,OAAOF,EA5MTd,EAAGI,KAAO,SAAegB,GACvB,OAAIA,aAAepB,GAIJ,OAARoB,GAA+B,kBAARA,GAC5BA,EAAIhD,YAAYoC,WAAaR,EAAGQ,UAAYtF,MAAMmG,QAAQD,EAAId,QAGlEN,EAAG1D,IAAM,SAAcgF,EAAMC,GAC3B,OAAID,EAAKE,IAAID,GAAS,EAAUD,EACzBC,GAGTvB,EAAGnE,IAAM,SAAcyF,EAAMC,GAC3B,OAAID,EAAKE,IAAID,GAAS,EAAUD,EACzBC,GAGTvB,EAAG3E,UAAUL,MAAQ,SAAeiF,EAAQC,EAAMC,GAChD,GAAsB,kBAAXF,EACT,OAAOpF,KAAK4G,YAAYxB,EAAQC,EAAMC,GAGxC,GAAsB,kBAAXF,EACT,OAAOpF,KAAK6G,WAAWzB,EAAQC,EAAMC,GAG1B,QAATD,IACFA,EAAO,IAETxF,EAAOwF,KAAiB,EAAPA,IAAaA,GAAQ,GAAKA,GAAQ,IAEnDD,EAASA,EAAO0B,WAAWC,QAAQ,OAAQ,IAC3C,IAAIhB,EAAQ,EACM,MAAdX,EAAO,IACTW,IAGW,KAATV,EACFrF,KAAKgH,UAAU5B,EAAQW,GAEvB/F,KAAKiH,WAAW7B,EAAQC,EAAMU,GAGd,MAAdX,EAAO,KACTpF,KAAKwF,SAAW,GAGlBxF,KAAKkH,QAEU,OAAX5B,GAEJtF,KAAK6G,WAAW7G,KAAKmH,UAAW9B,EAAMC,IAGxCH,EAAG3E,UAAUoG,YAAc,SAAsBxB,EAAQC,EAAMC,GACzDF,EAAS,IACXpF,KAAKwF,SAAW,EAChBJ,GAAUA,GAERA,EAAS,UACXpF,KAAKyF,MAAQ,CAAW,SAATL,GACfpF,KAAKW,OAAS,GACLyE,EAAS,kBAClBpF,KAAKyF,MAAQ,CACF,SAATL,EACCA,EAAS,SAAa,UAEzBpF,KAAKW,OAAS,IAEdd,EAAOuF,EAAS,kBAChBpF,KAAKyF,MAAQ,CACF,SAATL,EACCA,EAAS,SAAa,SACvB,GAEFpF,KAAKW,OAAS,GAGD,OAAX2E,GAGJtF,KAAK6G,WAAW7G,KAAKmH,UAAW9B,EAAMC,IAGxCH,EAAG3E,UAAUqG,WAAa,SAAqBzB,EAAQC,EAAMC,GAG3D,GADAzF,EAAgC,kBAAlBuF,EAAOzE,QACjByE,EAAOzE,QAAU,EAGnB,OAFAX,KAAKyF,MAAQ,CAAE,GACfzF,KAAKW,OAAS,EACPX,KAGTA,KAAKW,OAASM,KAAKS,KAAK0D,EAAOzE,OAAS,GACxCX,KAAKyF,MAAQ,IAAIpF,MAAML,KAAKW,QAC5B,IAAK,IAAIO,EAAI,EAAGA,EAAIlB,KAAKW,OAAQO,IAC/BlB,KAAKyF,MAAMvE,GAAK,EAGlB,IAAIkG,EAAGC,EACHtG,EAAM,EACV,GAAe,OAAXuE,EACF,IAAKpE,EAAIkE,EAAOzE,OAAS,EAAGyG,EAAI,EAAGlG,GAAK,EAAGA,GAAK,EAC9CmG,EAAIjC,EAAOlE,GAAMkE,EAAOlE,EAAI,IAAM,EAAMkE,EAAOlE,EAAI,IAAM,GACzDlB,KAAKyF,MAAM2B,IAAOC,GAAKtG,EAAO,SAC9Bf,KAAKyF,MAAM2B,EAAI,GAAMC,IAAO,GAAKtG,EAAQ,SACzCA,GAAO,GACHA,GAAO,KACTA,GAAO,GACPqG,UAGC,GAAe,OAAX9B,EACT,IAAKpE,EAAI,EAAGkG,EAAI,EAAGlG,EAAIkE,EAAOzE,OAAQO,GAAK,EACzCmG,EAAIjC,EAAOlE,GAAMkE,EAAOlE,EAAI,IAAM,EAAMkE,EAAOlE,EAAI,IAAM,GACzDlB,KAAKyF,MAAM2B,IAAOC,GAAKtG,EAAO,SAC9Bf,KAAKyF,MAAM2B,EAAI,GAAMC,IAAO,GAAKtG,EAAQ,SACzCA,GAAO,GACHA,GAAO,KACTA,GAAO,GACPqG,KAIN,OAAOpH,KAAKkH,SA2Bd/B,EAAG3E,UAAUwG,UAAY,SAAoB5B,EAAQW,GAEnD/F,KAAKW,OAASM,KAAKS,MAAM0D,EAAOzE,OAASoF,GAAS,GAClD/F,KAAKyF,MAAQ,IAAIpF,MAAML,KAAKW,QAC5B,IAAK,IAAIO,EAAI,EAAGA,EAAIlB,KAAKW,OAAQO,IAC/BlB,KAAKyF,MAAMvE,GAAK,EAGlB,IAAIkG,EAAGC,EAEHtG,EAAM,EACV,IAAKG,EAAIkE,EAAOzE,OAAS,EAAGyG,EAAI,EAAGlG,GAAK6E,EAAO7E,GAAK,EAClDmG,EAAIxB,EAAST,EAAQlE,EAAGA,EAAI,GAC5BlB,KAAKyF,MAAM2B,IAAOC,GAAKtG,EAAO,SAE9Bf,KAAKyF,MAAM2B,EAAI,IAAMC,IAAO,GAAKtG,EAAO,QACxCA,GAAO,GACHA,GAAO,KACTA,GAAO,GACPqG,KAGAlG,EAAI,IAAM6E,IACZsB,EAAIxB,EAAST,EAAQW,EAAO7E,EAAI,GAChClB,KAAKyF,MAAM2B,IAAOC,GAAKtG,EAAO,SAC9Bf,KAAKyF,MAAM2B,EAAI,IAAMC,IAAO,GAAKtG,EAAO,SAE1Cf,KAAKkH,SA2BP/B,EAAG3E,UAAUyG,WAAa,SAAqB7B,EAAQC,EAAMU,GAE3D/F,KAAKyF,MAAQ,CAAE,GACfzF,KAAKW,OAAS,EAGd,IAAK,IAAI2G,EAAU,EAAGC,EAAU,EAAGA,GAAW,SAAWA,GAAWlC,EAClEiC,IAEFA,IACAC,EAAWA,EAAUlC,EAAQ,EAO7B,IALA,IAAImC,EAAQpC,EAAOzE,OAASoF,EACxBlH,EAAM2I,EAAQF,EACdtB,EAAM/E,KAAKD,IAAIwG,EAAOA,EAAQ3I,GAAOkH,EAErC0B,EAAO,EACFvG,EAAI6E,EAAO7E,EAAI8E,EAAK9E,GAAKoG,EAChCG,EAAOpB,EAAUjB,EAAQlE,EAAGA,EAAIoG,EAASjC,GAEzCrF,KAAK0H,MAAMH,GACPvH,KAAKyF,MAAM,GAAKgC,EAAO,SACzBzH,KAAKyF,MAAM,IAAMgC,EAEjBzH,KAAK2H,OAAOF,GAIhB,GAAY,IAAR5I,EAAW,CACb,IAAI+I,EAAM,EAGV,IAFAH,EAAOpB,EAAUjB,EAAQlE,EAAGkE,EAAOzE,OAAQ0E,GAEtCnE,EAAI,EAAGA,EAAIrC,EAAKqC,IACnB0G,GAAOvC,EAGTrF,KAAK0H,MAAME,GACP5H,KAAKyF,MAAM,GAAKgC,EAAO,SACzBzH,KAAKyF,MAAM,IAAMgC,EAEjBzH,KAAK2H,OAAOF,KAKlBtC,EAAG3E,UAAUqH,KAAO,SAAeC,GACjCA,EAAKrC,MAAQ,IAAIpF,MAAML,KAAKW,QAC5B,IAAK,IAAIO,EAAI,EAAGA,EAAIlB,KAAKW,OAAQO,IAC/B4G,EAAKrC,MAAMvE,GAAKlB,KAAKyF,MAAMvE,GAE7B4G,EAAKnH,OAASX,KAAKW,OACnBmH,EAAKtC,SAAWxF,KAAKwF,SACrBsC,EAAKpC,IAAM1F,KAAK0F,KAGlBP,EAAG3E,UAAUuH,MAAQ,WACnB,IAAI9B,EAAI,IAAId,EAAG,MAEf,OADAnF,KAAK6H,KAAK5B,GACHA,GAGTd,EAAG3E,UAAUwH,QAAU,SAAkBC,GACvC,MAAOjI,KAAKW,OAASsH,EACnBjI,KAAKyF,MAAMzF,KAAKW,UAAY,EAE9B,OAAOX,MAITmF,EAAG3E,UAAU0G,MAAQ,WACnB,MAAOlH,KAAKW,OAAS,GAAqC,IAAhCX,KAAKyF,MAAMzF,KAAKW,OAAS,GACjDX,KAAKW,SAEP,OAAOX,KAAKkI,aAGd/C,EAAG3E,UAAU0H,UAAY,WAKvB,OAHoB,IAAhBlI,KAAKW,QAAkC,IAAlBX,KAAKyF,MAAM,KAClCzF,KAAKwF,SAAW,GAEXxF,MAGTmF,EAAG3E,UAAU2H,QAAU,WACrB,OAAQnI,KAAK0F,IAAM,UAAY,SAAW1F,KAAK8G,SAAS,IAAM,KAiChE,IAAIsB,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,EAAYhC,GAGnB,IAFA,IAAIc,EAAI,IAAIhH,MAAMkG,EAAIiC,aAEbC,EAAM,EAAGA,EAAMpB,EAAE1G,OAAQ8H,IAAO,CACvC,IAAI1H,EAAO0H,EAAM,GAAM,EACnBC,EAAOD,EAAM,GAEjBpB,EAAEoB,IAAQlC,EAAId,MAAM1E,GAAQ,GAAK2H,KAAWA,EAG9C,OAAOrB,EAmWT,SAASsB,EAAYC,EAAMrC,EAAKnF,GAC9BA,EAAIoE,SAAWe,EAAIf,SAAWoD,EAAKpD,SACnC,IAAIU,EAAO0C,EAAKjI,OAAS4F,EAAI5F,OAAU,EACvCS,EAAIT,OAASuF,EACbA,EAAOA,EAAM,EAAK,EAGlB,IAAI2C,EAAoB,EAAhBD,EAAKnD,MAAM,GACfqD,EAAmB,EAAfvC,EAAId,MAAM,GACdQ,EAAI4C,EAAIC,EAERC,EAAS,SAAJ9C,EACL+C,EAAS/C,EAAI,SAAa,EAC9B7E,EAAIqE,MAAM,GAAKsD,EAEf,IAAK,IAAIE,EAAI,EAAGA,EAAI/C,EAAK+C,IAAK,CAM5B,IAHA,IAAIC,EAASF,IAAU,GACnBG,EAAgB,SAARH,EACRI,EAAOnI,KAAKD,IAAIiI,EAAG1C,EAAI5F,OAAS,GAC3ByG,EAAInG,KAAKQ,IAAI,EAAGwH,EAAIL,EAAKjI,OAAS,GAAIyG,GAAKgC,EAAMhC,IAAK,CAC7D,IAAIlG,EAAK+H,EAAI7B,EAAK,EAClByB,EAAoB,EAAhBD,EAAKnD,MAAMvE,GACf4H,EAAmB,EAAfvC,EAAId,MAAM2B,GACdnB,EAAI4C,EAAIC,EAAIK,EACZD,GAAWjD,EAAI,SAAa,EAC5BkD,EAAY,SAAJlD,EAEV7E,EAAIqE,MAAMwD,GAAa,EAARE,EACfH,EAAiB,EAATE,EAQV,OANc,IAAVF,EACF5H,EAAIqE,MAAMwD,GAAa,EAARD,EAEf5H,EAAIT,SAGCS,EAAI8F,QAzlBb/B,EAAG3E,UAAUsG,SAAW,SAAmBzB,EAAMgE,GAI/C,IAAIjI,EACJ,GAJAiE,EAAOA,GAAQ,GACfgE,EAAoB,EAAVA,GAAe,EAGZ,KAAThE,GAAwB,QAATA,EAAgB,CACjCjE,EAAM,GAGN,IAFA,IAAIL,EAAM,EACNiI,EAAQ,EACH9H,EAAI,EAAGA,EAAIlB,KAAKW,OAAQO,IAAK,CACpC,IAAImG,EAAIrH,KAAKyF,MAAMvE,GACfuG,GAA+B,UAArBJ,GAAKtG,EAAOiI,IAAmBlC,SAAS,IACtDkC,EAAS3B,IAAO,GAAKtG,EAAQ,SAE3BK,EADY,IAAV4H,GAAe9H,IAAMlB,KAAKW,OAAS,EAC/ByH,EAAM,EAAIX,EAAK9G,QAAU8G,EAAOrG,EAEhCqG,EAAOrG,EAEfL,GAAO,EACHA,GAAO,KACTA,GAAO,GACPG,KAGU,IAAV8H,IACF5H,EAAM4H,EAAMlC,SAAS,IAAM1F,GAE7B,MAAOA,EAAIT,OAAS0I,IAAY,EAC9BjI,EAAM,IAAMA,EAKd,OAHsB,IAAlBpB,KAAKwF,WACPpE,EAAM,IAAMA,GAEPA,EAGT,GAAIiE,KAAiB,EAAPA,IAAaA,GAAQ,GAAKA,GAAQ,GAAI,CAElD,IAAIiE,EAAYjB,EAAWhD,GAEvBkE,EAAYjB,EAAWjD,GAC3BjE,EAAM,GACN,IAAI+E,EAAInG,KAAK+H,QACb5B,EAAEX,SAAW,EACb,OAAQW,EAAEqD,SAAU,CAClB,IAAIvD,EAAIE,EAAEsD,KAAKF,GAAWzC,SAASzB,GACnCc,EAAIA,EAAEuD,MAAMH,GAKVnI,EAHG+E,EAAEqD,SAGCvD,EAAI7E,EAFJgH,EAAMkB,EAAYrD,EAAEtF,QAAUsF,EAAI7E,EAKxCpB,KAAKwJ,WACPpI,EAAM,IAAMA,GAEd,MAAOA,EAAIT,OAAS0I,IAAY,EAC9BjI,EAAM,IAAMA,EAKd,OAHsB,IAAlBpB,KAAKwF,WACPpE,EAAM,IAAMA,GAEPA,EAGTvB,GAAO,EAAO,oCAGhBsF,EAAG3E,UAAUmJ,SAAW,WACtB,IAAIC,EAAM5J,KAAKyF,MAAM,GASrB,OARoB,IAAhBzF,KAAKW,OACPiJ,GAAuB,SAAhB5J,KAAKyF,MAAM,GACO,IAAhBzF,KAAKW,QAAkC,IAAlBX,KAAKyF,MAAM,GAEzCmE,GAAO,iBAAoC,SAAhB5J,KAAKyF,MAAM,GAC7BzF,KAAKW,OAAS,GACvBd,GAAO,EAAO,8CAEU,IAAlBG,KAAKwF,UAAmBoE,EAAMA,GAGxCzE,EAAG3E,UAAUqJ,OAAS,WACpB,OAAO7J,KAAK8G,SAAS,KAGvB3B,EAAG3E,UAAUsJ,SAAW,SAAmBxE,EAAQ3E,GAEjD,OADAd,EAAyB,qBAAXd,GACPiB,KAAK+J,YAAYhL,EAAQuG,EAAQ3E,IAG1CwE,EAAG3E,UAAU2G,QAAU,SAAkB7B,EAAQ3E,GAC/C,OAAOX,KAAK+J,YAAY1J,MAAOiF,EAAQ3E,IAGzCwE,EAAG3E,UAAUuJ,YAAc,SAAsBC,EAAW1E,EAAQ3E,GAClE,IAAIsJ,EAAajK,KAAKiK,aAClBC,EAAYvJ,GAAUM,KAAKQ,IAAI,EAAGwI,GACtCpK,EAAOoK,GAAcC,EAAW,yCAChCrK,EAAOqK,EAAY,EAAG,+BAEtBlK,KAAKkH,QACL,IAGI4B,EAAG5H,EAHHiJ,EAA0B,OAAX7E,EACf8E,EAAM,IAAIJ,EAAUE,GAGpBG,EAAIrK,KAAK+H,QACb,GAAKoC,EAYE,CACL,IAAKjJ,EAAI,GAAImJ,EAAEb,SAAUtI,IACvB4H,EAAIuB,EAAEC,MAAM,KACZD,EAAEE,OAAO,GAETH,EAAIlJ,GAAK4H,EAGX,KAAO5H,EAAIgJ,EAAWhJ,IACpBkJ,EAAIlJ,GAAK,MArBM,CAEjB,IAAKA,EAAI,EAAGA,EAAIgJ,EAAYD,EAAY/I,IACtCkJ,EAAIlJ,GAAK,EAGX,IAAKA,EAAI,GAAImJ,EAAEb,SAAUtI,IACvB4H,EAAIuB,EAAEC,MAAM,KACZD,EAAEE,OAAO,GAETH,EAAIF,EAAYhJ,EAAI,GAAK4H,EAe7B,OAAOsB,GAGLnJ,KAAKuJ,MACPrF,EAAG3E,UAAUiK,WAAa,SAAqBpD,GAC7C,OAAO,GAAKpG,KAAKuJ,MAAMnD,IAGzBlC,EAAG3E,UAAUiK,WAAa,SAAqBpD,GAC7C,IAAIqD,EAAIrD,EACJpB,EAAI,EAiBR,OAhBIyE,GAAK,OACPzE,GAAK,GACLyE,KAAO,IAELA,GAAK,KACPzE,GAAK,EACLyE,KAAO,GAELA,GAAK,IACPzE,GAAK,EACLyE,KAAO,GAELA,GAAK,IACPzE,GAAK,EACLyE,KAAO,GAEFzE,EAAIyE,GAIfvF,EAAG3E,UAAUmK,UAAY,SAAoBtD,GAE3C,GAAU,IAANA,EAAS,OAAO,GAEpB,IAAIqD,EAAIrD,EACJpB,EAAI,EAoBR,OAnBqB,KAAZ,KAAJyE,KACHzE,GAAK,GACLyE,KAAO,IAEU,KAAV,IAAJA,KACHzE,GAAK,EACLyE,KAAO,GAES,KAAT,GAAJA,KACHzE,GAAK,EACLyE,KAAO,GAES,KAAT,EAAJA,KACHzE,GAAK,EACLyE,KAAO,GAES,KAAT,EAAJA,IACHzE,IAEKA,GAITd,EAAG3E,UAAUgI,UAAY,WACvB,IAAInB,EAAIrH,KAAKyF,MAAMzF,KAAKW,OAAS,GAC7BiK,EAAK5K,KAAKyK,WAAWpD,GACzB,OAA2B,IAAnBrH,KAAKW,OAAS,GAAUiK,GAiBlCzF,EAAG3E,UAAUqK,SAAW,WACtB,GAAI7K,KAAKwJ,SAAU,OAAO,EAG1B,IADA,IAAIvD,EAAI,EACC/E,EAAI,EAAGA,EAAIlB,KAAKW,OAAQO,IAAK,CACpC,IAAI4H,EAAI9I,KAAK2K,UAAU3K,KAAKyF,MAAMvE,IAElC,GADA+E,GAAK6C,EACK,KAANA,EAAU,MAEhB,OAAO7C,GAGTd,EAAG3E,UAAUyJ,WAAa,WACxB,OAAOhJ,KAAKS,KAAK1B,KAAKwI,YAAc,IAGtCrD,EAAG3E,UAAUsK,OAAS,SAAiBC,GACrC,OAAsB,IAAlB/K,KAAKwF,SACAxF,KAAKgL,MAAMC,MAAMF,GAAOG,MAAM,GAEhClL,KAAK+H,SAGd5C,EAAG3E,UAAU2K,SAAW,SAAmBJ,GACzC,OAAI/K,KAAKoL,MAAML,EAAQ,GACd/K,KAAKqL,KAAKN,GAAOG,MAAM,GAAGI,OAE5BtL,KAAK+H,SAGd5C,EAAG3E,UAAU+K,MAAQ,WACnB,OAAyB,IAAlBvL,KAAKwF,UAIdL,EAAG3E,UAAUgL,IAAM,WACjB,OAAOxL,KAAK+H,QAAQuD,QAGtBnG,EAAG3E,UAAU8K,KAAO,WAKlB,OAJKtL,KAAKwJ,WACRxJ,KAAKwF,UAAY,GAGZxF,MAITmF,EAAG3E,UAAUiL,KAAO,SAAelF,GACjC,MAAOvG,KAAKW,OAAS4F,EAAI5F,OACvBX,KAAKyF,MAAMzF,KAAKW,UAAY,EAG9B,IAAK,IAAIO,EAAI,EAAGA,EAAIqF,EAAI5F,OAAQO,IAC9BlB,KAAKyF,MAAMvE,GAAKlB,KAAKyF,MAAMvE,GAAKqF,EAAId,MAAMvE,GAG5C,OAAOlB,KAAKkH,SAGd/B,EAAG3E,UAAUkL,IAAM,SAAcnF,GAE/B,OADA1G,EAA0C,KAAlCG,KAAKwF,SAAWe,EAAIf,WACrBxF,KAAKyL,KAAKlF,IAInBpB,EAAG3E,UAAUmL,GAAK,SAAapF,GAC7B,OAAIvG,KAAKW,OAAS4F,EAAI5F,OAAeX,KAAK+H,QAAQ2D,IAAInF,GAC/CA,EAAIwB,QAAQ2D,IAAI1L,OAGzBmF,EAAG3E,UAAUoL,IAAM,SAAcrF,GAC/B,OAAIvG,KAAKW,OAAS4F,EAAI5F,OAAeX,KAAK+H,QAAQ0D,KAAKlF,GAChDA,EAAIwB,QAAQ0D,KAAKzL,OAI1BmF,EAAG3E,UAAUqL,MAAQ,SAAgBtF,GAEnC,IAAIuC,EAEFA,EADE9I,KAAKW,OAAS4F,EAAI5F,OAChB4F,EAEAvG,KAGN,IAAK,IAAIkB,EAAI,EAAGA,EAAI4H,EAAEnI,OAAQO,IAC5BlB,KAAKyF,MAAMvE,GAAKlB,KAAKyF,MAAMvE,GAAKqF,EAAId,MAAMvE,GAK5C,OAFAlB,KAAKW,OAASmI,EAAEnI,OAETX,KAAKkH,SAGd/B,EAAG3E,UAAUsL,KAAO,SAAevF,GAEjC,OADA1G,EAA0C,KAAlCG,KAAKwF,SAAWe,EAAIf,WACrBxF,KAAK6L,MAAMtF,IAIpBpB,EAAG3E,UAAUuL,IAAM,SAAcxF,GAC/B,OAAIvG,KAAKW,OAAS4F,EAAI5F,OAAeX,KAAK+H,QAAQ+D,KAAKvF,GAChDA,EAAIwB,QAAQ+D,KAAK9L,OAG1BmF,EAAG3E,UAAUwL,KAAO,SAAezF,GACjC,OAAIvG,KAAKW,OAAS4F,EAAI5F,OAAeX,KAAK+H,QAAQ8D,MAAMtF,GACjDA,EAAIwB,QAAQ8D,MAAM7L,OAI3BmF,EAAG3E,UAAUyL,MAAQ,SAAgB1F,GAEnC,IAAIsC,EACAC,EACA9I,KAAKW,OAAS4F,EAAI5F,QACpBkI,EAAI7I,KACJ8I,EAAIvC,IAEJsC,EAAItC,EACJuC,EAAI9I,MAGN,IAAK,IAAIkB,EAAI,EAAGA,EAAI4H,EAAEnI,OAAQO,IAC5BlB,KAAKyF,MAAMvE,GAAK2H,EAAEpD,MAAMvE,GAAK4H,EAAErD,MAAMvE,GAGvC,GAAIlB,OAAS6I,EACX,KAAO3H,EAAI2H,EAAElI,OAAQO,IACnBlB,KAAKyF,MAAMvE,GAAK2H,EAAEpD,MAAMvE,GAM5B,OAFAlB,KAAKW,OAASkI,EAAElI,OAETX,KAAKkH,SAGd/B,EAAG3E,UAAU0L,KAAO,SAAe3F,GAEjC,OADA1G,EAA0C,KAAlCG,KAAKwF,SAAWe,EAAIf,WACrBxF,KAAKiM,MAAM1F,IAIpBpB,EAAG3E,UAAU2L,IAAM,SAAc5F,GAC/B,OAAIvG,KAAKW,OAAS4F,EAAI5F,OAAeX,KAAK+H,QAAQmE,KAAK3F,GAChDA,EAAIwB,QAAQmE,KAAKlM,OAG1BmF,EAAG3E,UAAU4L,KAAO,SAAe7F,GACjC,OAAIvG,KAAKW,OAAS4F,EAAI5F,OAAeX,KAAK+H,QAAQkE,MAAM1F,GACjDA,EAAIwB,QAAQkE,MAAMjM,OAI3BmF,EAAG3E,UAAUyK,MAAQ,SAAgBF,GACnClL,EAAwB,kBAAVkL,GAAsBA,GAAS,GAE7C,IAAIsB,EAAsC,EAAxBpL,KAAKS,KAAKqJ,EAAQ,IAChCuB,EAAWvB,EAAQ,GAGvB/K,KAAKgI,QAAQqE,GAETC,EAAW,GACbD,IAIF,IAAK,IAAInL,EAAI,EAAGA,EAAImL,EAAanL,IAC/BlB,KAAKyF,MAAMvE,GAAsB,UAAhBlB,KAAKyF,MAAMvE,GAS9B,OALIoL,EAAW,IACbtM,KAAKyF,MAAMvE,IAAMlB,KAAKyF,MAAMvE,GAAM,UAAc,GAAKoL,GAIhDtM,KAAKkH,SAGd/B,EAAG3E,UAAU6K,KAAO,SAAeN,GACjC,OAAO/K,KAAK+H,QAAQkD,MAAMF,IAI5B5F,EAAG3E,UAAU+L,KAAO,SAAe9D,EAAK3D,GACtCjF,EAAsB,kBAAR4I,GAAoBA,GAAO,GAEzC,IAAI1H,EAAO0H,EAAM,GAAM,EACnBC,EAAOD,EAAM,GAUjB,OARAzI,KAAKgI,QAAQjH,EAAM,GAGjBf,KAAKyF,MAAM1E,GADT+D,EACgB9E,KAAKyF,MAAM1E,GAAQ,GAAK2H,EAExB1I,KAAKyF,MAAM1E,KAAS,GAAK2H,GAGtC1I,KAAKkH,SAId/B,EAAG3E,UAAUgM,KAAO,SAAejG,GACjC,IAAIN,EAkBA4C,EAAGC,EAfP,GAAsB,IAAlB9I,KAAKwF,UAAmC,IAAjBe,EAAIf,SAI7B,OAHAxF,KAAKwF,SAAW,EAChBS,EAAIjG,KAAKyM,KAAKlG,GACdvG,KAAKwF,UAAY,EACVxF,KAAKkI,YAGP,GAAsB,IAAlBlI,KAAKwF,UAAmC,IAAjBe,EAAIf,SAIpC,OAHAe,EAAIf,SAAW,EACfS,EAAIjG,KAAKyM,KAAKlG,GACdA,EAAIf,SAAW,EACRS,EAAEiC,YAKPlI,KAAKW,OAAS4F,EAAI5F,QACpBkI,EAAI7I,KACJ8I,EAAIvC,IAEJsC,EAAItC,EACJuC,EAAI9I,MAIN,IADA,IAAIgJ,EAAQ,EACH9H,EAAI,EAAGA,EAAI4H,EAAEnI,OAAQO,IAC5B+E,GAAkB,EAAb4C,EAAEpD,MAAMvE,KAAwB,EAAb4H,EAAErD,MAAMvE,IAAU8H,EAC1ChJ,KAAKyF,MAAMvE,GAAS,SAAJ+E,EAChB+C,EAAQ/C,IAAM,GAEhB,KAAiB,IAAV+C,GAAe9H,EAAI2H,EAAElI,OAAQO,IAClC+E,GAAkB,EAAb4C,EAAEpD,MAAMvE,IAAU8H,EACvBhJ,KAAKyF,MAAMvE,GAAS,SAAJ+E,EAChB+C,EAAQ/C,IAAM,GAIhB,GADAjG,KAAKW,OAASkI,EAAElI,OACF,IAAVqI,EACFhJ,KAAKyF,MAAMzF,KAAKW,QAAUqI,EAC1BhJ,KAAKW,cAEA,GAAIkI,IAAM7I,KACf,KAAOkB,EAAI2H,EAAElI,OAAQO,IACnBlB,KAAKyF,MAAMvE,GAAK2H,EAAEpD,MAAMvE,GAI5B,OAAOlB,MAITmF,EAAG3E,UAAUkM,IAAM,SAAcnG,GAC/B,IAAI6D,EACJ,OAAqB,IAAjB7D,EAAIf,UAAoC,IAAlBxF,KAAKwF,UAC7Be,EAAIf,SAAW,EACf4E,EAAMpK,KAAK2M,IAAIpG,GACfA,EAAIf,UAAY,EACT4E,GACmB,IAAjB7D,EAAIf,UAAoC,IAAlBxF,KAAKwF,UACpCxF,KAAKwF,SAAW,EAChB4E,EAAM7D,EAAIoG,IAAI3M,MACdA,KAAKwF,SAAW,EACT4E,GAGLpK,KAAKW,OAAS4F,EAAI5F,OAAeX,KAAK+H,QAAQyE,KAAKjG,GAEhDA,EAAIwB,QAAQyE,KAAKxM,OAI1BmF,EAAG3E,UAAUiM,KAAO,SAAelG,GAEjC,GAAqB,IAAjBA,EAAIf,SAAgB,CACtBe,EAAIf,SAAW,EACf,IAAIS,EAAIjG,KAAKwM,KAAKjG,GAElB,OADAA,EAAIf,SAAW,EACRS,EAAEiC,YAGJ,GAAsB,IAAlBlI,KAAKwF,SAId,OAHAxF,KAAKwF,SAAW,EAChBxF,KAAKwM,KAAKjG,GACVvG,KAAKwF,SAAW,EACTxF,KAAKkI,YAId,IAWIW,EAAGC,EAXHnC,EAAM3G,KAAK2G,IAAIJ,GAGnB,GAAY,IAARI,EAIF,OAHA3G,KAAKwF,SAAW,EAChBxF,KAAKW,OAAS,EACdX,KAAKyF,MAAM,GAAK,EACTzF,KAKL2G,EAAM,GACRkC,EAAI7I,KACJ8I,EAAIvC,IAEJsC,EAAItC,EACJuC,EAAI9I,MAIN,IADA,IAAIgJ,EAAQ,EACH9H,EAAI,EAAGA,EAAI4H,EAAEnI,OAAQO,IAC5B+E,GAAkB,EAAb4C,EAAEpD,MAAMvE,KAAwB,EAAb4H,EAAErD,MAAMvE,IAAU8H,EAC1CA,EAAQ/C,GAAK,GACbjG,KAAKyF,MAAMvE,GAAS,SAAJ+E,EAElB,KAAiB,IAAV+C,GAAe9H,EAAI2H,EAAElI,OAAQO,IAClC+E,GAAkB,EAAb4C,EAAEpD,MAAMvE,IAAU8H,EACvBA,EAAQ/C,GAAK,GACbjG,KAAKyF,MAAMvE,GAAS,SAAJ+E,EAIlB,GAAc,IAAV+C,GAAe9H,EAAI2H,EAAElI,QAAUkI,IAAM7I,KACvC,KAAOkB,EAAI2H,EAAElI,OAAQO,IACnBlB,KAAKyF,MAAMvE,GAAK2H,EAAEpD,MAAMvE,GAU5B,OANAlB,KAAKW,OAASM,KAAKQ,IAAIzB,KAAKW,OAAQO,GAEhC2H,IAAM7I,OACRA,KAAKwF,SAAW,GAGXxF,KAAKkH,SAId/B,EAAG3E,UAAUmM,IAAM,SAAcpG,GAC/B,OAAOvG,KAAK+H,QAAQ0E,KAAKlG,IA+C3B,IAAIqG,EAAc,SAAsBhE,EAAMrC,EAAKnF,GACjD,IAII2H,EACA8D,EACAjC,EANA/B,EAAID,EAAKnD,MACTqD,EAAIvC,EAAId,MACRqH,EAAI1L,EAAIqE,MACRU,EAAI,EAIJ4G,EAAY,EAAPlE,EAAE,GACPmE,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPrE,EAAE,GACPsE,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPxE,EAAE,GACPyE,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP3E,EAAE,GACP4E,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP9E,EAAE,GACP+E,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPjF,EAAE,GACPkF,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPpF,EAAE,GACPqF,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPvF,EAAE,GACPwF,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP1F,EAAE,GACP2F,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP7F,EAAE,GACP8F,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP/F,EAAE,GACPgG,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPlG,EAAE,GACPmG,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPrG,EAAE,GACPsG,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPxG,EAAE,GACPyG,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP3G,EAAE,GACP4G,EAAW,KAALD,EACNE,GAAMF,IAAO,GACbG,GAAY,EAAP9G,EAAE,GACP+G,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAPjH,EAAE,GACPkH,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAPpH,EAAE,GACPqH,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAPvH,EAAE,GACPwH,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAP1H,EAAE,GACP2H,GAAW,KAALD,GACNE,GAAMF,KAAO,GAEjBpP,EAAIoE,SAAWoD,EAAKpD,SAAWe,EAAIf,SACnCpE,EAAIT,OAAS,GAEboI,EAAK9H,KAAK0P,KAAK3D,EAAK8B,GACpBjC,EAAM5L,KAAK0P,KAAK3D,EAAK+B,GACrBlC,EAAOA,EAAM5L,KAAK0P,KAAK1D,EAAK6B,GAAQ,EACpClE,EAAK3J,KAAK0P,KAAK1D,EAAK8B,GACpB,IAAI6B,IAAQzK,EAAI4C,EAAM,KAAa,KAAN8D,IAAiB,IAAO,EACrD1G,GAAOyE,GAAMiC,IAAQ,IAAO,IAAM+D,KAAO,IAAO,EAChDA,IAAM,SAEN7H,EAAK9H,KAAK0P,KAAKxD,EAAK2B,GACpBjC,EAAM5L,KAAK0P,KAAKxD,EAAK4B,GACrBlC,EAAOA,EAAM5L,KAAK0P,KAAKvD,EAAK0B,GAAQ,EACpClE,EAAK3J,KAAK0P,KAAKvD,EAAK2B,GACpBhG,EAAMA,EAAK9H,KAAK0P,KAAK3D,EAAKiC,GAAQ,EAClCpC,EAAOA,EAAM5L,KAAK0P,KAAK3D,EAAKkC,GAAQ,EACpCrC,EAAOA,EAAM5L,KAAK0P,KAAK1D,EAAKgC,GAAQ,EACpCrE,EAAMA,EAAK3J,KAAK0P,KAAK1D,EAAKiC,GAAQ,EAClC,IAAI2B,IAAQ1K,EAAI4C,EAAM,KAAa,KAAN8D,IAAiB,IAAO,EACrD1G,GAAOyE,GAAMiC,IAAQ,IAAO,IAAMgE,KAAO,IAAO,EAChDA,IAAM,SAEN9H,EAAK9H,KAAK0P,KAAKrD,EAAKwB,GACpBjC,EAAM5L,KAAK0P,KAAKrD,EAAKyB,GACrBlC,EAAOA,EAAM5L,KAAK0P,KAAKpD,EAAKuB,GAAQ,EACpClE,EAAK3J,KAAK0P,KAAKpD,EAAKwB,GACpBhG,EAAMA,EAAK9H,KAAK0P,KAAKxD,EAAK8B,GAAQ,EAClCpC,EAAOA,EAAM5L,KAAK0P,KAAKxD,EAAK+B,GAAQ,EACpCrC,EAAOA,EAAM5L,KAAK0P,KAAKvD,EAAK6B,GAAQ,EACpCrE,EAAMA,EAAK3J,KAAK0P,KAAKvD,EAAK8B,GAAQ,EAClCnG,EAAMA,EAAK9H,KAAK0P,KAAK3D,EAAKoC,GAAQ,EAClCvC,EAAOA,EAAM5L,KAAK0P,KAAK3D,EAAKqC,GAAQ,EACpCxC,EAAOA,EAAM5L,KAAK0P,KAAK1D,EAAKmC,GAAQ,EACpCxE,EAAMA,EAAK3J,KAAK0P,KAAK1D,EAAKoC,GAAQ,EAClC,IAAIyB,IAAQ3K,EAAI4C,EAAM,KAAa,KAAN8D,IAAiB,IAAO,EACrD1G,GAAOyE,GAAMiC,IAAQ,IAAO,IAAMiE,KAAO,IAAO,EAChDA,IAAM,SAEN/H,EAAK9H,KAAK0P,KAAKlD,EAAKqB,GACpBjC,EAAM5L,KAAK0P,KAAKlD,EAAKsB,GACrBlC,EAAOA,EAAM5L,KAAK0P,KAAKjD,EAAKoB,GAAQ,EACpClE,EAAK3J,KAAK0P,KAAKjD,EAAKqB,GACpBhG,EAAMA,EAAK9H,KAAK0P,KAAKrD,EAAK2B,GAAQ,EAClCpC,EAAOA,EAAM5L,KAAK0P,KAAKrD,EAAK4B,GAAQ,EACpCrC,EAAOA,EAAM5L,KAAK0P,KAAKpD,EAAK0B,GAAQ,EACpCrE,EAAMA,EAAK3J,KAAK0P,KAAKpD,EAAK2B,GAAQ,EAClCnG,EAAMA,EAAK9H,KAAK0P,KAAKxD,EAAKiC,GAAQ,EAClCvC,EAAOA,EAAM5L,KAAK0P,KAAKxD,EAAKkC,GAAQ,EACpCxC,EAAOA,EAAM5L,KAAK0P,KAAKvD,EAAKgC,GAAQ,EACpCxE,EAAMA,EAAK3J,KAAK0P,KAAKvD,EAAKiC,GAAQ,EAClCtG,EAAMA,EAAK9H,KAAK0P,KAAK3D,EAAKuC,GAAQ,EAClC1C,EAAOA,EAAM5L,KAAK0P,KAAK3D,EAAKwC,GAAQ,EACpC3C,EAAOA,EAAM5L,KAAK0P,KAAK1D,EAAKsC,GAAQ,EACpC3E,EAAMA,EAAK3J,KAAK0P,KAAK1D,EAAKuC,GAAQ,EAClC,IAAIuB,IAAQ5K,EAAI4C,EAAM,KAAa,KAAN8D,IAAiB,IAAO,EACrD1G,GAAOyE,GAAMiC,IAAQ,IAAO,IAAMkE,KAAO,IAAO,EAChDA,IAAM,SAENhI,EAAK9H,KAAK0P,KAAK/C,EAAKkB,GACpBjC,EAAM5L,KAAK0P,KAAK/C,EAAKmB,GACrBlC,EAAOA,EAAM5L,KAAK0P,KAAK9C,EAAKiB,GAAQ,EACpClE,EAAK3J,KAAK0P,KAAK9C,EAAKkB,GACpBhG,EAAMA,EAAK9H,KAAK0P,KAAKlD,EAAKwB,GAAQ,EAClCpC,EAAOA,EAAM5L,KAAK0P,KAAKlD,EAAKyB,GAAQ,EACpCrC,EAAOA,EAAM5L,KAAK0P,KAAKjD,EAAKuB,GAAQ,EACpCrE,EAAMA,EAAK3J,KAAK0P,KAAKjD,EAAKwB,GAAQ,EAClCnG,EAAMA,EAAK9H,KAAK0P,KAAKrD,EAAK8B,GAAQ,EAClCvC,EAAOA,EAAM5L,KAAK0P,KAAKrD,EAAK+B,GAAQ,EACpCxC,EAAOA,EAAM5L,KAAK0P,KAAKpD,EAAK6B,GAAQ,EACpCxE,EAAMA,EAAK3J,KAAK0P,KAAKpD,EAAK8B,GAAQ,EAClCtG,EAAMA,EAAK9H,KAAK0P,KAAKxD,EAAKoC,GAAQ,EAClC1C,EAAOA,EAAM5L,KAAK0P,KAAKxD,EAAKqC,GAAQ,EACpC3C,EAAOA,EAAM5L,KAAK0P,KAAKvD,EAAKmC,GAAQ,EACpC3E,EAAMA,EAAK3J,KAAK0P,KAAKvD,EAAKoC,GAAQ,EAClCzG,EAAMA,EAAK9H,KAAK0P,KAAK3D,EAAK0C,GAAQ,EAClC7C,EAAOA,EAAM5L,KAAK0P,KAAK3D,EAAK2C,IAAQ,EACpC9C,EAAOA,EAAM5L,KAAK0P,KAAK1D,EAAKyC,GAAQ,EACpC9E,EAAMA,EAAK3J,KAAK0P,KAAK1D,EAAK0C,IAAQ,EAClC,IAAIqB,IAAQ7K,EAAI4C,EAAM,KAAa,KAAN8D,IAAiB,IAAO,EACrD1G,GAAOyE,GAAMiC,IAAQ,IAAO,IAAMmE,KAAO,IAAO,EAChDA,IAAM,SAENjI,EAAK9H,KAAK0P,KAAK5C,EAAKe,GACpBjC,EAAM5L,KAAK0P,KAAK5C,EAAKgB,GACrBlC,EAAOA,EAAM5L,KAAK0P,KAAK3C,EAAKc,GAAQ,EACpClE,EAAK3J,KAAK0P,KAAK3C,EAAKe,GACpBhG,EAAMA,EAAK9H,KAAK0P,KAAK/C,EAAKqB,GAAQ,EAClCpC,EAAOA,EAAM5L,KAAK0P,KAAK/C,EAAKsB,GAAQ,EACpCrC,EAAOA,EAAM5L,KAAK0P,KAAK9C,EAAKoB,GAAQ,EACpCrE,EAAMA,EAAK3J,KAAK0P,KAAK9C,EAAKqB,GAAQ,EAClCnG,EAAMA,EAAK9H,KAAK0P,KAAKlD,EAAK2B,GAAQ,EAClCvC,EAAOA,EAAM5L,KAAK0P,KAAKlD,EAAK4B,GAAQ,EACpCxC,EAAOA,EAAM5L,KAAK0P,KAAKjD,EAAK0B,GAAQ,EACpCxE,EAAMA,EAAK3J,KAAK0P,KAAKjD,EAAK2B,GAAQ,EAClCtG,EAAMA,EAAK9H,KAAK0P,KAAKrD,EAAKiC,GAAQ,EAClC1C,EAAOA,EAAM5L,KAAK0P,KAAKrD,EAAKkC,GAAQ,EACpC3C,EAAOA,EAAM5L,KAAK0P,KAAKpD,EAAKgC,GAAQ,EACpC3E,EAAMA,EAAK3J,KAAK0P,KAAKpD,EAAKiC,GAAQ,EAClCzG,EAAMA,EAAK9H,KAAK0P,KAAKxD,EAAKuC,GAAQ,EAClC7C,EAAOA,EAAM5L,KAAK0P,KAAKxD,EAAKwC,IAAQ,EACpC9C,EAAOA,EAAM5L,KAAK0P,KAAKvD,EAAKsC,GAAQ,EACpC9E,EAAMA,EAAK3J,KAAK0P,KAAKvD,EAAKuC,IAAQ,EAClC5G,EAAMA,EAAK9H,KAAK0P,KAAK3D,EAAK6C,IAAQ,EAClChD,EAAOA,EAAM5L,KAAK0P,KAAK3D,EAAK8C,IAAQ,EACpCjD,EAAOA,EAAM5L,KAAK0P,KAAK1D,EAAK4C,IAAQ,EACpCjF,EAAMA,EAAK3J,KAAK0P,KAAK1D,EAAK6C,IAAQ,EAClC,IAAImB,IAAQ9K,EAAI4C,EAAM,KAAa,KAAN8D,IAAiB,IAAO,EACrD1G,GAAOyE,GAAMiC,IAAQ,IAAO,IAAMoE,KAAO,IAAO,EAChDA,IAAM,SAENlI,EAAK9H,KAAK0P,KAAKzC,EAAKY,GACpBjC,EAAM5L,KAAK0P,KAAKzC,EAAKa,GACrBlC,EAAOA,EAAM5L,KAAK0P,KAAKxC,EAAKW,GAAQ,EACpClE,EAAK3J,KAAK0P,KAAKxC,EAAKY,GACpBhG,EAAMA,EAAK9H,KAAK0P,KAAK5C,EAAKkB,GAAQ,EAClCpC,EAAOA,EAAM5L,KAAK0P,KAAK5C,EAAKmB,GAAQ,EACpCrC,EAAOA,EAAM5L,KAAK0P,KAAK3C,EAAKiB,GAAQ,EACpCrE,EAAMA,EAAK3J,KAAK0P,KAAK3C,EAAKkB,GAAQ,EAClCnG,EAAMA,EAAK9H,KAAK0P,KAAK/C,EAAKwB,GAAQ,EAClCvC,EAAOA,EAAM5L,KAAK0P,KAAK/C,EAAKyB,GAAQ,EACpCxC,EAAOA,EAAM5L,KAAK0P,KAAK9C,EAAKuB,GAAQ,EACpCxE,EAAMA,EAAK3J,KAAK0P,KAAK9C,EAAKwB,GAAQ,EAClCtG,EAAMA,EAAK9H,KAAK0P,KAAKlD,EAAK8B,GAAQ,EAClC1C,EAAOA,EAAM5L,KAAK0P,KAAKlD,EAAK+B,GAAQ,EACpC3C,EAAOA,EAAM5L,KAAK0P,KAAKjD,EAAK6B,GAAQ,EACpC3E,EAAMA,EAAK3J,KAAK0P,KAAKjD,EAAK8B,GAAQ,EAClCzG,EAAMA,EAAK9H,KAAK0P,KAAKrD,EAAKoC,GAAQ,EAClC7C,EAAOA,EAAM5L,KAAK0P,KAAKrD,EAAKqC,IAAQ,EACpC9C,EAAOA,EAAM5L,KAAK0P,KAAKpD,EAAKmC,GAAQ,EACpC9E,EAAMA,EAAK3J,KAAK0P,KAAKpD,EAAKoC,IAAQ,EAClC5G,EAAMA,EAAK9H,KAAK0P,KAAKxD,EAAK0C,IAAQ,EAClChD,EAAOA,EAAM5L,KAAK0P,KAAKxD,EAAK2C,IAAQ,EACpCjD,EAAOA,EAAM5L,KAAK0P,KAAKvD,EAAKyC,IAAQ,EACpCjF,EAAMA,EAAK3J,KAAK0P,KAAKvD,EAAK0C,IAAQ,EAClC/G,EAAMA,EAAK9H,KAAK0P,KAAK3D,EAAKgD,IAAQ,EAClCnD,EAAOA,EAAM5L,KAAK0P,KAAK3D,EAAKiD,IAAQ,EACpCpD,EAAOA,EAAM5L,KAAK0P,KAAK1D,EAAK+C,IAAQ,EACpCpF,EAAMA,EAAK3J,KAAK0P,KAAK1D,EAAKgD,IAAQ,EAClC,IAAIiB,IAAQ/K,EAAI4C,EAAM,KAAa,KAAN8D,IAAiB,IAAO,EACrD1G,GAAOyE,GAAMiC,IAAQ,IAAO,IAAMqE,KAAO,IAAO,EAChDA,IAAM,SAENnI,EAAK9H,KAAK0P,KAAKtC,EAAKS,GACpBjC,EAAM5L,KAAK0P,KAAKtC,EAAKU,GACrBlC,EAAOA,EAAM5L,KAAK0P,KAAKrC,EAAKQ,GAAQ,EACpClE,EAAK3J,KAAK0P,KAAKrC,EAAKS,GACpBhG,EAAMA,EAAK9H,KAAK0P,KAAKzC,EAAKe,GAAQ,EAClCpC,EAAOA,EAAM5L,KAAK0P,KAAKzC,EAAKgB,GAAQ,EACpCrC,EAAOA,EAAM5L,KAAK0P,KAAKxC,EAAKc,GAAQ,EACpCrE,EAAMA,EAAK3J,KAAK0P,KAAKxC,EAAKe,GAAQ,EAClCnG,EAAMA,EAAK9H,KAAK0P,KAAK5C,EAAKqB,GAAQ,EAClCvC,EAAOA,EAAM5L,KAAK0P,KAAK5C,EAAKsB,GAAQ,EACpCxC,EAAOA,EAAM5L,KAAK0P,KAAK3C,EAAKoB,GAAQ,EACpCxE,EAAMA,EAAK3J,KAAK0P,KAAK3C,EAAKqB,GAAQ,EAClCtG,EAAMA,EAAK9H,KAAK0P,KAAK/C,EAAK2B,GAAQ,EAClC1C,EAAOA,EAAM5L,KAAK0P,KAAK/C,EAAK4B,GAAQ,EACpC3C,EAAOA,EAAM5L,KAAK0P,KAAK9C,EAAK0B,GAAQ,EACpC3E,EAAMA,EAAK3J,KAAK0P,KAAK9C,EAAK2B,GAAQ,EAClCzG,EAAMA,EAAK9H,KAAK0P,KAAKlD,EAAKiC,GAAQ,EAClC7C,EAAOA,EAAM5L,KAAK0P,KAAKlD,EAAKkC,IAAQ,EACpC9C,EAAOA,EAAM5L,KAAK0P,KAAKjD,EAAKgC,GAAQ,EACpC9E,EAAMA,EAAK3J,KAAK0P,KAAKjD,EAAKiC,IAAQ,EAClC5G,EAAMA,EAAK9H,KAAK0P,KAAKrD,EAAKuC,IAAQ,EAClChD,EAAOA,EAAM5L,KAAK0P,KAAKrD,EAAKwC,IAAQ,EACpCjD,EAAOA,EAAM5L,KAAK0P,KAAKpD,EAAKsC,IAAQ,EACpCjF,EAAMA,EAAK3J,KAAK0P,KAAKpD,EAAKuC,IAAQ,EAClC/G,EAAMA,EAAK9H,KAAK0P,KAAKxD,EAAK6C,IAAQ,EAClCnD,EAAOA,EAAM5L,KAAK0P,KAAKxD,EAAK8C,IAAQ,EACpCpD,EAAOA,EAAM5L,KAAK0P,KAAKvD,EAAK4C,IAAQ,EACpCpF,EAAMA,EAAK3J,KAAK0P,KAAKvD,EAAK6C,IAAQ,EAClClH,EAAMA,EAAK9H,KAAK0P,KAAK3D,EAAKmD,IAAQ,EAClCtD,EAAOA,EAAM5L,KAAK0P,KAAK3D,EAAKoD,IAAQ,EACpCvD,EAAOA,EAAM5L,KAAK0P,KAAK1D,EAAKkD,IAAQ,EACpCvF,EAAMA,EAAK3J,KAAK0P,KAAK1D,EAAKmD,IAAQ,EAClC,IAAIe,IAAQhL,EAAI4C,EAAM,KAAa,KAAN8D,IAAiB,IAAO,EACrD1G,GAAOyE,GAAMiC,IAAQ,IAAO,IAAMsE,KAAO,IAAO,EAChDA,IAAM,SAENpI,EAAK9H,KAAK0P,KAAKnC,EAAKM,GACpBjC,EAAM5L,KAAK0P,KAAKnC,EAAKO,GACrBlC,EAAOA,EAAM5L,KAAK0P,KAAKlC,EAAKK,GAAQ,EACpClE,EAAK3J,KAAK0P,KAAKlC,EAAKM,GACpBhG,EAAMA,EAAK9H,KAAK0P,KAAKtC,EAAKY,GAAQ,EAClCpC,EAAOA,EAAM5L,KAAK0P,KAAKtC,EAAKa,GAAQ,EACpCrC,EAAOA,EAAM5L,KAAK0P,KAAKrC,EAAKW,GAAQ,EACpCrE,EAAMA,EAAK3J,KAAK0P,KAAKrC,EAAKY,GAAQ,EAClCnG,EAAMA,EAAK9H,KAAK0P,KAAKzC,EAAKkB,GAAQ,EAClCvC,EAAOA,EAAM5L,KAAK0P,KAAKzC,EAAKmB,GAAQ,EACpCxC,EAAOA,EAAM5L,KAAK0P,KAAKxC,EAAKiB,GAAQ,EACpCxE,EAAMA,EAAK3J,KAAK0P,KAAKxC,EAAKkB,GAAQ,EAClCtG,EAAMA,EAAK9H,KAAK0P,KAAK5C,EAAKwB,GAAQ,EAClC1C,EAAOA,EAAM5L,KAAK0P,KAAK5C,EAAKyB,GAAQ,EACpC3C,EAAOA,EAAM5L,KAAK0P,KAAK3C,EAAKuB,GAAQ,EACpC3E,EAAMA,EAAK3J,KAAK0P,KAAK3C,EAAKwB,GAAQ,EAClCzG,EAAMA,EAAK9H,KAAK0P,KAAK/C,EAAK8B,GAAQ,EAClC7C,EAAOA,EAAM5L,KAAK0P,KAAK/C,EAAK+B,IAAQ,EACpC9C,EAAOA,EAAM5L,KAAK0P,KAAK9C,EAAK6B,GAAQ,EACpC9E,EAAMA,EAAK3J,KAAK0P,KAAK9C,EAAK8B,IAAQ,EAClC5G,EAAMA,EAAK9H,KAAK0P,KAAKlD,EAAKoC,IAAQ,EAClChD,EAAOA,EAAM5L,KAAK0P,KAAKlD,EAAKqC,IAAQ,EACpCjD,EAAOA,EAAM5L,KAAK0P,KAAKjD,EAAKmC,IAAQ,EACpCjF,EAAMA,EAAK3J,KAAK0P,KAAKjD,EAAKoC,IAAQ,EAClC/G,EAAMA,EAAK9H,KAAK0P,KAAKrD,EAAK0C,IAAQ,EAClCnD,EAAOA,EAAM5L,KAAK0P,KAAKrD,EAAK2C,IAAQ,EACpCpD,EAAOA,EAAM5L,KAAK0P,KAAKpD,EAAKyC,IAAQ,EACpCpF,EAAMA,EAAK3J,KAAK0P,KAAKpD,EAAK0C,IAAQ,EAClClH,EAAMA,EAAK9H,KAAK0P,KAAKxD,EAAKgD,IAAQ,EAClCtD,EAAOA,EAAM5L,KAAK0P,KAAKxD,EAAKiD,IAAQ,EACpCvD,EAAOA,EAAM5L,KAAK0P,KAAKvD,EAAK+C,IAAQ,EACpCvF,EAAMA,EAAK3J,KAAK0P,KAAKvD,EAAKgD,IAAQ,EAClCrH,EAAMA,EAAK9H,KAAK0P,KAAK3D,EAAKsD,IAAQ,EAClCzD,EAAOA,EAAM5L,KAAK0P,KAAK3D,EAAKuD,IAAQ,EACpC1D,EAAOA,EAAM5L,KAAK0P,KAAK1D,EAAKqD,IAAQ,EACpC1F,EAAMA,EAAK3J,KAAK0P,KAAK1D,EAAKsD,IAAQ,EAClC,IAAIa,IAAQjL,EAAI4C,EAAM,KAAa,KAAN8D,IAAiB,IAAO,EACrD1G,GAAOyE,GAAMiC,IAAQ,IAAO,IAAMuE,KAAO,IAAO,EAChDA,IAAM,SAENrI,EAAK9H,KAAK0P,KAAKhC,EAAKG,GACpBjC,EAAM5L,KAAK0P,KAAKhC,EAAKI,GACrBlC,EAAOA,EAAM5L,KAAK0P,KAAK/B,EAAKE,GAAQ,EACpClE,EAAK3J,KAAK0P,KAAK/B,EAAKG,GACpBhG,EAAMA,EAAK9H,KAAK0P,KAAKnC,EAAKS,GAAQ,EAClCpC,EAAOA,EAAM5L,KAAK0P,KAAKnC,EAAKU,GAAQ,EACpCrC,EAAOA,EAAM5L,KAAK0P,KAAKlC,EAAKQ,GAAQ,EACpCrE,EAAMA,EAAK3J,KAAK0P,KAAKlC,EAAKS,GAAQ,EAClCnG,EAAMA,EAAK9H,KAAK0P,KAAKtC,EAAKe,GAAQ,EAClCvC,EAAOA,EAAM5L,KAAK0P,KAAKtC,EAAKgB,GAAQ,EACpCxC,EAAOA,EAAM5L,KAAK0P,KAAKrC,EAAKc,GAAQ,EACpCxE,EAAMA,EAAK3J,KAAK0P,KAAKrC,EAAKe,GAAQ,EAClCtG,EAAMA,EAAK9H,KAAK0P,KAAKzC,EAAKqB,GAAQ,EAClC1C,EAAOA,EAAM5L,KAAK0P,KAAKzC,EAAKsB,GAAQ,EACpC3C,EAAOA,EAAM5L,KAAK0P,KAAKxC,EAAKoB,GAAQ,EACpC3E,EAAMA,EAAK3J,KAAK0P,KAAKxC,EAAKqB,GAAQ,EAClCzG,EAAMA,EAAK9H,KAAK0P,KAAK5C,EAAK2B,GAAQ,EAClC7C,EAAOA,EAAM5L,KAAK0P,KAAK5C,EAAK4B,IAAQ,EACpC9C,EAAOA,EAAM5L,KAAK0P,KAAK3C,EAAK0B,GAAQ,EACpC9E,EAAMA,EAAK3J,KAAK0P,KAAK3C,EAAK2B,IAAQ,EAClC5G,EAAMA,EAAK9H,KAAK0P,KAAK/C,EAAKiC,IAAQ,EAClChD,EAAOA,EAAM5L,KAAK0P,KAAK/C,EAAKkC,IAAQ,EACpCjD,EAAOA,EAAM5L,KAAK0P,KAAK9C,EAAKgC,IAAQ,EACpCjF,EAAMA,EAAK3J,KAAK0P,KAAK9C,EAAKiC,IAAQ,EAClC/G,EAAMA,EAAK9H,KAAK0P,KAAKlD,EAAKuC,IAAQ,EAClCnD,EAAOA,EAAM5L,KAAK0P,KAAKlD,EAAKwC,IAAQ,EACpCpD,EAAOA,EAAM5L,KAAK0P,KAAKjD,EAAKsC,IAAQ,EACpCpF,EAAMA,EAAK3J,KAAK0P,KAAKjD,EAAKuC,IAAQ,EAClClH,EAAMA,EAAK9H,KAAK0P,KAAKrD,EAAK6C,IAAQ,EAClCtD,EAAOA,EAAM5L,KAAK0P,KAAKrD,EAAK8C,IAAQ,EACpCvD,EAAOA,EAAM5L,KAAK0P,KAAKpD,EAAK4C,IAAQ,EACpCvF,EAAMA,EAAK3J,KAAK0P,KAAKpD,EAAK6C,IAAQ,EAClCrH,EAAMA,EAAK9H,KAAK0P,KAAKxD,EAAKmD,IAAQ,EAClCzD,EAAOA,EAAM5L,KAAK0P,KAAKxD,EAAKoD,IAAQ,EACpC1D,EAAOA,EAAM5L,KAAK0P,KAAKvD,EAAKkD,IAAQ,EACpC1F,EAAMA,EAAK3J,KAAK0P,KAAKvD,EAAKmD,IAAQ,EAClCxH,EAAMA,EAAK9H,KAAK0P,KAAK3D,EAAKyD,IAAQ,EAClC5D,EAAOA,EAAM5L,KAAK0P,KAAK3D,EAAK0D,IAAQ,EACpC7D,EAAOA,EAAM5L,KAAK0P,KAAK1D,EAAKwD,IAAQ,EACpC7F,EAAMA,EAAK3J,KAAK0P,KAAK1D,EAAKyD,IAAQ,EAClC,IAAIW,IAAQlL,EAAI4C,EAAM,KAAa,KAAN8D,IAAiB,IAAO,EACrD1G,GAAOyE,GAAMiC,IAAQ,IAAO,IAAMwE,KAAO,IAAO,EAChDA,IAAM,SAENtI,EAAK9H,KAAK0P,KAAKhC,EAAKM,GACpBpC,EAAM5L,KAAK0P,KAAKhC,EAAKO,GACrBrC,EAAOA,EAAM5L,KAAK0P,KAAK/B,EAAKK,GAAQ,EACpCrE,EAAK3J,KAAK0P,KAAK/B,EAAKM,GACpBnG,EAAMA,EAAK9H,KAAK0P,KAAKnC,EAAKY,GAAQ,EAClCvC,EAAOA,EAAM5L,KAAK0P,KAAKnC,EAAKa,GAAQ,EACpCxC,EAAOA,EAAM5L,KAAK0P,KAAKlC,EAAKW,GAAQ,EACpCxE,EAAMA,EAAK3J,KAAK0P,KAAKlC,EAAKY,GAAQ,EAClCtG,EAAMA,EAAK9H,KAAK0P,KAAKtC,EAAKkB,GAAQ,EAClC1C,EAAOA,EAAM5L,KAAK0P,KAAKtC,EAAKmB,GAAQ,EACpC3C,EAAOA,EAAM5L,KAAK0P,KAAKrC,EAAKiB,GAAQ,EACpC3E,EAAMA,EAAK3J,KAAK0P,KAAKrC,EAAKkB,GAAQ,EAClCzG,EAAMA,EAAK9H,KAAK0P,KAAKzC,EAAKwB,GAAQ,EAClC7C,EAAOA,EAAM5L,KAAK0P,KAAKzC,EAAKyB,IAAQ,EACpC9C,EAAOA,EAAM5L,KAAK0P,KAAKxC,EAAKuB,GAAQ,EACpC9E,EAAMA,EAAK3J,KAAK0P,KAAKxC,EAAKwB,IAAQ,EAClC5G,EAAMA,EAAK9H,KAAK0P,KAAK5C,EAAK8B,IAAQ,EAClChD,EAAOA,EAAM5L,KAAK0P,KAAK5C,EAAK+B,IAAQ,EACpCjD,EAAOA,EAAM5L,KAAK0P,KAAK3C,EAAK6B,IAAQ,EACpCjF,EAAMA,EAAK3J,KAAK0P,KAAK3C,EAAK8B,IAAQ,EAClC/G,EAAMA,EAAK9H,KAAK0P,KAAK/C,EAAKoC,IAAQ,EAClCnD,EAAOA,EAAM5L,KAAK0P,KAAK/C,EAAKqC,IAAQ,EACpCpD,EAAOA,EAAM5L,KAAK0P,KAAK9C,EAAKmC,IAAQ,EACpCpF,EAAMA,EAAK3J,KAAK0P,KAAK9C,EAAKoC,IAAQ,EAClClH,EAAMA,EAAK9H,KAAK0P,KAAKlD,EAAK0C,IAAQ,EAClCtD,EAAOA,EAAM5L,KAAK0P,KAAKlD,EAAK2C,IAAQ,EACpCvD,EAAOA,EAAM5L,KAAK0P,KAAKjD,EAAKyC,IAAQ,EACpCvF,EAAMA,EAAK3J,KAAK0P,KAAKjD,EAAK0C,IAAQ,EAClCrH,EAAMA,EAAK9H,KAAK0P,KAAKrD,EAAKgD,IAAQ,EAClCzD,EAAOA,EAAM5L,KAAK0P,KAAKrD,EAAKiD,IAAQ,EACpC1D,EAAOA,EAAM5L,KAAK0P,KAAKpD,EAAK+C,IAAQ,EACpC1F,EAAMA,EAAK3J,KAAK0P,KAAKpD,EAAKgD,IAAQ,EAClCxH,EAAMA,EAAK9H,KAAK0P,KAAKxD,EAAKsD,IAAQ,EAClC5D,EAAOA,EAAM5L,KAAK0P,KAAKxD,EAAKuD,IAAQ,EACpC7D,EAAOA,EAAM5L,KAAK0P,KAAKvD,EAAKqD,IAAQ,EACpC7F,EAAMA,EAAK3J,KAAK0P,KAAKvD,EAAKsD,IAAQ,EAClC,IAAIY,IAASnL,EAAI4C,EAAM,KAAa,KAAN8D,IAAiB,IAAO,EACtD1G,GAAOyE,GAAMiC,IAAQ,IAAO,IAAMyE,KAAQ,IAAO,EACjDA,IAAO,SAEPvI,EAAK9H,KAAK0P,KAAKhC,EAAKS,GACpBvC,EAAM5L,KAAK0P,KAAKhC,EAAKU,GACrBxC,EAAOA,EAAM5L,KAAK0P,KAAK/B,EAAKQ,GAAQ,EACpCxE,EAAK3J,KAAK0P,KAAK/B,EAAKS,GACpBtG,EAAMA,EAAK9H,KAAK0P,KAAKnC,EAAKe,GAAQ,EAClC1C,EAAOA,EAAM5L,KAAK0P,KAAKnC,EAAKgB,GAAQ,EACpC3C,EAAOA,EAAM5L,KAAK0P,KAAKlC,EAAKc,GAAQ,EACpC3E,EAAMA,EAAK3J,KAAK0P,KAAKlC,EAAKe,GAAQ,EAClCzG,EAAMA,EAAK9H,KAAK0P,KAAKtC,EAAKqB,GAAQ,EAClC7C,EAAOA,EAAM5L,KAAK0P,KAAKtC,EAAKsB,IAAQ,EACpC9C,EAAOA,EAAM5L,KAAK0P,KAAKrC,EAAKoB,GAAQ,EACpC9E,EAAMA,EAAK3J,KAAK0P,KAAKrC,EAAKqB,IAAQ,EAClC5G,EAAMA,EAAK9H,KAAK0P,KAAKzC,EAAK2B,IAAQ,EAClChD,EAAOA,EAAM5L,KAAK0P,KAAKzC,EAAK4B,IAAQ,EACpCjD,EAAOA,EAAM5L,KAAK0P,KAAKxC,EAAK0B,IAAQ,EACpCjF,EAAMA,EAAK3J,KAAK0P,KAAKxC,EAAK2B,IAAQ,EAClC/G,EAAMA,EAAK9H,KAAK0P,KAAK5C,EAAKiC,IAAQ,EAClCnD,EAAOA,EAAM5L,KAAK0P,KAAK5C,EAAKkC,IAAQ,EACpCpD,EAAOA,EAAM5L,KAAK0P,KAAK3C,EAAKgC,IAAQ,EACpCpF,EAAMA,EAAK3J,KAAK0P,KAAK3C,EAAKiC,IAAQ,EAClClH,EAAMA,EAAK9H,KAAK0P,KAAK/C,EAAKuC,IAAQ,EAClCtD,EAAOA,EAAM5L,KAAK0P,KAAK/C,EAAKwC,IAAQ,EACpCvD,EAAOA,EAAM5L,KAAK0P,KAAK9C,EAAKsC,IAAQ,EACpCvF,EAAMA,EAAK3J,KAAK0P,KAAK9C,EAAKuC,IAAQ,EAClCrH,EAAMA,EAAK9H,KAAK0P,KAAKlD,EAAK6C,IAAQ,EAClCzD,EAAOA,EAAM5L,KAAK0P,KAAKlD,EAAK8C,IAAQ,EACpC1D,EAAOA,EAAM5L,KAAK0P,KAAKjD,EAAK4C,IAAQ,EACpC1F,EAAMA,EAAK3J,KAAK0P,KAAKjD,EAAK6C,IAAQ,EAClCxH,EAAMA,EAAK9H,KAAK0P,KAAKrD,EAAKmD,IAAQ,EAClC5D,EAAOA,EAAM5L,KAAK0P,KAAKrD,EAAKoD,IAAQ,EACpC7D,EAAOA,EAAM5L,KAAK0P,KAAKpD,EAAKkD,IAAQ,EACpC7F,EAAMA,EAAK3J,KAAK0P,KAAKpD,EAAKmD,IAAQ,EAClC,IAAIa,IAASpL,EAAI4C,EAAM,KAAa,KAAN8D,IAAiB,IAAO,EACtD1G,GAAOyE,GAAMiC,IAAQ,IAAO,IAAM0E,KAAQ,IAAO,EACjDA,IAAO,SAEPxI,EAAK9H,KAAK0P,KAAKhC,EAAKY,GACpB1C,EAAM5L,KAAK0P,KAAKhC,EAAKa,GACrB3C,EAAOA,EAAM5L,KAAK0P,KAAK/B,EAAKW,GAAQ,EACpC3E,EAAK3J,KAAK0P,KAAK/B,EAAKY,GACpBzG,EAAMA,EAAK9H,KAAK0P,KAAKnC,EAAKkB,GAAQ,EAClC7C,EAAOA,EAAM5L,KAAK0P,KAAKnC,EAAKmB,IAAQ,EACpC9C,EAAOA,EAAM5L,KAAK0P,KAAKlC,EAAKiB,GAAQ,EACpC9E,EAAMA,EAAK3J,KAAK0P,KAAKlC,EAAKkB,IAAQ,EAClC5G,EAAMA,EAAK9H,KAAK0P,KAAKtC,EAAKwB,IAAQ,EAClChD,EAAOA,EAAM5L,KAAK0P,KAAKtC,EAAKyB,IAAQ,EACpCjD,EAAOA,EAAM5L,KAAK0P,KAAKrC,EAAKuB,IAAQ,EACpCjF,EAAMA,EAAK3J,KAAK0P,KAAKrC,EAAKwB,IAAQ,EAClC/G,EAAMA,EAAK9H,KAAK0P,KAAKzC,EAAK8B,IAAQ,EAClCnD,EAAOA,EAAM5L,KAAK0P,KAAKzC,EAAK+B,IAAQ,EACpCpD,EAAOA,EAAM5L,KAAK0P,KAAKxC,EAAK6B,IAAQ,EACpCpF,EAAMA,EAAK3J,KAAK0P,KAAKxC,EAAK8B,IAAQ,EAClClH,EAAMA,EAAK9H,KAAK0P,KAAK5C,EAAKoC,IAAQ,EAClCtD,EAAOA,EAAM5L,KAAK0P,KAAK5C,EAAKqC,IAAQ,EACpCvD,EAAOA,EAAM5L,KAAK0P,KAAK3C,EAAKmC,IAAQ,EACpCvF,EAAMA,EAAK3J,KAAK0P,KAAK3C,EAAKoC,IAAQ,EAClCrH,EAAMA,EAAK9H,KAAK0P,KAAK/C,EAAK0C,IAAQ,EAClCzD,EAAOA,EAAM5L,KAAK0P,KAAK/C,EAAK2C,IAAQ,EACpC1D,EAAOA,EAAM5L,KAAK0P,KAAK9C,EAAKyC,IAAQ,EACpC1F,EAAMA,EAAK3J,KAAK0P,KAAK9C,EAAK0C,IAAQ,EAClCxH,EAAMA,EAAK9H,KAAK0P,KAAKlD,EAAKgD,IAAQ,EAClC5D,EAAOA,EAAM5L,KAAK0P,KAAKlD,EAAKiD,IAAQ,EACpC7D,EAAOA,EAAM5L,KAAK0P,KAAKjD,EAAK+C,IAAQ,EACpC7F,EAAMA,EAAK3J,KAAK0P,KAAKjD,EAAKgD,IAAQ,EAClC,IAAIc,IAASrL,EAAI4C,EAAM,KAAa,KAAN8D,IAAiB,IAAO,EACtD1G,GAAOyE,GAAMiC,IAAQ,IAAO,IAAM2E,KAAQ,IAAO,EACjDA,IAAO,SAEPzI,EAAK9H,KAAK0P,KAAKhC,EAAKe,GACpB7C,EAAM5L,KAAK0P,KAAKhC,EAAKgB,IACrB9C,EAAOA,EAAM5L,KAAK0P,KAAK/B,EAAKc,GAAQ,EACpC9E,EAAK3J,KAAK0P,KAAK/B,EAAKe,IACpB5G,EAAMA,EAAK9H,KAAK0P,KAAKnC,EAAKqB,IAAQ,EAClChD,EAAOA,EAAM5L,KAAK0P,KAAKnC,EAAKsB,IAAQ,EACpCjD,EAAOA,EAAM5L,KAAK0P,KAAKlC,EAAKoB,IAAQ,EACpCjF,EAAMA,EAAK3J,KAAK0P,KAAKlC,EAAKqB,IAAQ,EAClC/G,EAAMA,EAAK9H,KAAK0P,KAAKtC,EAAK2B,IAAQ,EAClCnD,EAAOA,EAAM5L,KAAK0P,KAAKtC,EAAK4B,IAAQ,EACpCpD,EAAOA,EAAM5L,KAAK0P,KAAKrC,EAAK0B,IAAQ,EACpCpF,EAAMA,EAAK3J,KAAK0P,KAAKrC,EAAK2B,IAAQ,EAClClH,EAAMA,EAAK9H,KAAK0P,KAAKzC,EAAKiC,IAAQ,EAClCtD,EAAOA,EAAM5L,KAAK0P,KAAKzC,EAAKkC,IAAQ,EACpCvD,EAAOA,EAAM5L,KAAK0P,KAAKxC,EAAKgC,IAAQ,EACpCvF,EAAMA,EAAK3J,KAAK0P,KAAKxC,EAAKiC,IAAQ,EAClCrH,EAAMA,EAAK9H,KAAK0P,KAAK5C,EAAKuC,IAAQ,EAClCzD,EAAOA,EAAM5L,KAAK0P,KAAK5C,EAAKwC,IAAQ,EACpC1D,EAAOA,EAAM5L,KAAK0P,KAAK3C,EAAKsC,IAAQ,EACpC1F,EAAMA,EAAK3J,KAAK0P,KAAK3C,EAAKuC,IAAQ,EAClCxH,EAAMA,EAAK9H,KAAK0P,KAAK/C,EAAK6C,IAAQ,EAClC5D,EAAOA,EAAM5L,KAAK0P,KAAK/C,EAAK8C,IAAQ,EACpC7D,EAAOA,EAAM5L,KAAK0P,KAAK9C,EAAK4C,IAAQ,EACpC7F,EAAMA,EAAK3J,KAAK0P,KAAK9C,EAAK6C,IAAQ,EAClC,IAAIe,IAAStL,EAAI4C,EAAM,KAAa,KAAN8D,IAAiB,IAAO,EACtD1G,GAAOyE,GAAMiC,IAAQ,IAAO,IAAM4E,KAAQ,IAAO,EACjDA,IAAO,SAEP1I,EAAK9H,KAAK0P,KAAKhC,EAAKkB,IACpBhD,EAAM5L,KAAK0P,KAAKhC,EAAKmB,IACrBjD,EAAOA,EAAM5L,KAAK0P,KAAK/B,EAAKiB,IAAQ,EACpCjF,EAAK3J,KAAK0P,KAAK/B,EAAKkB,IACpB/G,EAAMA,EAAK9H,KAAK0P,KAAKnC,EAAKwB,IAAQ,EAClCnD,EAAOA,EAAM5L,KAAK0P,KAAKnC,EAAKyB,IAAQ,EACpCpD,EAAOA,EAAM5L,KAAK0P,KAAKlC,EAAKuB,IAAQ,EACpCpF,EAAMA,EAAK3J,KAAK0P,KAAKlC,EAAKwB,IAAQ,EAClClH,EAAMA,EAAK9H,KAAK0P,KAAKtC,EAAK8B,IAAQ,EAClCtD,EAAOA,EAAM5L,KAAK0P,KAAKtC,EAAK+B,IAAQ,EACpCvD,EAAOA,EAAM5L,KAAK0P,KAAKrC,EAAK6B,IAAQ,EACpCvF,EAAMA,EAAK3J,KAAK0P,KAAKrC,EAAK8B,IAAQ,EAClCrH,EAAMA,EAAK9H,KAAK0P,KAAKzC,EAAKoC,IAAQ,EAClCzD,EAAOA,EAAM5L,KAAK0P,KAAKzC,EAAKqC,IAAQ,EACpC1D,EAAOA,EAAM5L,KAAK0P,KAAKxC,EAAKmC,IAAQ,EACpC1F,EAAMA,EAAK3J,KAAK0P,KAAKxC,EAAKoC,IAAQ,EAClCxH,EAAMA,EAAK9H,KAAK0P,KAAK5C,EAAK0C,IAAQ,EAClC5D,EAAOA,EAAM5L,KAAK0P,KAAK5C,EAAK2C,IAAQ,EACpC7D,EAAOA,EAAM5L,KAAK0P,KAAK3C,EAAKyC,IAAQ,EACpC7F,EAAMA,EAAK3J,KAAK0P,KAAK3C,EAAK0C,IAAQ,EAClC,IAAIgB,IAASvL,EAAI4C,EAAM,KAAa,KAAN8D,IAAiB,IAAO,EACtD1G,GAAOyE,GAAMiC,IAAQ,IAAO,IAAM6E,KAAQ,IAAO,EACjDA,IAAO,SAEP3I,EAAK9H,KAAK0P,KAAKhC,EAAKqB,IACpBnD,EAAM5L,KAAK0P,KAAKhC,EAAKsB,IACrBpD,EAAOA,EAAM5L,KAAK0P,KAAK/B,EAAKoB,IAAQ,EACpCpF,EAAK3J,KAAK0P,KAAK/B,EAAKqB,IACpBlH,EAAMA,EAAK9H,KAAK0P,KAAKnC,EAAK2B,IAAQ,EAClCtD,EAAOA,EAAM5L,KAAK0P,KAAKnC,EAAK4B,IAAQ,EACpCvD,EAAOA,EAAM5L,KAAK0P,KAAKlC,EAAK0B,IAAQ,EACpCvF,EAAMA,EAAK3J,KAAK0P,KAAKlC,EAAK2B,IAAQ,EAClCrH,EAAMA,EAAK9H,KAAK0P,KAAKtC,EAAKiC,IAAQ,EAClCzD,EAAOA,EAAM5L,KAAK0P,KAAKtC,EAAKkC,IAAQ,EACpC1D,EAAOA,EAAM5L,KAAK0P,KAAKrC,EAAKgC,IAAQ,EACpC1F,EAAMA,EAAK3J,KAAK0P,KAAKrC,EAAKiC,IAAQ,EAClCxH,EAAMA,EAAK9H,KAAK0P,KAAKzC,EAAKuC,IAAQ,EAClC5D,EAAOA,EAAM5L,KAAK0P,KAAKzC,EAAKwC,IAAQ,EACpC7D,EAAOA,EAAM5L,KAAK0P,KAAKxC,EAAKsC,IAAQ,EACpC7F,EAAMA,EAAK3J,KAAK0P,KAAKxC,EAAKuC,IAAQ,EAClC,IAAIiB,IAASxL,EAAI4C,EAAM,KAAa,KAAN8D,IAAiB,IAAO,EACtD1G,GAAOyE,GAAMiC,IAAQ,IAAO,IAAM8E,KAAQ,IAAO,EACjDA,IAAO,SAEP5I,EAAK9H,KAAK0P,KAAKhC,EAAKwB,IACpBtD,EAAM5L,KAAK0P,KAAKhC,EAAKyB,IACrBvD,EAAOA,EAAM5L,KAAK0P,KAAK/B,EAAKuB,IAAQ,EACpCvF,EAAK3J,KAAK0P,KAAK/B,EAAKwB,IACpBrH,EAAMA,EAAK9H,KAAK0P,KAAKnC,EAAK8B,IAAQ,EAClCzD,EAAOA,EAAM5L,KAAK0P,KAAKnC,EAAK+B,IAAQ,EACpC1D,EAAOA,EAAM5L,KAAK0P,KAAKlC,EAAK6B,IAAQ,EACpC1F,EAAMA,EAAK3J,KAAK0P,KAAKlC,EAAK8B,IAAQ,EAClCxH,EAAMA,EAAK9H,KAAK0P,KAAKtC,EAAKoC,IAAQ,EAClC5D,EAAOA,EAAM5L,KAAK0P,KAAKtC,EAAKqC,IAAQ,EACpC7D,EAAOA,EAAM5L,KAAK0P,KAAKrC,EAAKmC,IAAQ,EACpC7F,EAAMA,EAAK3J,KAAK0P,KAAKrC,EAAKoC,IAAQ,EAClC,IAAIkB,IAASzL,EAAI4C,EAAM,KAAa,KAAN8D,IAAiB,IAAO,EACtD1G,GAAOyE,GAAMiC,IAAQ,IAAO,IAAM+E,KAAQ,IAAO,EACjDA,IAAO,SAEP7I,EAAK9H,KAAK0P,KAAKhC,EAAK2B,IACpBzD,EAAM5L,KAAK0P,KAAKhC,EAAK4B,IACrB1D,EAAOA,EAAM5L,KAAK0P,KAAK/B,EAAK0B,IAAQ,EACpC1F,EAAK3J,KAAK0P,KAAK/B,EAAK2B,IACpBxH,EAAMA,EAAK9H,KAAK0P,KAAKnC,EAAKiC,IAAQ,EAClC5D,EAAOA,EAAM5L,KAAK0P,KAAKnC,EAAKkC,IAAQ,EACpC7D,EAAOA,EAAM5L,KAAK0P,KAAKlC,EAAKgC,IAAQ,EACpC7F,EAAMA,EAAK3J,KAAK0P,KAAKlC,EAAKiC,IAAQ,EAClC,IAAImB,IAAS1L,EAAI4C,EAAM,KAAa,KAAN8D,IAAiB,IAAO,EACtD1G,GAAOyE,GAAMiC,IAAQ,IAAO,IAAMgF,KAAQ,IAAO,EACjDA,IAAO,SAEP9I,EAAK9H,KAAK0P,KAAKhC,EAAK8B,IACpB5D,EAAM5L,KAAK0P,KAAKhC,EAAK+B,IACrB7D,EAAOA,EAAM5L,KAAK0P,KAAK/B,EAAK6B,IAAQ,EACpC7F,EAAK3J,KAAK0P,KAAK/B,EAAK8B,IACpB,IAAIoB,IAAS3L,EAAI4C,EAAM,KAAa,KAAN8D,IAAiB,IAAO,EA0BtD,OAzBA1G,GAAOyE,GAAMiC,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,IAAN3L,IACF2G,EAAE,IAAM3G,EACR/E,EAAIT,UAECS,GAQT,SAAS2Q,EAAUnJ,EAAMrC,EAAKnF,GAC5BA,EAAIoE,SAAWe,EAAIf,SAAWoD,EAAKpD,SACnCpE,EAAIT,OAASiI,EAAKjI,OAAS4F,EAAI5F,OAI/B,IAFA,IAAIqI,EAAQ,EACRgJ,EAAU,EACL/I,EAAI,EAAGA,EAAI7H,EAAIT,OAAS,EAAGsI,IAAK,CAGvC,IAAIC,EAAS8I,EACbA,EAAU,EAGV,IAFA,IAAI7I,EAAgB,SAARH,EACRI,EAAOnI,KAAKD,IAAIiI,EAAG1C,EAAI5F,OAAS,GAC3ByG,EAAInG,KAAKQ,IAAI,EAAGwH,EAAIL,EAAKjI,OAAS,GAAIyG,GAAKgC,EAAMhC,IAAK,CAC7D,IAAIlG,EAAI+H,EAAI7B,EACRyB,EAAoB,EAAhBD,EAAKnD,MAAMvE,GACf4H,EAAmB,EAAfvC,EAAId,MAAM2B,GACdnB,EAAI4C,EAAIC,EAERC,EAAS,SAAJ9C,EACTiD,EAAUA,GAAWjD,EAAI,SAAa,GAAM,EAC5C8C,EAAMA,EAAKI,EAAS,EACpBA,EAAa,SAALJ,EACRG,EAAUA,GAAUH,IAAO,IAAO,EAElCiJ,GAAW9I,IAAW,GACtBA,GAAU,SAEZ9H,EAAIqE,MAAMwD,GAAKE,EACfH,EAAQE,EACRA,EAAS8I,EAQX,OANc,IAAVhJ,EACF5H,EAAIqE,MAAMwD,GAAKD,EAEf5H,EAAIT,SAGCS,EAAI8F,QAGb,SAAS+K,EAAYrJ,EAAMrC,EAAKnF,GAC9B,IAAI8Q,EAAO,IAAIC,EACf,OAAOD,EAAKE,KAAKxJ,EAAMrC,EAAKnF,GAsB9B,SAAS+Q,EAAME,EAAGC,GAChBtS,KAAKqS,EAAIA,EACTrS,KAAKsS,EAAIA,EAvENrR,KAAK0P,OACR/D,EAAcjE,GAiDhBxD,EAAG3E,UAAU+R,MAAQ,SAAgBhM,EAAKnF,GACxC,IAAIgJ,EACAlE,EAAMlG,KAAKW,OAAS4F,EAAI5F,OAW5B,OATEyJ,EADkB,KAAhBpK,KAAKW,QAAgC,KAAf4F,EAAI5F,OACtBiM,EAAY5M,KAAMuG,EAAKnF,GACpB8E,EAAM,GACTyC,EAAW3I,KAAMuG,EAAKnF,GACnB8E,EAAM,KACT6L,EAAS/R,KAAMuG,EAAKnF,GAEpB6Q,EAAWjS,KAAMuG,EAAKnF,GAGvBgJ,GAWT+H,EAAK3R,UAAUgS,QAAU,SAAkBC,GAGzC,IAFA,IAAI/H,EAAI,IAAIrK,MAAMoS,GACdC,EAAIvN,EAAG3E,UAAUiK,WAAWgI,GAAK,EAC5BvR,EAAI,EAAGA,EAAIuR,EAAGvR,IACrBwJ,EAAExJ,GAAKlB,KAAK2S,OAAOzR,EAAGwR,EAAGD,GAG3B,OAAO/H,GAITyH,EAAK3R,UAAUmS,OAAS,SAAiBN,EAAGK,EAAGD,GAC7C,GAAU,IAANJ,GAAWA,IAAMI,EAAI,EAAG,OAAOJ,EAGnC,IADA,IAAIO,EAAK,EACA1R,EAAI,EAAGA,EAAIwR,EAAGxR,IACrB0R,IAAW,EAAJP,IAAWK,EAAIxR,EAAI,EAC1BmR,IAAM,EAGR,OAAOO,GAKTT,EAAK3R,UAAUqS,QAAU,SAAkBC,EAAKC,EAAKC,EAAKC,EAAMC,EAAMT,GACpE,IAAK,IAAIvR,EAAI,EAAGA,EAAIuR,EAAGvR,IACrB+R,EAAK/R,GAAK6R,EAAID,EAAI5R,IAClBgS,EAAKhS,GAAK8R,EAAIF,EAAI5R,KAItBiR,EAAK3R,UAAU2S,UAAY,SAAoBJ,EAAKC,EAAKC,EAAMC,EAAMT,EAAGK,GACtE9S,KAAK6S,QAAQC,EAAKC,EAAKC,EAAKC,EAAMC,EAAMT,GAExC,IAAK,IAAIW,EAAI,EAAGA,EAAIX,EAAGW,IAAM,EAM3B,IALA,IAAIV,EAAIU,GAAK,EAETC,EAAQpS,KAAKqS,IAAI,EAAIrS,KAAKsS,GAAKb,GAC/Bc,EAAQvS,KAAKwS,IAAI,EAAIxS,KAAKsS,GAAKb,GAE1BgB,EAAI,EAAGA,EAAIjB,EAAGiB,GAAKhB,EAI1B,IAHA,IAAIiB,EAASN,EACTO,EAASJ,EAEJpM,EAAI,EAAGA,EAAIgM,EAAGhM,IAAK,CAC1B,IAAIyM,EAAKZ,EAAKS,EAAItM,GACd0M,EAAKZ,EAAKQ,EAAItM,GAEd2M,EAAKd,EAAKS,EAAItM,EAAIgM,GAClBY,EAAKd,EAAKQ,EAAItM,EAAIgM,GAElBa,EAAKN,EAASI,EAAKH,EAASI,EAEhCA,EAAKL,EAASK,EAAKJ,EAASG,EAC5BA,EAAKE,EAELhB,EAAKS,EAAItM,GAAKyM,EAAKE,EACnBb,EAAKQ,EAAItM,GAAK0M,EAAKE,EAEnBf,EAAKS,EAAItM,EAAIgM,GAAKS,EAAKE,EACvBb,EAAKQ,EAAItM,EAAIgM,GAAKU,EAAKE,EAGnB5M,IAAMsL,IACRuB,EAAKZ,EAAQM,EAASH,EAAQI,EAE9BA,EAASP,EAAQO,EAASJ,EAAQG,EAClCA,EAASM,KAOnB9B,EAAK3R,UAAU0T,YAAc,SAAsBC,EAAGC,GACpD,IAAI3B,EAAqB,EAAjBxR,KAAKQ,IAAI2S,EAAGD,GAChBE,EAAU,EAAJ5B,EACNvR,EAAI,EACR,IAAKuR,EAAIA,EAAI,EAAI,EAAGA,EAAGA,KAAU,EAC/BvR,IAGF,OAAO,GAAKA,EAAI,EAAImT,GAGtBlC,EAAK3R,UAAU8T,UAAY,SAAoBvB,EAAKC,EAAKP,GACvD,KAAIA,GAAK,GAET,IAAK,IAAIvR,EAAI,EAAGA,EAAIuR,EAAI,EAAGvR,IAAK,CAC9B,IAAIwJ,EAAIqI,EAAI7R,GAEZ6R,EAAI7R,GAAK6R,EAAIN,EAAIvR,EAAI,GACrB6R,EAAIN,EAAIvR,EAAI,GAAKwJ,EAEjBA,EAAIsI,EAAI9R,GAER8R,EAAI9R,IAAM8R,EAAIP,EAAIvR,EAAI,GACtB8R,EAAIP,EAAIvR,EAAI,IAAMwJ,IAItByH,EAAK3R,UAAU+T,aAAe,SAAuBC,EAAI/B,GAEvD,IADA,IAAIzJ,EAAQ,EACH9H,EAAI,EAAGA,EAAIuR,EAAI,EAAGvR,IAAK,CAC9B,IAAImG,EAAoC,KAAhCpG,KAAKwT,MAAMD,EAAG,EAAItT,EAAI,GAAKuR,GACjCxR,KAAKwT,MAAMD,EAAG,EAAItT,GAAKuR,GACvBzJ,EAEFwL,EAAGtT,GAAS,SAAJmG,EAGN2B,EADE3B,EAAI,SACE,EAEAA,EAAI,SAAY,EAI5B,OAAOmN,GAGTrC,EAAK3R,UAAUkU,WAAa,SAAqBF,EAAItO,EAAK6M,EAAKN,GAE7D,IADA,IAAIzJ,EAAQ,EACH9H,EAAI,EAAGA,EAAIgF,EAAKhF,IACvB8H,GAAyB,EAARwL,EAAGtT,GAEpB6R,EAAI,EAAI7R,GAAa,KAAR8H,EAAgBA,KAAkB,GAC/C+J,EAAI,EAAI7R,EAAI,GAAa,KAAR8H,EAAgBA,KAAkB,GAIrD,IAAK9H,EAAI,EAAIgF,EAAKhF,EAAIuR,IAAKvR,EACzB6R,EAAI7R,GAAK,EAGXrB,EAAiB,IAAVmJ,GACPnJ,EAA6B,MAAb,KAARmJ,KAGVmJ,EAAK3R,UAAUmU,KAAO,SAAelC,GAEnC,IADA,IAAImC,EAAK,IAAIvU,MAAMoS,GACVvR,EAAI,EAAGA,EAAIuR,EAAGvR,IACrB0T,EAAG1T,GAAK,EAGV,OAAO0T,GAGTzC,EAAK3R,UAAU4R,KAAO,SAAeC,EAAGC,EAAGlR,GACzC,IAAIqR,EAAI,EAAIzS,KAAKkU,YAAY7B,EAAE1R,OAAQ2R,EAAE3R,QAErCmS,EAAM9S,KAAKwS,QAAQC,GAEnBoC,EAAI7U,KAAK2U,KAAKlC,GAEdM,EAAM,IAAI1S,MAAMoS,GAChBqC,EAAO,IAAIzU,MAAMoS,GACjBsC,EAAO,IAAI1U,MAAMoS,GAEjBuC,EAAO,IAAI3U,MAAMoS,GACjBwC,EAAQ,IAAI5U,MAAMoS,GAClByC,EAAQ,IAAI7U,MAAMoS,GAElB0C,EAAO/T,EAAIqE,MACf0P,EAAKxU,OAAS8R,EAEdzS,KAAK0U,WAAWrC,EAAE5M,MAAO4M,EAAE1R,OAAQoS,EAAKN,GACxCzS,KAAK0U,WAAWpC,EAAE7M,MAAO6M,EAAE3R,OAAQqU,EAAMvC,GAEzCzS,KAAKmT,UAAUJ,EAAK8B,EAAGC,EAAMC,EAAMtC,EAAGK,GACtC9S,KAAKmT,UAAU6B,EAAMH,EAAGI,EAAOC,EAAOzC,EAAGK,GAEzC,IAAK,IAAI5R,EAAI,EAAGA,EAAIuR,EAAGvR,IAAK,CAC1B,IAAI+S,EAAKa,EAAK5T,GAAK+T,EAAM/T,GAAK6T,EAAK7T,GAAKgU,EAAMhU,GAC9C6T,EAAK7T,GAAK4T,EAAK5T,GAAKgU,EAAMhU,GAAK6T,EAAK7T,GAAK+T,EAAM/T,GAC/C4T,EAAK5T,GAAK+S,EAUZ,OAPAjU,KAAKsU,UAAUQ,EAAMC,EAAMtC,GAC3BzS,KAAKmT,UAAU2B,EAAMC,EAAMI,EAAMN,EAAGpC,EAAGK,GACvC9S,KAAKsU,UAAUa,EAAMN,EAAGpC,GACxBzS,KAAKuU,aAAaY,EAAM1C,GAExBrR,EAAIoE,SAAW6M,EAAE7M,SAAW8M,EAAE9M,SAC9BpE,EAAIT,OAAS0R,EAAE1R,OAAS2R,EAAE3R,OACnBS,EAAI8F,SAIb/B,EAAG3E,UAAU8F,IAAM,SAAcC,GAC/B,IAAInF,EAAM,IAAI+D,EAAG,MAEjB,OADA/D,EAAIqE,MAAQ,IAAIpF,MAAML,KAAKW,OAAS4F,EAAI5F,QACjCX,KAAKuS,MAAMhM,EAAKnF,IAIzB+D,EAAG3E,UAAU4U,KAAO,SAAe7O,GACjC,IAAInF,EAAM,IAAI+D,EAAG,MAEjB,OADA/D,EAAIqE,MAAQ,IAAIpF,MAAML,KAAKW,OAAS4F,EAAI5F,QACjCsR,EAAWjS,KAAMuG,EAAKnF,IAI/B+D,EAAG3E,UAAUmQ,KAAO,SAAepK,GACjC,OAAOvG,KAAK+H,QAAQwK,MAAMhM,EAAKvG,OAGjCmF,EAAG3E,UAAUkH,MAAQ,SAAgBnB,GACnC1G,EAAsB,kBAAR0G,GACd1G,EAAO0G,EAAM,UAIb,IADA,IAAIyC,EAAQ,EACH9H,EAAI,EAAGA,EAAIlB,KAAKW,OAAQO,IAAK,CACpC,IAAImG,GAAqB,EAAhBrH,KAAKyF,MAAMvE,IAAUqF,EAC1BwC,GAAU,SAAJ1B,IAA0B,SAAR2B,GAC5BA,IAAU,GACVA,GAAU3B,EAAI,SAAa,EAE3B2B,GAASD,IAAO,GAChB/I,KAAKyF,MAAMvE,GAAU,SAAL6H,EAQlB,OALc,IAAVC,IACFhJ,KAAKyF,MAAMvE,GAAK8H,EAChBhJ,KAAKW,UAGAX,MAGTmF,EAAG3E,UAAU6U,KAAO,SAAe9O,GACjC,OAAOvG,KAAK+H,QAAQL,MAAMnB,IAI5BpB,EAAG3E,UAAU8U,IAAM,WACjB,OAAOtV,KAAKsG,IAAItG,OAIlBmF,EAAG3E,UAAU+U,KAAO,WAClB,OAAOvV,KAAK2Q,KAAK3Q,KAAK+H,UAIxB5C,EAAG3E,UAAUoH,IAAM,SAAcrB,GAC/B,IAAIc,EAAIkB,EAAWhC,GACnB,GAAiB,IAAbc,EAAE1G,OAAc,OAAO,IAAIwE,EAAG,GAIlC,IADA,IAAIiF,EAAMpK,KACDkB,EAAI,EAAGA,EAAImG,EAAE1G,OAAQO,IAAKkJ,EAAMA,EAAIkL,MAC3C,GAAa,IAATjO,EAAEnG,GAAU,MAGlB,KAAMA,EAAImG,EAAE1G,OACV,IAAK,IAAI0J,EAAID,EAAIkL,MAAOpU,EAAImG,EAAE1G,OAAQO,IAAKmJ,EAAIA,EAAEiL,MAClC,IAATjO,EAAEnG,KAENkJ,EAAMA,EAAI9D,IAAI+D,IAIlB,OAAOD,GAITjF,EAAG3E,UAAUgV,OAAS,SAAiBC,GACrC5V,EAAuB,kBAAT4V,GAAqBA,GAAQ,GAC3C,IAGIvU,EAHA+E,EAAIwP,EAAO,GACXrC,GAAKqC,EAAOxP,GAAK,GACjByP,EAAa,WAAe,GAAKzP,GAAQ,GAAKA,EAGlD,GAAU,IAANA,EAAS,CACX,IAAI+C,EAAQ,EAEZ,IAAK9H,EAAI,EAAGA,EAAIlB,KAAKW,OAAQO,IAAK,CAChC,IAAIyU,EAAW3V,KAAKyF,MAAMvE,GAAKwU,EAC3BvP,GAAsB,EAAhBnG,KAAKyF,MAAMvE,IAAUyU,GAAa1P,EAC5CjG,KAAKyF,MAAMvE,GAAKiF,EAAI6C,EACpBA,EAAQ2M,IAAc,GAAK1P,EAGzB+C,IACFhJ,KAAKyF,MAAMvE,GAAK8H,EAChBhJ,KAAKW,UAIT,GAAU,IAANyS,EAAS,CACX,IAAKlS,EAAIlB,KAAKW,OAAS,EAAGO,GAAK,EAAGA,IAChClB,KAAKyF,MAAMvE,EAAIkS,GAAKpT,KAAKyF,MAAMvE,GAGjC,IAAKA,EAAI,EAAGA,EAAIkS,EAAGlS,IACjBlB,KAAKyF,MAAMvE,GAAK,EAGlBlB,KAAKW,QAAUyS,EAGjB,OAAOpT,KAAKkH,SAGd/B,EAAG3E,UAAUoV,MAAQ,SAAgBH,GAGnC,OADA5V,EAAyB,IAAlBG,KAAKwF,UACLxF,KAAKwV,OAAOC,IAMrBtQ,EAAG3E,UAAU+J,OAAS,SAAiBkL,EAAMI,EAAMC,GAEjD,IAAIC,EADJlW,EAAuB,kBAAT4V,GAAqBA,GAAQ,GAGzCM,EADEF,GACGA,EAAQA,EAAO,IAAO,GAEvB,EAGN,IAAI5P,EAAIwP,EAAO,GACXrC,EAAInS,KAAKD,KAAKyU,EAAOxP,GAAK,GAAIjG,KAAKW,QACnCqV,EAAO,SAAc,WAAc/P,GAAMA,EACzCgQ,EAAcH,EAMlB,GAJAC,GAAK3C,EACL2C,EAAI9U,KAAKQ,IAAI,EAAGsU,GAGZE,EAAa,CACf,IAAK,IAAI/U,EAAI,EAAGA,EAAIkS,EAAGlS,IACrB+U,EAAYxQ,MAAMvE,GAAKlB,KAAKyF,MAAMvE,GAEpC+U,EAAYtV,OAASyS,EAGvB,GAAU,IAANA,QAEG,GAAIpT,KAAKW,OAASyS,EAEvB,IADApT,KAAKW,QAAUyS,EACVlS,EAAI,EAAGA,EAAIlB,KAAKW,OAAQO,IAC3BlB,KAAKyF,MAAMvE,GAAKlB,KAAKyF,MAAMvE,EAAIkS,QAGjCpT,KAAKyF,MAAM,GAAK,EAChBzF,KAAKW,OAAS,EAGhB,IAAIqI,EAAQ,EACZ,IAAK9H,EAAIlB,KAAKW,OAAS,EAAGO,GAAK,IAAgB,IAAV8H,GAAe9H,GAAK6U,GAAI7U,IAAK,CAChE,IAAIuG,EAAuB,EAAhBzH,KAAKyF,MAAMvE,GACtBlB,KAAKyF,MAAMvE,GAAM8H,GAAU,GAAK/C,EAAOwB,IAASxB,EAChD+C,EAAQvB,EAAOuO,EAajB,OATIC,GAAyB,IAAVjN,IACjBiN,EAAYxQ,MAAMwQ,EAAYtV,UAAYqI,GAGxB,IAAhBhJ,KAAKW,SACPX,KAAKyF,MAAM,GAAK,EAChBzF,KAAKW,OAAS,GAGTX,KAAKkH,SAGd/B,EAAG3E,UAAU0V,MAAQ,SAAgBT,EAAMI,EAAMC,GAG/C,OADAjW,EAAyB,IAAlBG,KAAKwF,UACLxF,KAAKuK,OAAOkL,EAAMI,EAAMC,IAIjC3Q,EAAG3E,UAAU2V,KAAO,SAAeV,GACjC,OAAOzV,KAAK+H,QAAQ6N,MAAMH,IAG5BtQ,EAAG3E,UAAU4V,MAAQ,SAAgBX,GACnC,OAAOzV,KAAK+H,QAAQyN,OAAOC,IAI7BtQ,EAAG3E,UAAU6V,KAAO,SAAeZ,GACjC,OAAOzV,KAAK+H,QAAQmO,MAAMT,IAG5BtQ,EAAG3E,UAAU8V,MAAQ,SAAgBb,GACnC,OAAOzV,KAAK+H,QAAQwC,OAAOkL,IAI7BtQ,EAAG3E,UAAU4K,MAAQ,SAAgB3C,GACnC5I,EAAsB,kBAAR4I,GAAoBA,GAAO,GACzC,IAAIxC,EAAIwC,EAAM,GACV2K,GAAK3K,EAAMxC,GAAK,GAChBoE,EAAI,GAAKpE,EAGb,GAAIjG,KAAKW,QAAUyS,EAAG,OAAO,EAG7B,IAAI/L,EAAIrH,KAAKyF,MAAM2N,GAEnB,SAAU/L,EAAIgD,IAIhBlF,EAAG3E,UAAU+V,OAAS,SAAiBd,GACrC5V,EAAuB,kBAAT4V,GAAqBA,GAAQ,GAC3C,IAAIxP,EAAIwP,EAAO,GACXrC,GAAKqC,EAAOxP,GAAK,GAIrB,GAFApG,EAAyB,IAAlBG,KAAKwF,SAAgB,2CAExBxF,KAAKW,QAAUyS,EACjB,OAAOpT,KAQT,GALU,IAANiG,GACFmN,IAEFpT,KAAKW,OAASM,KAAKD,IAAIoS,EAAGpT,KAAKW,QAErB,IAANsF,EAAS,CACX,IAAI+P,EAAO,SAAc,WAAc/P,GAAMA,EAC7CjG,KAAKyF,MAAMzF,KAAKW,OAAS,IAAMqV,EAGjC,OAAOhW,KAAKkH,SAId/B,EAAG3E,UAAUgW,MAAQ,SAAgBf,GACnC,OAAOzV,KAAK+H,QAAQwO,OAAOd,IAI7BtQ,EAAG3E,UAAU0K,MAAQ,SAAgB3E,GAGnC,OAFA1G,EAAsB,kBAAR0G,GACd1G,EAAO0G,EAAM,UACTA,EAAM,EAAUvG,KAAKyW,OAAOlQ,GAGV,IAAlBvG,KAAKwF,SACa,IAAhBxF,KAAKW,SAAiC,EAAhBX,KAAKyF,MAAM,IAAUc,GAC7CvG,KAAKyF,MAAM,GAAKc,GAAuB,EAAhBvG,KAAKyF,MAAM,IAClCzF,KAAKwF,SAAW,EACTxF,OAGTA,KAAKwF,SAAW,EAChBxF,KAAKyW,MAAMlQ,GACXvG,KAAKwF,SAAW,EACTxF,MAIFA,KAAK2H,OAAOpB,IAGrBpB,EAAG3E,UAAUmH,OAAS,SAAiBpB,GACrCvG,KAAKyF,MAAM,IAAMc,EAGjB,IAAK,IAAIrF,EAAI,EAAGA,EAAIlB,KAAKW,QAAUX,KAAKyF,MAAMvE,IAAM,SAAWA,IAC7DlB,KAAKyF,MAAMvE,IAAM,SACbA,IAAMlB,KAAKW,OAAS,EACtBX,KAAKyF,MAAMvE,EAAI,GAAK,EAEpBlB,KAAKyF,MAAMvE,EAAI,KAKnB,OAFAlB,KAAKW,OAASM,KAAKQ,IAAIzB,KAAKW,OAAQO,EAAI,GAEjClB,MAITmF,EAAG3E,UAAUiW,MAAQ,SAAgBlQ,GAGnC,GAFA1G,EAAsB,kBAAR0G,GACd1G,EAAO0G,EAAM,UACTA,EAAM,EAAG,OAAOvG,KAAKkL,OAAO3E,GAEhC,GAAsB,IAAlBvG,KAAKwF,SAIP,OAHAxF,KAAKwF,SAAW,EAChBxF,KAAKkL,MAAM3E,GACXvG,KAAKwF,SAAW,EACTxF,KAKT,GAFAA,KAAKyF,MAAM,IAAMc,EAEG,IAAhBvG,KAAKW,QAAgBX,KAAKyF,MAAM,GAAK,EACvCzF,KAAKyF,MAAM,IAAMzF,KAAKyF,MAAM,GAC5BzF,KAAKwF,SAAW,OAGhB,IAAK,IAAItE,EAAI,EAAGA,EAAIlB,KAAKW,QAAUX,KAAKyF,MAAMvE,GAAK,EAAGA,IACpDlB,KAAKyF,MAAMvE,IAAM,SACjBlB,KAAKyF,MAAMvE,EAAI,IAAM,EAIzB,OAAOlB,KAAKkH,SAGd/B,EAAG3E,UAAUkW,KAAO,SAAenQ,GACjC,OAAOvG,KAAK+H,QAAQmD,MAAM3E,IAG5BpB,EAAG3E,UAAUmW,KAAO,SAAepQ,GACjC,OAAOvG,KAAK+H,QAAQ0O,MAAMlQ,IAG5BpB,EAAG3E,UAAUoW,KAAO,WAGlB,OAFA5W,KAAKwF,SAAW,EAETxF,MAGTmF,EAAG3E,UAAUwK,IAAM,WACjB,OAAOhL,KAAK+H,QAAQ6O,QAGtBzR,EAAG3E,UAAUqW,aAAe,SAAuBtQ,EAAKD,EAAKwQ,GAC3D,IACI5V,EAIAmG,EALAnB,EAAMK,EAAI5F,OAASmW,EAGvB9W,KAAKgI,QAAQ9B,GAGb,IAAI8C,EAAQ,EACZ,IAAK9H,EAAI,EAAGA,EAAIqF,EAAI5F,OAAQO,IAAK,CAC/BmG,GAA6B,EAAxBrH,KAAKyF,MAAMvE,EAAI4V,IAAc9N,EAClC,IAAItC,GAAwB,EAAfH,EAAId,MAAMvE,IAAUoF,EACjCe,GAAa,SAARX,EACLsC,GAAS3B,GAAK,KAAQX,EAAQ,SAAa,GAC3C1G,KAAKyF,MAAMvE,EAAI4V,GAAa,SAAJzP,EAE1B,KAAOnG,EAAIlB,KAAKW,OAASmW,EAAO5V,IAC9BmG,GAA6B,EAAxBrH,KAAKyF,MAAMvE,EAAI4V,IAAc9N,EAClCA,EAAQ3B,GAAK,GACbrH,KAAKyF,MAAMvE,EAAI4V,GAAa,SAAJzP,EAG1B,GAAc,IAAV2B,EAAa,OAAOhJ,KAAKkH,QAK7B,IAFArH,GAAkB,IAAXmJ,GACPA,EAAQ,EACH9H,EAAI,EAAGA,EAAIlB,KAAKW,OAAQO,IAC3BmG,IAAsB,EAAhBrH,KAAKyF,MAAMvE,IAAU8H,EAC3BA,EAAQ3B,GAAK,GACbrH,KAAKyF,MAAMvE,GAAS,SAAJmG,EAIlB,OAFArH,KAAKwF,SAAW,EAETxF,KAAKkH,SAGd/B,EAAG3E,UAAUuW,SAAW,SAAmBxQ,EAAKyQ,GAC9C,IAAIF,EAAQ9W,KAAKW,OAAS4F,EAAI5F,OAE1BkI,EAAI7I,KAAK+H,QACTe,EAAIvC,EAGJ0Q,EAA8B,EAAxBnO,EAAErD,MAAMqD,EAAEnI,OAAS,GACzBuW,EAAUlX,KAAKyK,WAAWwM,GAC9BH,EAAQ,GAAKI,EACC,IAAVJ,IACFhO,EAAIA,EAAEsN,MAAMU,GACZjO,EAAE2M,OAAOsB,GACTG,EAA8B,EAAxBnO,EAAErD,MAAMqD,EAAEnI,OAAS,IAI3B,IACI0J,EADA+J,EAAIvL,EAAElI,OAASmI,EAAEnI,OAGrB,GAAa,QAATqW,EAAgB,CAClB3M,EAAI,IAAIlF,EAAG,MACXkF,EAAE1J,OAASyT,EAAI,EACf/J,EAAE5E,MAAQ,IAAIpF,MAAMgK,EAAE1J,QACtB,IAAK,IAAIO,EAAI,EAAGA,EAAImJ,EAAE1J,OAAQO,IAC5BmJ,EAAE5E,MAAMvE,GAAK,EAIjB,IAAIiW,EAAOtO,EAAEd,QAAQ8O,aAAa/N,EAAG,EAAGsL,GAClB,IAAlB+C,EAAK3R,WACPqD,EAAIsO,EACA9M,IACFA,EAAE5E,MAAM2O,GAAK,IAIjB,IAAK,IAAIhN,EAAIgN,EAAI,EAAGhN,GAAK,EAAGA,IAAK,CAC/B,IAAIgQ,EAAmC,UAAL,EAAxBvO,EAAEpD,MAAMqD,EAAEnI,OAASyG,KACE,EAA5ByB,EAAEpD,MAAMqD,EAAEnI,OAASyG,EAAI,IAI1BgQ,EAAKnW,KAAKD,IAAKoW,EAAKH,EAAO,EAAG,UAE9BpO,EAAEgO,aAAa/N,EAAGsO,EAAIhQ,GACtB,MAAsB,IAAfyB,EAAErD,SACP4R,IACAvO,EAAErD,SAAW,EACbqD,EAAEgO,aAAa/N,EAAG,EAAG1B,GAChByB,EAAEW,WACLX,EAAErD,UAAY,GAGd6E,IACFA,EAAE5E,MAAM2B,GAAKgQ,GAajB,OAVI/M,GACFA,EAAEnD,QAEJ2B,EAAE3B,QAGW,QAAT8P,GAA4B,IAAVF,GACpBjO,EAAE0B,OAAOuM,GAGJ,CACLO,IAAKhN,GAAK,KACVxL,IAAKgK,IAQT1D,EAAG3E,UAAU8W,OAAS,SAAiB/Q,EAAKyQ,EAAMO,GAGhD,OAFA1X,GAAQ0G,EAAIiD,UAERxJ,KAAKwJ,SACA,CACL6N,IAAK,IAAIlS,EAAG,GACZtG,IAAK,IAAIsG,EAAG,IAKM,IAAlBnF,KAAKwF,UAAmC,IAAjBe,EAAIf,UAC7B4E,EAAMpK,KAAKwL,MAAM8L,OAAO/Q,EAAKyQ,GAEhB,QAATA,IACFK,EAAMjN,EAAIiN,IAAI7L,OAGH,QAATwL,IACFnY,EAAMuL,EAAIvL,IAAI2M,MACV+L,GAA6B,IAAjB1Y,EAAI2G,UAClB3G,EAAI2N,KAAKjG,IAIN,CACL8Q,IAAKA,EACLxY,IAAKA,IAIa,IAAlBmB,KAAKwF,UAAmC,IAAjBe,EAAIf,UAC7B4E,EAAMpK,KAAKsX,OAAO/Q,EAAIiF,MAAOwL,GAEhB,QAATA,IACFK,EAAMjN,EAAIiN,IAAI7L,OAGT,CACL6L,IAAKA,EACLxY,IAAKuL,EAAIvL,MAI0B,KAAlCmB,KAAKwF,SAAWe,EAAIf,WACvB4E,EAAMpK,KAAKwL,MAAM8L,OAAO/Q,EAAIiF,MAAOwL,GAEtB,QAATA,IACFnY,EAAMuL,EAAIvL,IAAI2M,MACV+L,GAA6B,IAAjB1Y,EAAI2G,UAClB3G,EAAI4N,KAAKlG,IAIN,CACL8Q,IAAKjN,EAAIiN,IACTxY,IAAKA,IAOL0H,EAAI5F,OAASX,KAAKW,QAAUX,KAAK2G,IAAIJ,GAAO,EACvC,CACL8Q,IAAK,IAAIlS,EAAG,GACZtG,IAAKmB,MAKU,IAAfuG,EAAI5F,OACO,QAATqW,EACK,CACLK,IAAKrX,KAAKwX,KAAKjR,EAAId,MAAM,IACzB5G,IAAK,MAII,QAATmY,EACK,CACLK,IAAK,KACLxY,IAAK,IAAIsG,EAAGnF,KAAKyJ,KAAKlD,EAAId,MAAM,MAI7B,CACL4R,IAAKrX,KAAKwX,KAAKjR,EAAId,MAAM,IACzB5G,IAAK,IAAIsG,EAAGnF,KAAKyJ,KAAKlD,EAAId,MAAM,MAI7BzF,KAAK+W,SAASxQ,EAAKyQ,GAlF1B,IAAIK,EAAKxY,EAAKuL,GAsFhBjF,EAAG3E,UAAU6W,IAAM,SAAc9Q,GAC/B,OAAOvG,KAAKsX,OAAO/Q,EAAK,OAAO,GAAO8Q,KAIxClS,EAAG3E,UAAU3B,IAAM,SAAc0H,GAC/B,OAAOvG,KAAKsX,OAAO/Q,EAAK,OAAO,GAAO1H,KAGxCsG,EAAG3E,UAAUiX,KAAO,SAAelR,GACjC,OAAOvG,KAAKsX,OAAO/Q,EAAK,OAAO,GAAM1H,KAIvCsG,EAAG3E,UAAUkX,SAAW,SAAmBnR,GACzC,IAAIoR,EAAK3X,KAAKsX,OAAO/Q,GAGrB,GAAIoR,EAAG9Y,IAAI2K,SAAU,OAAOmO,EAAGN,IAE/B,IAAIxY,EAA0B,IAApB8Y,EAAGN,IAAI7R,SAAiBmS,EAAG9Y,IAAI4N,KAAKlG,GAAOoR,EAAG9Y,IAEpD+Y,EAAOrR,EAAI+P,MAAM,GACjBuB,EAAKtR,EAAI+D,MAAM,GACf3D,EAAM9H,EAAI8H,IAAIiR,GAGlB,OAAIjR,EAAM,GAAY,IAAPkR,GAAoB,IAARlR,EAAkBgR,EAAGN,IAGrB,IAApBM,EAAGN,IAAI7R,SAAiBmS,EAAGN,IAAIZ,MAAM,GAAKkB,EAAGN,IAAInM,MAAM,IAGhE/F,EAAG3E,UAAUiJ,KAAO,SAAelD,GACjC1G,EAAO0G,GAAO,UAId,IAHA,IAAImN,GAAK,GAAK,IAAMnN,EAEhBuR,EAAM,EACD5W,EAAIlB,KAAKW,OAAS,EAAGO,GAAK,EAAGA,IACpC4W,GAAOpE,EAAIoE,GAAuB,EAAhB9X,KAAKyF,MAAMvE,KAAWqF,EAG1C,OAAOuR,GAIT3S,EAAG3E,UAAUkJ,MAAQ,SAAgBnD,GACnC1G,EAAO0G,GAAO,UAGd,IADA,IAAIyC,EAAQ,EACH9H,EAAIlB,KAAKW,OAAS,EAAGO,GAAK,EAAGA,IAAK,CACzC,IAAImG,GAAqB,EAAhBrH,KAAKyF,MAAMvE,IAAkB,SAAR8H,EAC9BhJ,KAAKyF,MAAMvE,GAAMmG,EAAId,EAAO,EAC5ByC,EAAQ3B,EAAId,EAGd,OAAOvG,KAAKkH,SAGd/B,EAAG3E,UAAUgX,KAAO,SAAejR,GACjC,OAAOvG,KAAK+H,QAAQ2B,MAAMnD,IAG5BpB,EAAG3E,UAAUuX,KAAO,SAAerE,GACjC7T,EAAsB,IAAf6T,EAAElO,UACT3F,GAAQ6T,EAAElK,UAEV,IAAI6I,EAAIrS,KACJsS,EAAIoB,EAAE3L,QAGRsK,EADiB,IAAfA,EAAE7M,SACA6M,EAAEoF,KAAK/D,GAEPrB,EAAEtK,QAIR,IAAIiQ,EAAI,IAAI7S,EAAG,GACX8S,EAAI,IAAI9S,EAAG,GAGX+S,EAAI,IAAI/S,EAAG,GACXgT,EAAI,IAAIhT,EAAG,GAEXiT,EAAI,EAER,MAAO/F,EAAEgG,UAAY/F,EAAE+F,SACrBhG,EAAE9H,OAAO,GACT+H,EAAE/H,OAAO,KACP6N,EAGJ,IAAIE,EAAKhG,EAAEvK,QACPwQ,EAAKlG,EAAEtK,QAEX,OAAQsK,EAAE7I,SAAU,CAClB,IAAK,IAAItI,EAAI,EAAGsX,EAAK,EAAyB,KAArBnG,EAAE5M,MAAM,GAAK+S,IAAatX,EAAI,KAAMA,EAAGsX,IAAO,GACvE,GAAItX,EAAI,EAAG,CACTmR,EAAE9H,OAAOrJ,GACT,MAAOA,KAAM,GACP8W,EAAES,SAAWR,EAAEQ,WACjBT,EAAExL,KAAK8L,GACPL,EAAExL,KAAK8L,IAGTP,EAAEzN,OAAO,GACT0N,EAAE1N,OAAO,GAIb,IAAK,IAAInD,EAAI,EAAGsR,EAAK,EAAyB,KAArBpG,EAAE7M,MAAM,GAAKiT,IAAatR,EAAI,KAAMA,EAAGsR,IAAO,GACvE,GAAItR,EAAI,EAAG,CACTkL,EAAE/H,OAAOnD,GACT,MAAOA,KAAM,GACP8Q,EAAEO,SAAWN,EAAEM,WACjBP,EAAE1L,KAAK8L,GACPH,EAAE1L,KAAK8L,IAGTL,EAAE3N,OAAO,GACT4N,EAAE5N,OAAO,GAIT8H,EAAE1L,IAAI2L,IAAM,GACdD,EAAE5F,KAAK6F,GACP0F,EAAEvL,KAAKyL,GACPD,EAAExL,KAAK0L,KAEP7F,EAAE7F,KAAK4F,GACP6F,EAAEzL,KAAKuL,GACPG,EAAE1L,KAAKwL,IAIX,MAAO,CACLpP,EAAGqP,EACHpP,EAAGqP,EACHQ,IAAKrG,EAAEkD,OAAO4C,KAOlBjT,EAAG3E,UAAUoY,OAAS,SAAiBlF,GACrC7T,EAAsB,IAAf6T,EAAElO,UACT3F,GAAQ6T,EAAElK,UAEV,IAAIX,EAAI7I,KACJ8I,EAAI4K,EAAE3L,QAGRc,EADiB,IAAfA,EAAErD,SACAqD,EAAE4O,KAAK/D,GAEP7K,EAAEd,QAGR,IAuCIqC,EAvCAyO,EAAK,IAAI1T,EAAG,GACZ2T,EAAK,IAAI3T,EAAG,GAEZ4T,EAAQjQ,EAAEf,QAEd,MAAOc,EAAEmQ,KAAK,GAAK,GAAKlQ,EAAEkQ,KAAK,GAAK,EAAG,CACrC,IAAK,IAAI9X,EAAI,EAAGsX,EAAK,EAAyB,KAArB3P,EAAEpD,MAAM,GAAK+S,IAAatX,EAAI,KAAMA,EAAGsX,IAAO,GACvE,GAAItX,EAAI,EAAG,CACT2H,EAAE0B,OAAOrJ,GACT,MAAOA,KAAM,EACP2X,EAAGJ,SACLI,EAAGrM,KAAKuM,GAGVF,EAAGtO,OAAO,GAId,IAAK,IAAInD,EAAI,EAAGsR,EAAK,EAAyB,KAArB5P,EAAErD,MAAM,GAAKiT,IAAatR,EAAI,KAAMA,EAAGsR,IAAO,GACvE,GAAItR,EAAI,EAAG,CACT0B,EAAEyB,OAAOnD,GACT,MAAOA,KAAM,EACP0R,EAAGL,SACLK,EAAGtM,KAAKuM,GAGVD,EAAGvO,OAAO,GAIV1B,EAAElC,IAAImC,IAAM,GACdD,EAAE4D,KAAK3D,GACP+P,EAAGpM,KAAKqM,KAERhQ,EAAE2D,KAAK5D,GACPiQ,EAAGrM,KAAKoM,IAeZ,OATEzO,EADgB,IAAdvB,EAAEmQ,KAAK,GACHH,EAEAC,EAGJ1O,EAAI4O,KAAK,GAAK,GAChB5O,EAAIoC,KAAKkH,GAGJtJ,GAGTjF,EAAG3E,UAAUmY,IAAM,SAAcpS,GAC/B,GAAIvG,KAAKwJ,SAAU,OAAOjD,EAAIyE,MAC9B,GAAIzE,EAAIiD,SAAU,OAAOxJ,KAAKgL,MAE9B,IAAInC,EAAI7I,KAAK+H,QACTe,EAAIvC,EAAIwB,QACZc,EAAErD,SAAW,EACbsD,EAAEtD,SAAW,EAGb,IAAK,IAAIsR,EAAQ,EAAGjO,EAAEwP,UAAYvP,EAAEuP,SAAUvB,IAC5CjO,EAAE0B,OAAO,GACTzB,EAAEyB,OAAO,GAGX,EAAG,CACD,MAAO1B,EAAEwP,SACPxP,EAAE0B,OAAO,GAEX,MAAOzB,EAAEuP,SACPvP,EAAEyB,OAAO,GAGX,IAAItE,EAAI4C,EAAElC,IAAImC,GACd,GAAI7C,EAAI,EAAG,CAET,IAAIyE,EAAI7B,EACRA,EAAIC,EACJA,EAAI4B,OACC,GAAU,IAANzE,GAAyB,IAAd6C,EAAEkQ,KAAK,GAC3B,MAGFnQ,EAAE4D,KAAK3D,SACA,GAET,OAAOA,EAAE0M,OAAOsB,IAIlB3R,EAAG3E,UAAUyY,KAAO,SAAe1S,GACjC,OAAOvG,KAAK+X,KAAKxR,GAAKsC,EAAE4O,KAAKlR,IAG/BpB,EAAG3E,UAAU6X,OAAS,WACpB,OAA+B,KAAP,EAAhBrY,KAAKyF,MAAM,KAGrBN,EAAG3E,UAAUiY,MAAQ,WACnB,OAA+B,KAAP,EAAhBzY,KAAKyF,MAAM,KAIrBN,EAAG3E,UAAU8J,MAAQ,SAAgB/D,GACnC,OAAOvG,KAAKyF,MAAM,GAAKc,GAIzBpB,EAAG3E,UAAU0Y,MAAQ,SAAgBzQ,GACnC5I,EAAsB,kBAAR4I,GACd,IAAIxC,EAAIwC,EAAM,GACV2K,GAAK3K,EAAMxC,GAAK,GAChBoE,EAAI,GAAKpE,EAGb,GAAIjG,KAAKW,QAAUyS,EAGjB,OAFApT,KAAKgI,QAAQoL,EAAI,GACjBpT,KAAKyF,MAAM2N,IAAM/I,EACVrK,KAKT,IADA,IAAIgJ,EAAQqB,EACHnJ,EAAIkS,EAAa,IAAVpK,GAAe9H,EAAIlB,KAAKW,OAAQO,IAAK,CACnD,IAAImG,EAAoB,EAAhBrH,KAAKyF,MAAMvE,GACnBmG,GAAK2B,EACLA,EAAQ3B,IAAM,GACdA,GAAK,SACLrH,KAAKyF,MAAMvE,GAAKmG,EAMlB,OAJc,IAAV2B,IACFhJ,KAAKyF,MAAMvE,GAAK8H,EAChBhJ,KAAKW,UAEAX,MAGTmF,EAAG3E,UAAUgJ,OAAS,WACpB,OAAuB,IAAhBxJ,KAAKW,QAAkC,IAAlBX,KAAKyF,MAAM,IAGzCN,EAAG3E,UAAUwY,KAAO,SAAezS,GACjC,IAOI6D,EAPA5E,EAAWe,EAAM,EAErB,GAAsB,IAAlBvG,KAAKwF,WAAmBA,EAAU,OAAQ,EAC9C,GAAsB,IAAlBxF,KAAKwF,UAAkBA,EAAU,OAAO,EAK5C,GAHAxF,KAAKkH,QAGDlH,KAAKW,OAAS,EAChByJ,EAAM,MACD,CACD5E,IACFe,GAAOA,GAGT1G,EAAO0G,GAAO,SAAW,qBAEzB,IAAIc,EAAoB,EAAhBrH,KAAKyF,MAAM,GACnB2E,EAAM/C,IAAMd,EAAM,EAAIc,EAAId,GAAO,EAAI,EAEvC,OAAsB,IAAlBvG,KAAKwF,SAA8B,GAAN4E,EAC1BA,GAOTjF,EAAG3E,UAAUmG,IAAM,SAAcJ,GAC/B,GAAsB,IAAlBvG,KAAKwF,UAAmC,IAAjBe,EAAIf,SAAgB,OAAQ,EACvD,GAAsB,IAAlBxF,KAAKwF,UAAmC,IAAjBe,EAAIf,SAAgB,OAAO,EAEtD,IAAI4E,EAAMpK,KAAKmZ,KAAK5S,GACpB,OAAsB,IAAlBvG,KAAKwF,SAA8B,GAAN4E,EAC1BA,GAITjF,EAAG3E,UAAU2Y,KAAO,SAAe5S,GAEjC,GAAIvG,KAAKW,OAAS4F,EAAI5F,OAAQ,OAAO,EACrC,GAAIX,KAAKW,OAAS4F,EAAI5F,OAAQ,OAAQ,EAGtC,IADA,IAAIyJ,EAAM,EACDlJ,EAAIlB,KAAKW,OAAS,EAAGO,GAAK,EAAGA,IAAK,CACzC,IAAI2H,EAAoB,EAAhB7I,KAAKyF,MAAMvE,GACf4H,EAAmB,EAAfvC,EAAId,MAAMvE,GAElB,GAAI2H,IAAMC,EAAV,CACID,EAAIC,EACNsB,GAAO,EACEvB,EAAIC,IACbsB,EAAM,GAER,OAEF,OAAOA,GAGTjF,EAAG3E,UAAU4Y,IAAM,SAAc7S,GAC/B,OAA0B,IAAnBvG,KAAKgZ,KAAKzS,IAGnBpB,EAAG3E,UAAU6Y,GAAK,SAAa9S,GAC7B,OAAyB,IAAlBvG,KAAK2G,IAAIJ,IAGlBpB,EAAG3E,UAAU8Y,KAAO,SAAe/S,GACjC,OAAOvG,KAAKgZ,KAAKzS,IAAQ,GAG3BpB,EAAG3E,UAAU+Y,IAAM,SAAchT,GAC/B,OAAOvG,KAAK2G,IAAIJ,IAAQ,GAG1BpB,EAAG3E,UAAUgZ,IAAM,SAAcjT,GAC/B,OAA2B,IAApBvG,KAAKgZ,KAAKzS,IAGnBpB,EAAG3E,UAAUiZ,GAAK,SAAalT,GAC7B,OAA0B,IAAnBvG,KAAK2G,IAAIJ,IAGlBpB,EAAG3E,UAAUkZ,KAAO,SAAenT,GACjC,OAAOvG,KAAKgZ,KAAKzS,IAAQ,GAG3BpB,EAAG3E,UAAUmZ,IAAM,SAAcpT,GAC/B,OAAOvG,KAAK2G,IAAIJ,IAAQ,GAG1BpB,EAAG3E,UAAUoZ,IAAM,SAAcrT,GAC/B,OAA0B,IAAnBvG,KAAKgZ,KAAKzS,IAGnBpB,EAAG3E,UAAUqZ,GAAK,SAAatT,GAC7B,OAAyB,IAAlBvG,KAAK2G,IAAIJ,IAOlBpB,EAAGO,IAAM,SAAca,GACrB,OAAO,IAAIuT,EAAIvT,IAGjBpB,EAAG3E,UAAUuZ,MAAQ,SAAgBC,GAGnC,OAFAna,GAAQG,KAAK0F,IAAK,yCAClB7F,EAAyB,IAAlBG,KAAKwF,SAAgB,iCACrBwU,EAAIC,UAAUja,MAAMka,UAAUF,IAGvC7U,EAAG3E,UAAU2Z,QAAU,WAErB,OADAta,EAAOG,KAAK0F,IAAK,wDACV1F,KAAK0F,IAAI0U,YAAYpa,OAG9BmF,EAAG3E,UAAU0Z,UAAY,SAAoBF,GAE3C,OADAha,KAAK0F,IAAMsU,EACJha,MAGTmF,EAAG3E,UAAU6Z,SAAW,SAAmBL,GAEzC,OADAna,GAAQG,KAAK0F,IAAK,yCACX1F,KAAKka,UAAUF,IAGxB7U,EAAG3E,UAAU8Z,OAAS,SAAiB/T,GAErC,OADA1G,EAAOG,KAAK0F,IAAK,sCACV1F,KAAK0F,IAAIgH,IAAI1M,KAAMuG,IAG5BpB,EAAG3E,UAAU+Z,QAAU,SAAkBhU,GAEvC,OADA1G,EAAOG,KAAK0F,IAAK,uCACV1F,KAAK0F,IAAI8G,KAAKxM,KAAMuG,IAG7BpB,EAAG3E,UAAUga,OAAS,SAAiBjU,GAErC,OADA1G,EAAOG,KAAK0F,IAAK,sCACV1F,KAAK0F,IAAIiH,IAAI3M,KAAMuG,IAG5BpB,EAAG3E,UAAUia,QAAU,SAAkBlU,GAEvC,OADA1G,EAAOG,KAAK0F,IAAK,uCACV1F,KAAK0F,IAAI+G,KAAKzM,KAAMuG,IAG7BpB,EAAG3E,UAAUka,OAAS,SAAiBnU,GAErC,OADA1G,EAAOG,KAAK0F,IAAK,sCACV1F,KAAK0F,IAAIiV,IAAI3a,KAAMuG,IAG5BpB,EAAG3E,UAAUoa,OAAS,SAAiBrU,GAGrC,OAFA1G,EAAOG,KAAK0F,IAAK,sCACjB1F,KAAK0F,IAAImV,SAAS7a,KAAMuG,GACjBvG,KAAK0F,IAAIY,IAAItG,KAAMuG,IAG5BpB,EAAG3E,UAAUsa,QAAU,SAAkBvU,GAGvC,OAFA1G,EAAOG,KAAK0F,IAAK,sCACjB1F,KAAK0F,IAAImV,SAAS7a,KAAMuG,GACjBvG,KAAK0F,IAAIiL,KAAK3Q,KAAMuG,IAG7BpB,EAAG3E,UAAUua,OAAS,WAGpB,OAFAlb,EAAOG,KAAK0F,IAAK,sCACjB1F,KAAK0F,IAAIsV,SAAShb,MACXA,KAAK0F,IAAI4P,IAAItV,OAGtBmF,EAAG3E,UAAUya,QAAU,WAGrB,OAFApb,EAAOG,KAAK0F,IAAK,uCACjB1F,KAAK0F,IAAIsV,SAAShb,MACXA,KAAK0F,IAAI6P,KAAKvV,OAIvBmF,EAAG3E,UAAU0a,QAAU,WAGrB,OAFArb,EAAOG,KAAK0F,IAAK,uCACjB1F,KAAK0F,IAAIsV,SAAShb,MACXA,KAAK0F,IAAIyV,KAAKnb,OAGvBmF,EAAG3E,UAAU4a,QAAU,WAGrB,OAFAvb,EAAOG,KAAK0F,IAAK,uCACjB1F,KAAK0F,IAAIsV,SAAShb,MACXA,KAAK0F,IAAIuT,KAAKjZ,OAIvBmF,EAAG3E,UAAU6a,OAAS,WAGpB,OAFAxb,EAAOG,KAAK0F,IAAK,sCACjB1F,KAAK0F,IAAIsV,SAAShb,MACXA,KAAK0F,IAAI8F,IAAIxL,OAGtBmF,EAAG3E,UAAU8a,OAAS,SAAiB/U,GAGrC,OAFA1G,EAAOG,KAAK0F,MAAQa,EAAIb,IAAK,qBAC7B1F,KAAK0F,IAAIsV,SAAShb,MACXA,KAAK0F,IAAIkC,IAAI5H,KAAMuG,IAI5B,IAAI7H,EAAS,CACX6c,KAAM,KACNC,KAAM,KACNC,KAAM,KACNC,OAAQ,MAIV,SAASC,EAAQC,EAAMlI,GAErB1T,KAAK4b,KAAOA,EACZ5b,KAAK0T,EAAI,IAAIvO,EAAGuO,EAAG,IACnB1T,KAAKmU,EAAInU,KAAK0T,EAAElL,YAChBxI,KAAKiJ,EAAI,IAAI9D,EAAG,GAAGqQ,OAAOxV,KAAKmU,GAAG1H,KAAKzM,KAAK0T,GAE5C1T,KAAK6b,IAAM7b,KAAK8b,OAiDlB,SAASC,IACPJ,EAAOhZ,KACL3C,KACA,OACA,2EA+DJ,SAASgc,IACPL,EAAOhZ,KACL3C,KACA,OACA,kEAIJ,SAASic,IACPN,EAAOhZ,KACL3C,KACA,OACA,yDAIJ,SAASkc,IAEPP,EAAOhZ,KACL3C,KACA,QACA,uEA8CJ,SAAS8Z,EAAK1F,GACZ,GAAiB,kBAANA,EAAgB,CACzB,IAAItV,EAAQqG,EAAGgX,OAAO/H,GACtBpU,KAAKoU,EAAItV,EAAM4U,EACf1T,KAAKlB,MAAQA,OAEbe,EAAOuU,EAAEgF,IAAI,GAAI,kCACjBpZ,KAAKoU,EAAIA,EACTpU,KAAKlB,MAAQ,KAkOjB,SAASsd,EAAMhI,GACb0F,EAAInX,KAAK3C,KAAMoU,GAEfpU,KAAK8W,MAAQ9W,KAAKoU,EAAE5L,YAChBxI,KAAK8W,MAAQ,KAAO,IACtB9W,KAAK8W,OAAS,GAAM9W,KAAK8W,MAAQ,IAGnC9W,KAAKiG,EAAI,IAAId,EAAG,GAAGqQ,OAAOxV,KAAK8W,OAC/B9W,KAAK6X,GAAK7X,KAAKqc,KAAKrc,KAAKiG,EAAEqP,OAC3BtV,KAAKsc,KAAOtc,KAAKiG,EAAE2S,OAAO5Y,KAAKoU,GAE/BpU,KAAKuc,KAAOvc,KAAKsc,KAAKhW,IAAItG,KAAKiG,GAAGwQ,MAAM,GAAGY,IAAIrX,KAAKoU,GACpDpU,KAAKuc,KAAOvc,KAAKuc,KAAK9E,KAAKzX,KAAKiG,GAChCjG,KAAKuc,KAAOvc,KAAKiG,EAAE0G,IAAI3M,KAAKuc,MA5a9BZ,EAAOnb,UAAUsb,KAAO,WACtB,IAAID,EAAM,IAAI1W,EAAG,MAEjB,OADA0W,EAAIpW,MAAQ,IAAIpF,MAAMY,KAAKS,KAAK1B,KAAKmU,EAAI,KAClC0H,GAGTF,EAAOnb,UAAUgc,QAAU,SAAkBjW,GAG3C,IACIkW,EADAxW,EAAIM,EAGR,GACEvG,KAAK0c,MAAMzW,EAAGjG,KAAK6b,KACnB5V,EAAIjG,KAAK2c,MAAM1W,GACfA,EAAIA,EAAEuG,KAAKxM,KAAK6b,KAChBY,EAAOxW,EAAEuC,kBACFiU,EAAOzc,KAAKmU,GAErB,IAAIxN,EAAM8V,EAAOzc,KAAKmU,GAAK,EAAIlO,EAAEkT,KAAKnZ,KAAK0T,GAgB3C,OAfY,IAAR/M,GACFV,EAAER,MAAM,GAAK,EACbQ,EAAEtF,OAAS,GACFgG,EAAM,EACfV,EAAEwG,KAAKzM,KAAK0T,QAEInU,IAAZ0G,EAAEiB,MAEJjB,EAAEiB,QAGFjB,EAAE2W,SAIC3W,GAGT0V,EAAOnb,UAAUkc,MAAQ,SAAgBG,EAAOzb,GAC9Cyb,EAAMtS,OAAOvK,KAAKmU,EAAG,EAAG/S,IAG1Bua,EAAOnb,UAAUmc,MAAQ,SAAgBpW,GACvC,OAAOA,EAAIoK,KAAK3Q,KAAKiJ,IASvB7G,EAAS2Z,EAAMJ,GAEfI,EAAKvb,UAAUkc,MAAQ,SAAgBG,EAAOC,GAK5C,IAHA,IAAI9G,EAAO,QAEP+G,EAAS9b,KAAKD,IAAI6b,EAAMlc,OAAQ,GAC3BO,EAAI,EAAGA,EAAI6b,EAAQ7b,IAC1B4b,EAAOrX,MAAMvE,GAAK2b,EAAMpX,MAAMvE,GAIhC,GAFA4b,EAAOnc,OAASoc,EAEZF,EAAMlc,QAAU,EAGlB,OAFAkc,EAAMpX,MAAM,GAAK,OACjBoX,EAAMlc,OAAS,GAKjB,IAAIqc,EAAOH,EAAMpX,MAAM,GAGvB,IAFAqX,EAAOrX,MAAMqX,EAAOnc,UAAYqc,EAAOhH,EAElC9U,EAAI,GAAIA,EAAI2b,EAAMlc,OAAQO,IAAK,CAClC,IAAI+b,EAAwB,EAAjBJ,EAAMpX,MAAMvE,GACvB2b,EAAMpX,MAAMvE,EAAI,KAAQ+b,EAAOjH,IAAS,EAAMgH,IAAS,GACvDA,EAAOC,EAETD,KAAU,GACVH,EAAMpX,MAAMvE,EAAI,IAAM8b,EACT,IAATA,GAAcH,EAAMlc,OAAS,GAC/Bkc,EAAMlc,QAAU,GAEhBkc,EAAMlc,QAAU,GAIpBob,EAAKvb,UAAUmc,MAAQ,SAAgBpW,GAErCA,EAAId,MAAMc,EAAI5F,QAAU,EACxB4F,EAAId,MAAMc,EAAI5F,OAAS,GAAK,EAC5B4F,EAAI5F,QAAU,EAId,IADA,IAAIoI,EAAK,EACA7H,EAAI,EAAGA,EAAIqF,EAAI5F,OAAQO,IAAK,CACnC,IAAImG,EAAmB,EAAfd,EAAId,MAAMvE,GAClB6H,GAAU,IAAJ1B,EACNd,EAAId,MAAMvE,GAAU,SAAL6H,EACfA,EAAS,GAAJ1B,GAAa0B,EAAK,SAAa,GAUtC,OANkC,IAA9BxC,EAAId,MAAMc,EAAI5F,OAAS,KACzB4F,EAAI5F,SAC8B,IAA9B4F,EAAId,MAAMc,EAAI5F,OAAS,IACzB4F,EAAI5F,UAGD4F,GASTnE,EAAS4Z,EAAML,GAQfvZ,EAAS6Z,EAAMN,GASfvZ,EAAS8Z,EAAQP,GAEjBO,EAAO1b,UAAUmc,MAAQ,SAAgBpW,GAGvC,IADA,IAAIyC,EAAQ,EACH9H,EAAI,EAAGA,EAAIqF,EAAI5F,OAAQO,IAAK,CACnC,IAAI0J,EAA0B,IAAL,EAAfrE,EAAId,MAAMvE,IAAiB8H,EACjCD,EAAU,SAAL6B,EACTA,KAAQ,GAERrE,EAAId,MAAMvE,GAAK6H,EACfC,EAAQ4B,EAKV,OAHc,IAAV5B,IACFzC,EAAId,MAAMc,EAAI5F,UAAYqI,GAErBzC,GAITpB,EAAGgX,OAAS,SAAgBP,GAE1B,GAAIld,EAAOkd,GAAO,OAAOld,EAAOkd,GAEhC,IAAI9c,EACJ,GAAa,SAAT8c,EACF9c,EAAQ,IAAIid,OACP,GAAa,SAATH,EACT9c,EAAQ,IAAIkd,OACP,GAAa,SAATJ,EACT9c,EAAQ,IAAImd,MACP,IAAa,WAATL,EAGT,MAAM,IAAI/W,MAAM,iBAAmB+W,GAFnC9c,EAAQ,IAAIod,EAMd,OAFAxd,EAAOkd,GAAQ9c,EAERA,GAkBTgb,EAAItZ,UAAUwa,SAAW,SAAmBnS,GAC1ChJ,EAAsB,IAAfgJ,EAAErD,SAAgB,iCACzB3F,EAAOgJ,EAAEnD,IAAK,oCAGhBoU,EAAItZ,UAAUqa,SAAW,SAAmBhS,EAAGC,GAC7CjJ,EAAqC,KAA7BgJ,EAAErD,SAAWsD,EAAEtD,UAAiB,iCACxC3F,EAAOgJ,EAAEnD,KAAOmD,EAAEnD,MAAQoD,EAAEpD,IAC1B,oCAGJoU,EAAItZ,UAAU6b,KAAO,SAAexT,GAClC,OAAI7I,KAAKlB,MAAckB,KAAKlB,MAAM0d,QAAQ3T,GAAGqR,UAAUla,MAChD6I,EAAE4O,KAAKzX,KAAKoU,GAAG8F,UAAUla,OAGlC8Z,EAAItZ,UAAUgL,IAAM,SAAc3C,GAChC,OAAIA,EAAEW,SACGX,EAAEd,QAGJ/H,KAAKoU,EAAEzH,IAAI9D,GAAGqR,UAAUla,OAGjC8Z,EAAItZ,UAAUkM,IAAM,SAAc7D,EAAGC,GACnC9I,KAAK6a,SAAShS,EAAGC,GAEjB,IAAIsB,EAAMvB,EAAE6D,IAAI5D,GAIhB,OAHIsB,EAAIzD,IAAI3G,KAAKoU,IAAM,GACrBhK,EAAIqC,KAAKzM,KAAKoU,GAEThK,EAAI8P,UAAUla,OAGvB8Z,EAAItZ,UAAUgM,KAAO,SAAe3D,EAAGC,GACrC9I,KAAK6a,SAAShS,EAAGC,GAEjB,IAAIsB,EAAMvB,EAAE2D,KAAK1D,GAIjB,OAHIsB,EAAIzD,IAAI3G,KAAKoU,IAAM,GACrBhK,EAAIqC,KAAKzM,KAAKoU,GAEThK,GAGT0P,EAAItZ,UAAUmM,IAAM,SAAc9D,EAAGC,GACnC9I,KAAK6a,SAAShS,EAAGC,GAEjB,IAAIsB,EAAMvB,EAAE8D,IAAI7D,GAIhB,OAHIsB,EAAI4O,KAAK,GAAK,GAChB5O,EAAIoC,KAAKxM,KAAKoU,GAEThK,EAAI8P,UAAUla,OAGvB8Z,EAAItZ,UAAUiM,KAAO,SAAe5D,EAAGC,GACrC9I,KAAK6a,SAAShS,EAAGC,GAEjB,IAAIsB,EAAMvB,EAAE4D,KAAK3D,GAIjB,OAHIsB,EAAI4O,KAAK,GAAK,GAChB5O,EAAIoC,KAAKxM,KAAKoU,GAEThK,GAGT0P,EAAItZ,UAAUma,IAAM,SAAc9R,EAAGtC,GAEnC,OADAvG,KAAKgb,SAASnS,GACP7I,KAAKqc,KAAKxT,EAAEuN,MAAM7P,KAG3BuT,EAAItZ,UAAUmQ,KAAO,SAAe9H,EAAGC,GAErC,OADA9I,KAAK6a,SAAShS,EAAGC,GACV9I,KAAKqc,KAAKxT,EAAE8H,KAAK7H,KAG1BgR,EAAItZ,UAAU8F,IAAM,SAAcuC,EAAGC,GAEnC,OADA9I,KAAK6a,SAAShS,EAAGC,GACV9I,KAAKqc,KAAKxT,EAAEvC,IAAIwC,KAGzBgR,EAAItZ,UAAU+U,KAAO,SAAe1M,GAClC,OAAO7I,KAAK2Q,KAAK9H,EAAGA,EAAEd,UAGxB+R,EAAItZ,UAAU8U,IAAM,SAAczM,GAChC,OAAO7I,KAAKsG,IAAIuC,EAAGA,IAGrBiR,EAAItZ,UAAU2a,KAAO,SAAetS,GAClC,GAAIA,EAAEW,SAAU,OAAOX,EAAEd,QAEzB,IAAImV,EAAOld,KAAKoU,EAAE9J,MAAM,GAIxB,GAHAzK,EAAOqd,EAAO,IAAM,GAGP,IAATA,EAAY,CACd,IAAItV,EAAM5H,KAAKoU,EAAE1H,IAAI,IAAIvH,EAAG,IAAIoF,OAAO,GACvC,OAAOvK,KAAK4H,IAAIiB,EAAGjB,GAMrB,IAAIyC,EAAIrK,KAAKoU,EAAEuC,KAAK,GAChBvD,EAAI,EACR,OAAQ/I,EAAEb,UAA2B,IAAfa,EAAEC,MAAM,GAC5B8I,IACA/I,EAAEE,OAAO,GAEX1K,GAAQwK,EAAEb,UAEV,IAAI2T,EAAM,IAAIhY,EAAG,GAAG4U,MAAM/Z,MACtBod,EAAOD,EAAI9B,SAIXgC,EAAOrd,KAAKoU,EAAEuC,KAAK,GAAGpM,OAAO,GAC7B+S,EAAItd,KAAKoU,EAAE5L,YACf8U,EAAI,IAAInY,EAAG,EAAImY,EAAIA,GAAGvD,MAAM/Z,MAE5B,MAAuC,IAAhCA,KAAK4H,IAAI0V,EAAGD,GAAM1W,IAAIyW,GAC3BE,EAAE/C,QAAQ6C,GAGZ,IAAIjX,EAAInG,KAAK4H,IAAI0V,EAAGjT,GAChBpE,EAAIjG,KAAK4H,IAAIiB,EAAGwB,EAAEqM,KAAK,GAAGnM,OAAO,IACjCG,EAAI1K,KAAK4H,IAAIiB,EAAGwB,GAChB+J,EAAIhB,EACR,MAAsB,IAAf1I,EAAE/D,IAAIwW,GAAY,CAEvB,IADA,IAAItB,EAAMnR,EACDxJ,EAAI,EAAoB,IAAjB2a,EAAIlV,IAAIwW,GAAYjc,IAClC2a,EAAMA,EAAId,SAEZlb,EAAOqB,EAAIkT,GACX,IAAItL,EAAI9I,KAAK4H,IAAIzB,EAAG,IAAIhB,EAAG,GAAGqQ,OAAOpB,EAAIlT,EAAI,IAE7C+E,EAAIA,EAAE2U,OAAO9R,GACb3C,EAAI2C,EAAEiS,SACNrQ,EAAIA,EAAEkQ,OAAOzU,GACbiO,EAAIlT,EAGN,OAAO+E,GAGT6T,EAAItZ,UAAUyY,KAAO,SAAepQ,GAClC,IAAI0U,EAAM1U,EAAE+P,OAAO5Y,KAAKoU,GACxB,OAAqB,IAAjBmJ,EAAI/X,UACN+X,EAAI/X,SAAW,EACRxF,KAAKqc,KAAKkB,GAAKlC,UAEfrb,KAAKqc,KAAKkB,IAIrBzD,EAAItZ,UAAUoH,IAAM,SAAciB,EAAGtC,GACnC,GAAIA,EAAIiD,SAAU,OAAO,IAAIrE,EAAG,GAAG4U,MAAM/Z,MACzC,GAAoB,IAAhBuG,EAAIyS,KAAK,GAAU,OAAOnQ,EAAEd,QAEhC,IAAIyV,EAAa,EACbC,EAAM,IAAIpd,MAAM,GAAKmd,GACzBC,EAAI,GAAK,IAAItY,EAAG,GAAG4U,MAAM/Z,MACzByd,EAAI,GAAK5U,EACT,IAAK,IAAI3H,EAAI,EAAGA,EAAIuc,EAAI9c,OAAQO,IAC9Buc,EAAIvc,GAAKlB,KAAKsG,IAAImX,EAAIvc,EAAI,GAAI2H,GAGhC,IAAIuB,EAAMqT,EAAI,GACVC,EAAU,EACVC,EAAa,EACb5X,EAAQQ,EAAIiC,YAAc,GAK9B,IAJc,IAAVzC,IACFA,EAAQ,IAGL7E,EAAIqF,EAAI5F,OAAS,EAAGO,GAAK,EAAGA,IAAK,CAEpC,IADA,IAAIuG,EAAOlB,EAAId,MAAMvE,GACZkG,EAAIrB,EAAQ,EAAGqB,GAAK,EAAGA,IAAK,CACnC,IAAIqB,EAAOhB,GAAQL,EAAK,EACpBgD,IAAQqT,EAAI,KACdrT,EAAMpK,KAAKsV,IAAIlL,IAGL,IAAR3B,GAAyB,IAAZiV,GAKjBA,IAAY,EACZA,GAAWjV,EACXkV,KACIA,IAAeH,GAAqB,IAANtc,GAAiB,IAANkG,KAE7CgD,EAAMpK,KAAKsG,IAAI8D,EAAKqT,EAAIC,IACxBC,EAAa,EACbD,EAAU,IAXRC,EAAa,EAajB5X,EAAQ,GAGV,OAAOqE,GAGT0P,EAAItZ,UAAUyZ,UAAY,SAAoB1T,GAC5C,IAAIN,EAAIM,EAAIkR,KAAKzX,KAAKoU,GAEtB,OAAOnO,IAAMM,EAAMN,EAAE8B,QAAU9B,GAGjC6T,EAAItZ,UAAU4Z,YAAc,SAAsB7T,GAChD,IAAI6D,EAAM7D,EAAIwB,QAEd,OADAqC,EAAI1E,IAAM,KACH0E,GAOTjF,EAAGyY,KAAO,SAAerX,GACvB,OAAO,IAAI6V,EAAK7V,IAmBlBnE,EAASga,EAAMtC,GAEfsC,EAAK5b,UAAUyZ,UAAY,SAAoB1T,GAC7C,OAAOvG,KAAKqc,KAAK9V,EAAI6P,MAAMpW,KAAK8W,SAGlCsF,EAAK5b,UAAU4Z,YAAc,SAAsB7T,GACjD,IAAIN,EAAIjG,KAAKqc,KAAK9V,EAAID,IAAItG,KAAKsc,OAE/B,OADArW,EAAEP,IAAM,KACDO,GAGTmW,EAAK5b,UAAUmQ,KAAO,SAAe9H,EAAGC,GACtC,GAAID,EAAEW,UAAYV,EAAEU,SAGlB,OAFAX,EAAEpD,MAAM,GAAK,EACboD,EAAElI,OAAS,EACJkI,EAGT,IAAI6B,EAAI7B,EAAE8H,KAAK7H,GACX3C,EAAIuE,EAAE8L,MAAMxW,KAAK8W,OAAOxQ,IAAItG,KAAKuc,MAAMhG,OAAOvW,KAAK8W,OAAOxQ,IAAItG,KAAKoU,GACnEyJ,EAAInT,EAAE+B,KAAKtG,GAAGoE,OAAOvK,KAAK8W,OAC1B1M,EAAMyT,EAQV,OANIA,EAAElX,IAAI3G,KAAKoU,IAAM,EACnBhK,EAAMyT,EAAEpR,KAAKzM,KAAKoU,GACTyJ,EAAE7E,KAAK,GAAK,IACrB5O,EAAMyT,EAAErR,KAAKxM,KAAKoU,IAGbhK,EAAI8P,UAAUla,OAGvBoc,EAAK5b,UAAU8F,IAAM,SAAcuC,EAAGC,GACpC,GAAID,EAAEW,UAAYV,EAAEU,SAAU,OAAO,IAAIrE,EAAG,GAAG+U,UAAUla,MAEzD,IAAI0K,EAAI7B,EAAEvC,IAAIwC,GACV3C,EAAIuE,EAAE8L,MAAMxW,KAAK8W,OAAOxQ,IAAItG,KAAKuc,MAAMhG,OAAOvW,KAAK8W,OAAOxQ,IAAItG,KAAKoU,GACnEyJ,EAAInT,EAAE+B,KAAKtG,GAAGoE,OAAOvK,KAAK8W,OAC1B1M,EAAMyT,EAOV,OANIA,EAAElX,IAAI3G,KAAKoU,IAAM,EACnBhK,EAAMyT,EAAEpR,KAAKzM,KAAKoU,GACTyJ,EAAE7E,KAAK,GAAK,IACrB5O,EAAMyT,EAAErR,KAAKxM,KAAKoU,IAGbhK,EAAI8P,UAAUla,OAGvBoc,EAAK5b,UAAUyY,KAAO,SAAepQ,GAEnC,IAAIuB,EAAMpK,KAAKqc,KAAKxT,EAAE+P,OAAO5Y,KAAKoU,GAAG9N,IAAItG,KAAK6X,KAC9C,OAAOzN,EAAI8P,UAAUla,QAt2GzB,CAw2GoCO,EAAQP,Q,6DCt2G5C,IAAIH,EAAS,EAAQ,QACjBuC,EAAW,EAAQ,QAEnBqB,EAAQ,EAAQ,QAChB3D,EAAS,EAAQ,QAErB,SAASge,IACP9d,KAAK6b,IAAM,IAAIxb,MAAM,GACrBL,KAAK6C,KAAO,KAGd,SAASa,EAAI3D,GACXD,EAAO6C,KAAK3C,KAAMD,GAElB,IAAIkD,EAAQ,IAAI6a,EAChB9d,KAAK+d,UAAY9a,EAEjBjD,KAAKge,WAAW/a,EAAOlD,EAAQgD,KAEjCX,EAASsB,EAAK5D,GACdS,EAAOd,QAAUiE,EAEjBA,EAAIV,OAAS,SAAgBjD,GAC3B,OAAO,IAAI2D,EAAI3D,IAGjB,IAAIke,EAAa,CACf,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EACrB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAGvBva,EAAIlD,UAAUwd,WAAa,SAAoB/a,EAAOF,GACpDE,EAAMJ,KAAO,IAAIxC,MAAM,IAEvBR,EAAOsC,MAAMY,EAAIpC,OAAQX,KAAKE,UAAW,sBAEzC,IAAIge,EAAKza,EAAM0a,aAAapb,EAAK,GAC7Bqb,EAAK3a,EAAM0a,aAAapb,EAAK,GAEjCU,EAAM4a,IAAIH,EAAIE,EAAInb,EAAM4Y,IAAK,GAC7BqC,EAAKjb,EAAM4Y,IAAI,GACfuC,EAAKnb,EAAM4Y,IAAI,GACf,IAAK,IAAI3a,EAAI,EAAGA,EAAI+B,EAAMJ,KAAKlC,OAAQO,GAAK,EAAG,CAC7C,IAAI4V,EAAQmH,EAAW/c,IAAM,GAC7Bgd,EAAKza,EAAM6a,OAAOJ,EAAIpH,GACtBsH,EAAK3a,EAAM6a,OAAOF,EAAItH,GACtBrT,EAAM8a,IAAIL,EAAIE,EAAInb,EAAMJ,KAAM3B,KAIlCwC,EAAIlD,UAAUa,QAAU,SAAiB8B,EAAKC,EAAOhC,EAAKiC,GACxD,IAAIJ,EAAQjD,KAAK+d,UAEbrL,EAAIjP,EAAM0a,aAAahb,EAAKC,GAC5B6C,EAAIxC,EAAM0a,aAAahb,EAAKC,EAAQ,GAGxCK,EAAM+a,GAAG9L,EAAGzM,EAAGhD,EAAM4Y,IAAK,GAC1BnJ,EAAIzP,EAAM4Y,IAAI,GACd5V,EAAIhD,EAAM4Y,IAAI,GAEI,YAAd7b,KAAKC,KACPD,KAAKye,SAASxb,EAAOyP,EAAGzM,EAAGhD,EAAM4Y,IAAK,GAEtC7b,KAAK0e,SAASzb,EAAOyP,EAAGzM,EAAGhD,EAAM4Y,IAAK,GAExCnJ,EAAIzP,EAAM4Y,IAAI,GACd5V,EAAIhD,EAAM4Y,IAAI,GAEdpY,EAAMkb,cAAcvd,EAAKsR,EAAGrP,GAC5BI,EAAMkb,cAAcvd,EAAK6E,EAAG5C,EAAS,IAGvCK,EAAIlD,UAAUyB,KAAO,SAAc7B,EAAQW,GAEzC,IADA,IAAI6d,EAAQxe,EAAOO,OAASI,EACnBG,EAAIH,EAAKG,EAAId,EAAOO,OAAQO,IACnCd,EAAOc,GAAK0d,EAEd,OAAO,GAGTlb,EAAIlD,UAAU0B,OAAS,SAAgB9B,GAErC,IADA,IAAIye,EAAMze,EAAOA,EAAOO,OAAS,GACxBO,EAAId,EAAOO,OAASke,EAAK3d,EAAId,EAAOO,OAAQO,IACnDrB,EAAOsC,MAAM/B,EAAOc,GAAI2d,GAE1B,OAAOze,EAAO0D,MAAM,EAAG1D,EAAOO,OAASke,IAGzCnb,EAAIlD,UAAUie,SAAW,SAAkBxb,EAAO6b,EAAQC,EAAQ3d,EAAKL,GAKrE,IAJA,IAAI2R,EAAIoM,EACJ7Y,EAAI8Y,EAGC7d,EAAI,EAAGA,EAAI+B,EAAMJ,KAAKlC,OAAQO,GAAK,EAAG,CAC7C,IAAI8d,EAAO/b,EAAMJ,KAAK3B,GAClB+d,EAAOhc,EAAMJ,KAAK3B,EAAI,GAG1BuC,EAAMyb,OAAOjZ,EAAGhD,EAAM4Y,IAAK,GAE3BmD,GAAQ/b,EAAM4Y,IAAI,GAClBoD,GAAQhc,EAAM4Y,IAAI,GAClB,IAAIzI,EAAI3P,EAAM0b,WAAWH,EAAMC,GAC3BG,EAAI3b,EAAMoP,QAAQO,GAElB1I,EAAIzE,EACRA,GAAKyM,EAAI0M,KAAO,EAChB1M,EAAIhI,EAINjH,EAAM4b,IAAIpZ,EAAGyM,EAAGtR,EAAKL,IAGvB2C,EAAIlD,UAAUke,SAAW,SAAkBzb,EAAO6b,EAAQC,EAAQ3d,EAAKL,GAKrE,IAJA,IAAI2R,EAAIqM,EACJ9Y,EAAI6Y,EAGC5d,EAAI+B,EAAMJ,KAAKlC,OAAS,EAAGO,GAAK,EAAGA,GAAK,EAAG,CAClD,IAAI8d,EAAO/b,EAAMJ,KAAK3B,GAClB+d,EAAOhc,EAAMJ,KAAK3B,EAAI,GAG1BuC,EAAMyb,OAAOxM,EAAGzP,EAAM4Y,IAAK,GAE3BmD,GAAQ/b,EAAM4Y,IAAI,GAClBoD,GAAQhc,EAAM4Y,IAAI,GAClB,IAAIzI,EAAI3P,EAAM0b,WAAWH,EAAMC,GAC3BG,EAAI3b,EAAMoP,QAAQO,GAElB1I,EAAIgI,EACRA,GAAKzM,EAAImZ,KAAO,EAChBnZ,EAAIyE,EAINjH,EAAM4b,IAAI3M,EAAGzM,EAAG7E,EAAKL,K,wBC5IvB,kBAAS,EAAQ,QACbue,EAAc,EAAQ,QACtBC,EAAc,IAAID,EAClBE,EAAa,IAAIra,EAAG,IACpBsa,EAAS,IAAIta,EAAG,IAChBua,EAAM,IAAIva,EAAG,IACbwa,EAAQ,IAAIxa,EAAG,GACfya,EAAQ,IAAIza,EAAG,GACfzG,EAAS,EAAQ,QACjBmhB,EAAc,EAAQ,QAG1B,SAASC,EAAaC,EAAK5gB,GAMzB,OALAA,EAAMA,GAAO,OACRJ,EAAOO,SAASygB,KACnBA,EAAM,IAAIhhB,EAAOghB,EAAK5gB,IAExBa,KAAKggB,KAAO,IAAI7a,EAAG4a,GACZ/f,KAGT,SAASigB,EAAcC,EAAM/gB,GAM3B,OALAA,EAAMA,GAAO,OACRJ,EAAOO,SAAS4gB,KACnBA,EAAO,IAAInhB,EAAOmhB,EAAM/gB,IAE1Ba,KAAKmgB,MAAQ,IAAIhb,EAAG+a,GACblgB,KAjBTO,EAAOd,QAAUd,EAoBjB,IAAIyhB,EAAa,GACjB,SAASC,EAAWvhB,EAAOM,GACzB,IAAIJ,EAAMI,EAAU0H,SAAS,OACzBwZ,EAAM,CAACthB,EAAKF,EAAMgI,SAAS,KAAKyZ,KAAK,KACzC,GAAID,KAAOF,EACT,OAAOA,EAAWE,GAEpB,IAyBIE,EAzBAC,EAAQ,EAEZ,GAAI3hB,EAAMuZ,WACP3Z,EAAOgiB,cACPhiB,EAAOiiB,WAAW7hB,KAClBygB,EAAYqB,KAAK9hB,GAclB,OAZA2hB,GAAS,EAKPA,GAHU,OAARzhB,GAAwB,OAARA,EAGT,EAIA,EAEXohB,EAAWE,GAAOG,EACXA,EAOT,OALKlB,EAAYqB,KAAK9hB,EAAMuX,KAAK,MAE/BoK,GAAS,GAGHzhB,GACN,IAAK,KACCF,EAAMD,IAAI2gB,GAAY7Y,IAAI8Y,KAE5BgB,GAAS,GAEX,MACF,IAAK,KACHD,EAAM1hB,EAAMD,IAAI6gB,GACZc,EAAI7Z,IAAIgZ,IAAUa,EAAI7Z,IAAIiZ,KAE5Ba,GAAS,GAEX,MACF,QACEA,GAAS,EAGb,OADAL,EAAWE,GAAOG,EACXA,EAGT,SAAS9hB,EAAGG,EAAOM,EAAWyhB,GAC5B7gB,KAAK8gB,aAAa1hB,GAClBY,KAAK+gB,QAAU,IAAI5b,EAAGrG,GACtBkB,KAAKmc,OAAShX,EAAGyY,KAAK5d,KAAK+gB,SAC3B/gB,KAAKghB,UAAYliB,EAAM6B,OACvBX,KAAKggB,UAAOzgB,EACZS,KAAKmgB,WAAQ5gB,EACbS,KAAKihB,gBAAa1hB,EACdshB,GACF7gB,KAAK8f,aAAeA,EACpB9f,KAAKigB,cAAgBA,GAErBjgB,KAAKihB,WAAa,EA4DtB,SAASC,EAAkBC,EAAIhiB,GAC7B,IAAIiiB,EAAM,IAAIriB,EAAOoiB,EAAGha,WACxB,OAAKhI,EAGIiiB,EAAIta,SAAS3H,GAFbiiB,EA5DXte,OAAOue,eAAe1iB,EAAG6B,UAAW,cAAe,CACjD8gB,YAAY,EACZC,IAAK,WAIH,MAH+B,kBAApBvhB,KAAKihB,aACdjhB,KAAKihB,WAAaZ,EAAWrgB,KAAK+gB,QAAS/gB,KAAKwhB,QAE3CxhB,KAAKihB,cAGhBtiB,EAAG6B,UAAUihB,aAAe,WAK1B,OAJKzhB,KAAKmgB,QACRngB,KAAKmgB,MAAQ,IAAIhb,EAAG0a,EAAY7f,KAAKghB,aAEvChhB,KAAKggB,KAAOhgB,KAAK0hB,KAAK3H,MAAM/Z,KAAKmc,QAAQb,OAAOtb,KAAKmgB,OAAOhG,UACrDna,KAAK2hB,gBAGdhjB,EAAG6B,UAAUohB,cAAgB,SAAUC,GACrCA,EAAQ,IAAI1c,EAAG0c,GACfA,EAAQA,EAAM9H,MAAM/Z,KAAKmc,QACzB,IAAI2F,EAASD,EAAMvG,OAAOtb,KAAKmgB,OAAOhG,UAClC/Y,EAAM,IAAIrC,EAAO+iB,EAAO3a,WACxBrI,EAAQkB,KAAK+hB,WACjB,GAAI3gB,EAAIT,OAAS7B,EAAM6B,OAAQ,CAC7B,IAAIqhB,EAAQ,IAAIjjB,EAAOD,EAAM6B,OAASS,EAAIT,QAC1CqhB,EAAMC,KAAK,GACX7gB,EAAMrC,EAAOiD,OAAO,CAACggB,EAAO5gB,IAE9B,OAAOA,GAGTzC,EAAG6B,UAAUmhB,aAAe,SAAsBxiB,GAChD,OAAO+hB,EAAkBlhB,KAAKggB,KAAM7gB,IAGtCR,EAAG6B,UAAU0hB,cAAgB,SAAuB/iB,GAClD,OAAO+hB,EAAkBlhB,KAAKmgB,MAAOhhB,IAGvCR,EAAG6B,UAAUuhB,SAAW,SAAU5iB,GAChC,OAAO+hB,EAAkBlhB,KAAK+gB,QAAS5hB,IAGzCR,EAAG6B,UAAU2hB,aAAe,SAAUhjB,GACpC,OAAO+hB,EAAkBlhB,KAAK0hB,KAAMviB,IAGtCR,EAAG6B,UAAUsgB,aAAe,SAAU9hB,EAAKG,GAOzC,OANAA,EAAMA,GAAO,OACRJ,EAAOO,SAASN,KACnBA,EAAM,IAAID,EAAOC,EAAKG,IAExBa,KAAKwhB,MAAQxiB,EACbgB,KAAK0hB,KAAO,IAAIvc,EAAGnG,GACZgB,Q,oDCzJT,IAAI6f,EAAc,EAAQ,QAC1Btf,EAAOd,QAAU2iB,EACjBA,EAAU1B,YAAcA,EACxB0B,EAAUzB,WAAaA,EACvB,IAAIxb,EAAK,EAAQ,QACbqa,EAAa,IAAIra,EAAG,IACpBma,EAAc,EAAQ,QACtBC,EAAc,IAAID,EAClB+C,EAAM,IAAIld,EAAG,GACbmd,EAAM,IAAInd,EAAG,GACbod,EAAO,IAAIpd,EAAG,GAGdua,GAFU,IAAIva,EAAG,IACT,IAAIA,EAAG,GACT,IAAIA,EAAG,KACbwa,EAAQ,IAAIxa,EAAG,GAEfsa,GADQ,IAAIta,EAAG,GACN,IAAIA,EAAG,KAChBqd,EAAO,IAAIrd,EAAG,GAEdzG,GADS,IAAIyG,EAAG,IACP,MAEb,SAASsd,IACP,GAAe,OAAX/jB,EACF,OAAOA,EAET,IAAIgkB,EAAQ,QACRtY,EAAM,GACVA,EAAI,GAAK,EACT,IAAK,IAAIlJ,EAAI,EAAG+H,EAAI,EAAGA,EAAIyZ,EAAOzZ,GAAK,EAAG,CAExC,IADA,IAAIkS,EAAOla,KAAKS,KAAKT,KAAKka,KAAKlS,IACtB7B,EAAI,EAAGA,EAAIlG,GAAKkJ,EAAIhD,IAAM+T,EAAM/T,IACvC,GAAI6B,EAAImB,EAAIhD,KAAO,EACjB,MAEAlG,IAAMkG,GAAKgD,EAAIhD,IAAM+T,IAGzB/Q,EAAIlJ,KAAO+H,GAGb,OADAvK,EAAS0L,EACFA,EAGT,SAASsW,EAAYhN,GAGnB,IAFA,IAAIhV,EAAS+jB,IAEJvhB,EAAI,EAAGA,EAAIxC,EAAOiC,OAAQO,IACjC,GAA0B,IAAtBwS,EAAEjK,KAAK/K,EAAOwC,IAChB,OAA0B,IAAtBwS,EAAEsF,KAAKta,EAAOwC,IAOtB,OAAO,EAGT,SAASyf,EAAWjN,GAClB,IAAIhO,EAAMP,EAAGyY,KAAKlK,GAClB,OAA8D,IAAvD4O,EAAIvI,MAAMrU,GAAK4V,OAAO5H,EAAEiD,KAAK,IAAIwD,UAAUnB,KAAK,GAGzD,SAASoJ,EAAU3M,EAAMzW,GACvB,GAAIyW,EAAO,GAET,OACS,IAAItQ,EADD,IAARnG,GAAqB,IAARA,EACD,CAAC,IAAM,KAEP,CAAC,IAAM,KAKzB,IAAIuH,EAAKoc,EAFT3jB,EAAM,IAAImG,EAAGnG,GAIb,MAAO,EAAM,CACXuH,EAAM,IAAIpB,EAAG0a,EAAY5e,KAAKS,KAAK+T,EAAO,KAC1C,MAAOlP,EAAIiC,YAAciN,EACvBlP,EAAI2P,MAAM,GAQZ,GANI3P,EAAI8R,UACN9R,EAAIiG,KAAK6V,GAEN9b,EAAI6E,MAAM,IACb7E,EAAIiG,KAAK8V,GAENtjB,EAAI2H,IAAI2b,IAIN,IAAKtjB,EAAI2H,IAAI4b,GAClB,MAAOhc,EAAI1H,IAAI6gB,GAAK/Y,IAAIgZ,GACtBpZ,EAAIiG,KAAKgW,QALX,MAAOjc,EAAI1H,IAAI2gB,GAAY7Y,IAAI8Y,GAC7BlZ,EAAIiG,KAAKgW,GAQb,GADAG,EAAKpc,EAAI8P,KAAK,GACVqK,EAAYiC,IAAOjC,EAAYna,IACjCoa,EAAWgC,IAAOhC,EAAWpa,IAC7BgZ,EAAYqB,KAAK+B,IAAOpD,EAAYqB,KAAKra,GACzC,OAAOA,K,oCClGb9G,EAAQ0e,aAAe,SAAsByE,EAAO7hB,GAClD,IAAIqJ,EAAQwY,EAAM,EAAI7hB,IAAQ,GAClB6hB,EAAM,EAAI7hB,IAAQ,GAClB6hB,EAAM,EAAI7hB,IAAQ,EACnB6hB,EAAM,EAAI7hB,GACrB,OAAOqJ,IAAQ,GAGjB3K,EAAQkf,cAAgB,SAAuBiE,EAAOhE,EAAO7d,GAC3D6hB,EAAM,EAAI7hB,GAAO6d,IAAU,GAC3BgE,EAAM,EAAI7hB,GAAQ6d,IAAU,GAAM,IAClCgE,EAAM,EAAI7hB,GAAQ6d,IAAU,EAAK,IACjCgE,EAAM,EAAI7hB,GAAe,IAAR6d,GAGnBnf,EAAQ+e,GAAK,SAAYqE,EAAKC,EAAK1hB,EAAKL,GAItC,IAHA,IAAIgiB,EAAO,EACPC,EAAO,EAEF9hB,EAAI,EAAGA,GAAK,EAAGA,GAAK,EAAG,CAC9B,IAAK,IAAIkG,EAAI,EAAGA,GAAK,GAAIA,GAAK,EAC5B2b,IAAS,EACTA,GAASD,IAAS1b,EAAIlG,EAAM,EAE9B,IAASkG,EAAI,EAAGA,GAAK,GAAIA,GAAK,EAC5B2b,IAAS,EACTA,GAASF,IAASzb,EAAIlG,EAAM,EAIhC,IAASA,EAAI,EAAGA,GAAK,EAAGA,GAAK,EAAG,CAC9B,IAASkG,EAAI,EAAGA,GAAK,GAAIA,GAAK,EAC5B4b,IAAS,EACTA,GAASF,IAAS1b,EAAIlG,EAAM,EAE9B,IAASkG,EAAI,EAAGA,GAAK,GAAIA,GAAK,EAC5B4b,IAAS,EACTA,GAASH,IAASzb,EAAIlG,EAAM,EAIhCE,EAAIL,EAAM,GAAKgiB,IAAS,EACxB3hB,EAAIL,EAAM,GAAKiiB,IAAS,GAG1BvjB,EAAQ4f,IAAM,SAAawD,EAAKC,EAAK1hB,EAAKL,GAIxC,IAHA,IAAIgiB,EAAO,EACPC,EAAO,EAEF9hB,EAAI,EAAGA,EAAI,EAAGA,IACrB,IAAK,IAAIkG,EAAI,GAAIA,GAAK,EAAGA,GAAK,EAC5B2b,IAAS,EACTA,GAASD,IAAS1b,EAAIlG,EAAM,EAC5B6hB,IAAS,EACTA,GAASF,IAASzb,EAAIlG,EAAM,EAGhC,IAASA,EAAI,EAAGA,EAAI,EAAGA,IACrB,IAASkG,EAAI,GAAIA,GAAK,EAAGA,GAAK,EAC5B4b,IAAS,EACTA,GAASF,IAAS1b,EAAIlG,EAAM,EAC5B8hB,IAAS,EACTA,GAASH,IAASzb,EAAIlG,EAAM,EAIhCE,EAAIL,EAAM,GAAKgiB,IAAS,EACxB3hB,EAAIL,EAAM,GAAKiiB,IAAS,GAG1BvjB,EAAQ4e,IAAM,SAAawE,EAAKC,EAAK1hB,EAAKL,GAQxC,IAPA,IAAIgiB,EAAO,EACPC,EAAO,EAMF9hB,EAAI,EAAGA,GAAK,EAAGA,IAAK,CAC3B,IAAK,IAAIkG,EAAI,EAAGA,GAAK,GAAIA,GAAK,EAC5B2b,IAAS,EACTA,GAASD,GAAQ1b,EAAIlG,EAAM,EAE7B,IAASkG,EAAI,EAAGA,GAAK,GAAIA,GAAK,EAC5B2b,IAAS,EACTA,GAASF,GAAQzb,EAAIlG,EAAM,EAG/B,IAASkG,EAAI,EAAGA,GAAK,GAAIA,GAAK,EAC5B2b,IAAS,EACTA,GAASD,GAAQ1b,EAAIlG,EAAM,EAO7B,IAASA,EAAI,EAAGA,GAAK,EAAGA,IAAK,CAC3B,IAASkG,EAAI,EAAGA,GAAK,GAAIA,GAAK,EAC5B4b,IAAS,EACTA,GAASF,GAAQ1b,EAAIlG,EAAM,EAE7B,IAASkG,EAAI,EAAGA,GAAK,GAAIA,GAAK,EAC5B4b,IAAS,EACTA,GAASH,GAAQzb,EAAIlG,EAAM,EAG/B,IAASkG,EAAI,EAAGA,GAAK,GAAIA,GAAK,EAC5B4b,IAAS,EACTA,GAASH,GAAQzb,EAAIlG,EAAM,EAG7BE,EAAIL,EAAM,GAAKgiB,IAAS,EACxB3hB,EAAIL,EAAM,GAAKiiB,IAAS,GAG1BvjB,EAAQ6e,OAAS,SAAgB/X,EAAKuQ,GACpC,OAASvQ,GAAOuQ,EAAS,UAAcvQ,IAAS,GAAKuQ,GAGvD,IAAImM,EAAW,CAEb,GAAI,GAAI,GAAI,EAAG,GAAI,GAAI,GAAI,EAC3B,GAAI,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,GACzB,EAAG,GAAI,GAAI,GAAI,EAAG,EAAG,GAAI,GAGzB,GAAI,EAAG,GAAI,GAAI,EAAG,EAAG,GAAI,GACzB,EAAG,GAAI,GAAI,EAAG,GAAI,EAAG,GAAI,EACzB,GAAI,EAAG,GAAI,GAAI,EAAG,GAAI,GAAI,IAG5BxjB,EAAQ8e,IAAM,SAAasE,EAAKC,EAAK1hB,EAAKL,GAKxC,IAJA,IAAIgiB,EAAO,EACPC,EAAO,EAEP9c,EAAM+c,EAAStiB,SAAW,EACrBO,EAAI,EAAGA,EAAIgF,EAAKhF,IACvB6hB,IAAS,EACTA,GAASF,IAAQI,EAAS/hB,GAAM,EAElC,IAASA,EAAIgF,EAAKhF,EAAI+hB,EAAStiB,OAAQO,IACrC8hB,IAAS,EACTA,GAASF,IAAQG,EAAS/hB,GAAM,EAGlCE,EAAIL,EAAM,GAAKgiB,IAAS,EACxB3hB,EAAIL,EAAM,GAAKiiB,IAAS,GAG1BvjB,EAAQyf,OAAS,SAAgBjZ,EAAG7E,EAAKL,GACvC,IAAIgiB,EAAO,EACPC,EAAO,EAEXD,GAAa,EAAJ9c,IAAU,EAAMA,IAAM,GAC/B,IAAK,IAAI/E,EAAI,GAAIA,GAAK,GAAIA,GAAK,EAC7B6hB,IAAS,EACTA,GAAS9c,IAAM/E,EAAK,GAEtB,IAASA,EAAI,GAAIA,GAAK,EAAGA,GAAK,EAC5B8hB,GAAS/c,IAAM/E,EAAK,GACpB8hB,IAAS,EAEXA,IAAc,GAAJ/c,IAAa,EAAMA,IAAM,GAEnC7E,EAAIL,EAAM,GAAKgiB,IAAS,EACxB3hB,EAAIL,EAAM,GAAKiiB,IAAS,GAG1B,IAAIE,EAAS,CACX,GAAI,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,EAAG,GAAI,GAAI,EAAG,EACpD,EAAG,GAAI,GAAI,EAAG,EAAG,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAClD,EAAG,GAAI,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,EAClD,GAAI,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAEnD,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAClD,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,EACnD,EAAG,GAAI,GAAI,EAAG,EAAG,GAAI,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,EACpD,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,EAElD,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,GACjD,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,GAAI,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,EACpD,GAAI,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,EACjD,GAAI,EAAG,EAAG,GAAI,EAAG,GAAI,GAAI,EAAG,EAAG,GAAI,GAAI,EAAG,GAAI,EAAG,EAAG,GAEpD,EAAG,GAAI,GAAI,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,EACnD,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,EAAG,GAAI,GAAI,EAAG,GAAI,GAAI,EACnD,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,EAAG,EAAG,GAAI,GAAI,EACpD,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,GAEjD,EAAG,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,GAAI,GAAI,EAAG,EACpD,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,EAClD,EAAG,GAAI,EAAG,EAAG,EAAG,GAAI,GAAI,EAAG,GAAI,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,GACnD,GAAI,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,EAElD,GAAI,GAAI,EAAG,GAAI,GAAI,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,EAAG,EACnD,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,GAAI,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,EACnD,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,EAAG,GAClD,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,GAElD,EAAG,GAAI,GAAI,EAAG,EAAG,GAAI,GAAI,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GACnD,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,EAClD,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,EACpD,GAAI,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,GAEjD,GAAI,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,EAAG,GAAI,GAAI,EAAG,GAAI,EAAG,EAAG,EACnD,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,EACnD,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,EAAG,EAAG,GAClD,EAAG,GAAI,EAAG,GAAI,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAGpDzjB,EAAQ0f,WAAa,SAAoB0D,EAAKC,GAE5C,IADA,IAAI1hB,EAAM,EACDF,EAAI,EAAGA,EAAI,EAAGA,IAAK,CAC1B,IAAI4H,EAAK+Z,IAAS,GAAS,EAAJ3hB,EAAU,GAC7BiiB,EAAKD,EAAW,GAAJhiB,EAAW4H,GAE3B1H,IAAQ,EACRA,GAAO+hB,EAET,IAASjiB,EAAI,EAAGA,EAAI,EAAGA,IAAK,CACtB4H,EAAKga,IAAS,GAAS,EAAJ5hB,EAAU,GAC7BiiB,EAAKD,EAAO,IAAe,GAAJhiB,EAAW4H,GAEtC1H,IAAQ,EACRA,GAAO+hB,EAET,OAAO/hB,IAAQ,GAGjB,IAAIgiB,EAAe,CACjB,GAAI,GAAI,GAAI,GAAI,EAAG,GAAI,EAAG,GAAI,GAAI,GAAI,EAAG,EAAG,GAAI,GAAI,EAAG,GACvD,GAAI,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,GAAI,GAAI,GAAI,GAAI,GAG1D3jB,EAAQoT,QAAU,SAAiBtM,GAEjC,IADA,IAAInF,EAAM,EACDF,EAAI,EAAGA,EAAIkiB,EAAaziB,OAAQO,IACvCE,IAAQ,EACRA,GAAQmF,IAAQ6c,EAAaliB,GAAM,EAErC,OAAOE,IAAQ,GAGjB3B,EAAQ4jB,SAAW,SAAkB9c,EAAK0B,EAAMqb,GAC9C,IAAIxd,EAAMS,EAAIO,SAAS,GACvB,MAAOhB,EAAInF,OAASsH,EAClBnC,EAAM,IAAMA,EAGd,IADA,IAAI1E,EAAM,GACDF,EAAI,EAAGA,EAAI+G,EAAM/G,GAAKoiB,EAC7BliB,EAAImiB,KAAKzd,EAAIhC,MAAM5C,EAAGA,EAAIoiB,IAC5B,OAAOliB,EAAImf,KAAK,O,oCC5PlB,IAAIxhB,EAAS,EAAQ,QAAeA,OAEhC2F,EAAsB,EAAQ,QAE9B8e,EAAY,IACfC,EAAkB,EAClBC,EAAgB,GAChBC,EAAU,GACVC,EAAU,EACVC,EAAmBF,EAAUD,EAAkBD,GAAmB,EAClEK,EAAkBF,EAAWH,GAAmB,EAEjD,SAASM,EAAUC,GAClB,OAAOA,EACLjd,QAAQ,KAAM,IACdA,QAAQ,MAAO,KACfA,QAAQ,MAAO,KAGlB,SAASkd,EAAkBC,GAC1B,GAAInlB,EAAOO,SAAS4kB,GACnB,OAAOA,EACD,GAAI,kBAAoBA,EAC9B,OAAOnlB,EAAOolB,KAAKD,EAAW,UAG/B,MAAM,IAAIE,UAAU,uDAGrB,SAASC,EAAUH,EAAWvf,GAC7Buf,EAAYD,EAAkBC,GAC9B,IAAItf,EAAaF,EAAoBC,GAIjC2f,EAAwB1f,EAAa,EAErC2f,EAAcL,EAAUvjB,OAExB6jB,EAAS,EACb,GAAIN,EAAUM,OAAcX,EAC3B,MAAM,IAAIhf,MAAM,iCAGjB,IAAI4f,EAAYP,EAAUM,KAK1B,GAJIC,KAA2B,EAAZjB,KAClBiB,EAAYP,EAAUM,MAGnBD,EAAcC,EAASC,EAC1B,MAAM,IAAI5f,MAAM,8BAAgC4f,EAAY,aAAeF,EAAcC,GAAU,eAGpG,GAAIN,EAAUM,OAAcV,EAC3B,MAAM,IAAIjf,MAAM,yCAGjB,IAAI6f,EAAUR,EAAUM,KAExB,GAAID,EAAcC,EAAS,EAAIE,EAC9B,MAAM,IAAI7f,MAAM,4BAA8B6f,EAAU,aAAeH,EAAcC,EAAS,GAAK,eAGpG,GAAIF,EAAwBI,EAC3B,MAAM,IAAI7f,MAAM,4BAA8B6f,EAAU,cAAgBJ,EAAwB,mBAGjG,IAAIK,EAAUH,EAGd,GAFAA,GAAUE,EAENR,EAAUM,OAAcV,EAC3B,MAAM,IAAIjf,MAAM,yCAGjB,IAAI+f,EAAUV,EAAUM,KAExB,GAAID,EAAcC,IAAWI,EAC5B,MAAM,IAAI/f,MAAM,4BAA8B+f,EAAU,iBAAmBL,EAAcC,GAAU,KAGpG,GAAIF,EAAwBM,EAC3B,MAAM,IAAI/f,MAAM,4BAA8B+f,EAAU,cAAgBN,EAAwB,mBAGjG,IAAIO,EAAUL,EAGd,GAFAA,GAAUI,EAENJ,IAAWD,EACd,MAAM,IAAI1f,MAAM,4CAA8C0f,EAAcC,GAAU,kBAGvF,IAAIM,EAAWlgB,EAAa8f,EAC3BK,EAAWngB,EAAaggB,EAErBI,EAAMjmB,EAAOkmB,YAAYH,EAAWJ,EAAUK,EAAWH,GAE7D,IAAKJ,EAAS,EAAGA,EAASM,IAAYN,EACrCQ,EAAIR,GAAU,EAEfN,EAAUrc,KAAKmd,EAAKR,EAAQG,EAAU1jB,KAAKQ,KAAKqjB,EAAU,GAAIH,EAAUD,GAExEF,EAAS5f,EAET,IAAK,IAAIkI,EAAI0X,EAAQA,EAAS1X,EAAIiY,IAAYP,EAC7CQ,EAAIR,GAAU,EAOf,OALAN,EAAUrc,KAAKmd,EAAKR,EAAQK,EAAU5jB,KAAKQ,KAAKsjB,EAAU,GAAIF,EAAUD,GAExEI,EAAMA,EAAIle,SAAS,UACnBke,EAAMjB,EAAUiB,GAETA,EAGR,SAASE,EAAa9D,EAAKrb,EAAOof,GACjC,IAAI9b,EAAU,EACd,MAAOtD,EAAQsD,EAAU8b,GAAiC,IAAzB/D,EAAIrb,EAAQsD,KAC1CA,EAGH,IAAI+b,EAAYhE,EAAIrb,EAAQsD,IAAYma,EAKxC,OAJI4B,KACD/b,EAGIA,EAGR,SAASgc,EAAUnB,EAAWvf,GAC7Buf,EAAYD,EAAkBC,GAC9B,IAAItf,EAAaF,EAAoBC,GAEjC2gB,EAAiBpB,EAAUvjB,OAC/B,GAAI2kB,IAAgC,EAAb1gB,EACtB,MAAM,IAAIwf,UAAU,IAAMzf,EAAM,yBAAwC,EAAbC,EAAiB,iBAAmB0gB,EAAiB,KAGjH,IAAIR,EAAWI,EAAahB,EAAW,EAAGtf,GACtCmgB,EAAWG,EAAahB,EAAWtf,EAAYsf,EAAUvjB,QACzD+jB,EAAU9f,EAAakgB,EACvBF,EAAUhgB,EAAamgB,EAEvBQ,EAAU,EAAQb,EAAU,EAAI,EAAIE,EAEpCY,EAAcD,EAAU/B,EAExBwB,EAAMjmB,EAAOkmB,aAAaO,EAAc,EAAI,GAAKD,GAEjDf,EAAS,EA8Bb,OA7BAQ,EAAIR,KAAYX,EACZ2B,EAGHR,EAAIR,KAAYe,GAIhBP,EAAIR,KAAwB,EAAZhB,EAEhBwB,EAAIR,KAAsB,IAAVe,GAEjBP,EAAIR,KAAYV,EAChBkB,EAAIR,KAAYE,EACZI,EAAW,GACdE,EAAIR,KAAY,EAChBA,GAAUN,EAAUrc,KAAKmd,EAAKR,EAAQ,EAAG5f,IAEzC4f,GAAUN,EAAUrc,KAAKmd,EAAKR,EAAQM,EAAUlgB,GAEjDogB,EAAIR,KAAYV,EAChBkB,EAAIR,KAAYI,EACZG,EAAW,GACdC,EAAIR,KAAY,EAChBN,EAAUrc,KAAKmd,EAAKR,EAAQ5f,IAE5Bsf,EAAUrc,KAAKmd,EAAKR,EAAQ5f,EAAamgB,GAGnCC,EAGRzkB,EAAOd,QAAU,CAChB4kB,UAAWA,EACXgB,UAAWA,I","file":"js/chunk-vendors~b5906859.e1b53a17.js","sourcesContent":["var generatePrime = require('./lib/generatePrime')\nvar primes = require('./lib/primes.json')\n\nvar DH = require('./lib/dh')\n\nfunction getDiffieHellman (mod) {\n  var prime = new Buffer(primes[mod].prime, 'hex')\n  var gen = new Buffer(primes[mod].gen, 'hex')\n\n  return new DH(prime, gen)\n}\n\nvar ENCODINGS = {\n  'binary': true, 'hex': true, 'base64': true\n}\n\nfunction createDiffieHellman (prime, enc, generator, genc) {\n  if (Buffer.isBuffer(enc) || ENCODINGS[enc] === undefined) {\n    return createDiffieHellman(prime, 'binary', enc, generator)\n  }\n\n  enc = enc || 'binary'\n  genc = genc || 'binary'\n  generator = generator || new Buffer([2])\n\n  if (!Buffer.isBuffer(generator)) {\n    generator = new Buffer(generator, genc)\n  }\n\n  if (typeof prime === 'number') {\n    return new DH(generatePrime(prime, generator), generator, true)\n  }\n\n  if (!Buffer.isBuffer(prime)) {\n    prime = new Buffer(prime, enc)\n  }\n\n  return new DH(prime, generator, true)\n}\n\nexports.DiffieHellmanGroup = exports.createDiffieHellmanGroup = exports.getDiffieHellman = getDiffieHellman\nexports.createDiffieHellman = exports.DiffieHellman = createDiffieHellman\n","'use strict';\n\nvar assert = require('minimalistic-assert');\n\nfunction Cipher(options) {\n  this.options = options;\n\n  this.type = this.options.type;\n  this.blockSize = 8;\n  this._init();\n\n  this.buffer = new Array(this.blockSize);\n  this.bufferOff = 0;\n}\nmodule.exports = Cipher;\n\nCipher.prototype._init = function _init() {\n  // Might be overrided\n};\n\nCipher.prototype.update = function update(data) {\n  if (data.length === 0)\n    return [];\n\n  if (this.type === 'decrypt')\n    return this._updateDecrypt(data);\n  else\n    return this._updateEncrypt(data);\n};\n\nCipher.prototype._buffer = function _buffer(data, off) {\n  // Append data to buffer\n  var min = Math.min(this.buffer.length - this.bufferOff, data.length - off);\n  for (var i = 0; i < min; i++)\n    this.buffer[this.bufferOff + i] = data[off + i];\n  this.bufferOff += min;\n\n  // Shift next\n  return min;\n};\n\nCipher.prototype._flushBuffer = function _flushBuffer(out, off) {\n  this._update(this.buffer, 0, out, off);\n  this.bufferOff = 0;\n  return this.blockSize;\n};\n\nCipher.prototype._updateEncrypt = function _updateEncrypt(data) {\n  var inputOff = 0;\n  var outputOff = 0;\n\n  var count = ((this.bufferOff + data.length) / this.blockSize) | 0;\n  var out = new Array(count * this.blockSize);\n\n  if (this.bufferOff !== 0) {\n    inputOff += this._buffer(data, inputOff);\n\n    if (this.bufferOff === this.buffer.length)\n      outputOff += this._flushBuffer(out, outputOff);\n  }\n\n  // Write blocks\n  var max = data.length - ((data.length - inputOff) % this.blockSize);\n  for (; inputOff < max; inputOff += this.blockSize) {\n    this._update(data, inputOff, out, outputOff);\n    outputOff += this.blockSize;\n  }\n\n  // Queue rest\n  for (; inputOff < data.length; inputOff++, this.bufferOff++)\n    this.buffer[this.bufferOff] = data[inputOff];\n\n  return out;\n};\n\nCipher.prototype._updateDecrypt = function _updateDecrypt(data) {\n  var inputOff = 0;\n  var outputOff = 0;\n\n  var count = Math.ceil((this.bufferOff + data.length) / this.blockSize) - 1;\n  var out = new Array(count * this.blockSize);\n\n  // TODO(indutny): optimize it, this is far from optimal\n  for (; count > 0; count--) {\n    inputOff += this._buffer(data, inputOff);\n    outputOff += this._flushBuffer(out, outputOff);\n  }\n\n  // Buffer rest of the input\n  inputOff += this._buffer(data, inputOff);\n\n  return out;\n};\n\nCipher.prototype.final = function final(buffer) {\n  var first;\n  if (buffer)\n    first = this.update(buffer);\n\n  var last;\n  if (this.type === 'encrypt')\n    last = this._finalEncrypt();\n  else\n    last = this._finalDecrypt();\n\n  if (first)\n    return first.concat(last);\n  else\n    return last;\n};\n\nCipher.prototype._pad = function _pad(buffer, off) {\n  if (off === 0)\n    return false;\n\n  while (off < buffer.length)\n    buffer[off++] = 0;\n\n  return true;\n};\n\nCipher.prototype._finalEncrypt = function _finalEncrypt() {\n  if (!this._pad(this.buffer, this.bufferOff))\n    return [];\n\n  var out = new Array(this.blockSize);\n  this._update(this.buffer, 0, out, 0);\n  return out;\n};\n\nCipher.prototype._unpad = function _unpad(buffer) {\n  return buffer;\n};\n\nCipher.prototype._finalDecrypt = function _finalDecrypt() {\n  assert.equal(this.bufferOff, this.blockSize, 'Not enough data to decrypt');\n  var out = new Array(this.blockSize);\n  this._flushBuffer(out, 0);\n\n  return this._unpad(out);\n};\n","'use strict';\n\nvar assert = require('minimalistic-assert');\nvar inherits = require('inherits');\n\nvar proto = {};\n\nfunction CBCState(iv) {\n  assert.equal(iv.length, 8, 'Invalid IV length');\n\n  this.iv = new Array(8);\n  for (var i = 0; i < this.iv.length; i++)\n    this.iv[i] = iv[i];\n}\n\nfunction instantiate(Base) {\n  function CBC(options) {\n    Base.call(this, options);\n    this._cbcInit();\n  }\n  inherits(CBC, Base);\n\n  var keys = Object.keys(proto);\n  for (var i = 0; i < keys.length; i++) {\n    var key = keys[i];\n    CBC.prototype[key] = proto[key];\n  }\n\n  CBC.create = function create(options) {\n    return new CBC(options);\n  };\n\n  return CBC;\n}\n\nexports.instantiate = instantiate;\n\nproto._cbcInit = function _cbcInit() {\n  var state = new CBCState(this.options.iv);\n  this._cbcState = state;\n};\n\nproto._update = function _update(inp, inOff, out, outOff) {\n  var state = this._cbcState;\n  var superProto = this.constructor.super_.prototype;\n\n  var iv = state.iv;\n  if (this.type === 'encrypt') {\n    for (var i = 0; i < this.blockSize; i++)\n      iv[i] ^= inp[inOff + i];\n\n    superProto._update.call(this, iv, 0, out, outOff);\n\n    for (var i = 0; i < this.blockSize; i++)\n      iv[i] = out[outOff + i];\n  } else {\n    superProto._update.call(this, inp, inOff, out, outOff);\n\n    for (var i = 0; i < this.blockSize; i++)\n      out[outOff + i] ^= iv[i];\n\n    for (var i = 0; i < this.blockSize; i++)\n      iv[i] = inp[inOff + i];\n  }\n};\n","'use strict';\n\nexports.utils = require('./des/utils');\nexports.Cipher = require('./des/cipher');\nexports.DES = require('./des/des');\nexports.CBC = require('./des/cbc');\nexports.EDE = require('./des/ede');\n","'use strict';\n\nvar assert = require('minimalistic-assert');\nvar inherits = require('inherits');\n\nvar Cipher = require('./cipher');\nvar DES = require('./des');\n\nfunction EDEState(type, key) {\n  assert.equal(key.length, 24, 'Invalid key length');\n\n  var k1 = key.slice(0, 8);\n  var k2 = key.slice(8, 16);\n  var k3 = key.slice(16, 24);\n\n  if (type === 'encrypt') {\n    this.ciphers = [\n      DES.create({ type: 'encrypt', key: k1 }),\n      DES.create({ type: 'decrypt', key: k2 }),\n      DES.create({ type: 'encrypt', key: k3 })\n    ];\n  } else {\n    this.ciphers = [\n      DES.create({ type: 'decrypt', key: k3 }),\n      DES.create({ type: 'encrypt', key: k2 }),\n      DES.create({ type: 'decrypt', key: k1 })\n    ];\n  }\n}\n\nfunction EDE(options) {\n  Cipher.call(this, options);\n\n  var state = new EDEState(this.type, this.options.key);\n  this._edeState = state;\n}\ninherits(EDE, Cipher);\n\nmodule.exports = EDE;\n\nEDE.create = function create(options) {\n  return new EDE(options);\n};\n\nEDE.prototype._update = function _update(inp, inOff, out, outOff) {\n  var state = this._edeState;\n\n  state.ciphers[0]._update(inp, inOff, out, outOff);\n  state.ciphers[1]._update(out, outOff, out, outOff);\n  state.ciphers[2]._update(out, outOff, out, outOff);\n};\n\nEDE.prototype._pad = DES.prototype._pad;\nEDE.prototype._unpad = DES.prototype._unpad;\n","'use strict';\n\nfunction getParamSize(keySize) {\n\tvar result = ((keySize / 8) | 0) + (keySize % 8 === 0 ? 0 : 1);\n\treturn result;\n}\n\nvar paramBytesForAlg = {\n\tES256: getParamSize(256),\n\tES384: getParamSize(384),\n\tES512: getParamSize(521)\n};\n\nfunction getParamBytesForAlg(alg) {\n\tvar paramBytes = paramBytesForAlg[alg];\n\tif (paramBytes) {\n\t\treturn paramBytes;\n\t}\n\n\tthrow new Error('Unknown algorithm \"' + alg + '\"');\n}\n\nmodule.exports = getParamBytesForAlg;\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","'use strict';\n\nvar assert = require('minimalistic-assert');\nvar inherits = require('inherits');\n\nvar utils = require('./utils');\nvar Cipher = require('./cipher');\n\nfunction DESState() {\n  this.tmp = new Array(2);\n  this.keys = null;\n}\n\nfunction DES(options) {\n  Cipher.call(this, options);\n\n  var state = new DESState();\n  this._desState = state;\n\n  this.deriveKeys(state, options.key);\n}\ninherits(DES, Cipher);\nmodule.exports = DES;\n\nDES.create = function create(options) {\n  return new DES(options);\n};\n\nvar shiftTable = [\n  1, 1, 2, 2, 2, 2, 2, 2,\n  1, 2, 2, 2, 2, 2, 2, 1\n];\n\nDES.prototype.deriveKeys = function deriveKeys(state, key) {\n  state.keys = new Array(16 * 2);\n\n  assert.equal(key.length, this.blockSize, 'Invalid key length');\n\n  var kL = utils.readUInt32BE(key, 0);\n  var kR = utils.readUInt32BE(key, 4);\n\n  utils.pc1(kL, kR, state.tmp, 0);\n  kL = state.tmp[0];\n  kR = state.tmp[1];\n  for (var i = 0; i < state.keys.length; i += 2) {\n    var shift = shiftTable[i >>> 1];\n    kL = utils.r28shl(kL, shift);\n    kR = utils.r28shl(kR, shift);\n    utils.pc2(kL, kR, state.keys, i);\n  }\n};\n\nDES.prototype._update = function _update(inp, inOff, out, outOff) {\n  var state = this._desState;\n\n  var l = utils.readUInt32BE(inp, inOff);\n  var r = utils.readUInt32BE(inp, inOff + 4);\n\n  // Initial Permutation\n  utils.ip(l, r, state.tmp, 0);\n  l = state.tmp[0];\n  r = state.tmp[1];\n\n  if (this.type === 'encrypt')\n    this._encrypt(state, l, r, state.tmp, 0);\n  else\n    this._decrypt(state, l, r, state.tmp, 0);\n\n  l = state.tmp[0];\n  r = state.tmp[1];\n\n  utils.writeUInt32BE(out, l, outOff);\n  utils.writeUInt32BE(out, r, outOff + 4);\n};\n\nDES.prototype._pad = function _pad(buffer, off) {\n  var value = buffer.length - off;\n  for (var i = off; i < buffer.length; i++)\n    buffer[i] = value;\n\n  return true;\n};\n\nDES.prototype._unpad = function _unpad(buffer) {\n  var pad = buffer[buffer.length - 1];\n  for (var i = buffer.length - pad; i < buffer.length; i++)\n    assert.equal(buffer[i], pad);\n\n  return buffer.slice(0, buffer.length - pad);\n};\n\nDES.prototype._encrypt = function _encrypt(state, lStart, rStart, out, off) {\n  var l = lStart;\n  var r = rStart;\n\n  // Apply f() x16 times\n  for (var i = 0; i < state.keys.length; i += 2) {\n    var keyL = state.keys[i];\n    var keyR = state.keys[i + 1];\n\n    // f(r, k)\n    utils.expand(r, state.tmp, 0);\n\n    keyL ^= state.tmp[0];\n    keyR ^= state.tmp[1];\n    var s = utils.substitute(keyL, keyR);\n    var f = utils.permute(s);\n\n    var t = r;\n    r = (l ^ f) >>> 0;\n    l = t;\n  }\n\n  // Reverse Initial Permutation\n  utils.rip(r, l, out, off);\n};\n\nDES.prototype._decrypt = function _decrypt(state, lStart, rStart, out, off) {\n  var l = rStart;\n  var r = lStart;\n\n  // Apply f() x16 times\n  for (var i = state.keys.length - 2; i >= 0; i -= 2) {\n    var keyL = state.keys[i];\n    var keyR = state.keys[i + 1];\n\n    // f(r, k)\n    utils.expand(l, state.tmp, 0);\n\n    keyL ^= state.tmp[0];\n    keyR ^= state.tmp[1];\n    var s = utils.substitute(keyL, keyR);\n    var f = utils.permute(s);\n\n    var t = l;\n    l = (r ^ f) >>> 0;\n    r = t;\n  }\n\n  // Reverse Initial Permutation\n  utils.rip(l, r, out, off);\n};\n","var BN = require('bn.js');\nvar MillerRabin = require('miller-rabin');\nvar millerRabin = new MillerRabin();\nvar TWENTYFOUR = new BN(24);\nvar ELEVEN = new BN(11);\nvar TEN = new BN(10);\nvar THREE = new BN(3);\nvar SEVEN = new BN(7);\nvar primes = require('./generatePrime');\nvar randomBytes = require('randombytes');\nmodule.exports = DH;\n\nfunction setPublicKey(pub, enc) {\n  enc = enc || 'utf8';\n  if (!Buffer.isBuffer(pub)) {\n    pub = new Buffer(pub, enc);\n  }\n  this._pub = new BN(pub);\n  return this;\n}\n\nfunction setPrivateKey(priv, enc) {\n  enc = enc || 'utf8';\n  if (!Buffer.isBuffer(priv)) {\n    priv = new Buffer(priv, enc);\n  }\n  this._priv = new BN(priv);\n  return this;\n}\n\nvar primeCache = {};\nfunction checkPrime(prime, generator) {\n  var gen = generator.toString('hex');\n  var hex = [gen, prime.toString(16)].join('_');\n  if (hex in primeCache) {\n    return primeCache[hex];\n  }\n  var error = 0;\n\n  if (prime.isEven() ||\n    !primes.simpleSieve ||\n    !primes.fermatTest(prime) ||\n    !millerRabin.test(prime)) {\n    //not a prime so +1\n    error += 1;\n\n    if (gen === '02' || gen === '05') {\n      // we'd be able to check the generator\n      // it would fail so +8\n      error += 8;\n    } else {\n      //we wouldn't be able to test the generator\n      // so +4\n      error += 4;\n    }\n    primeCache[hex] = error;\n    return error;\n  }\n  if (!millerRabin.test(prime.shrn(1))) {\n    //not a safe prime\n    error += 2;\n  }\n  var rem;\n  switch (gen) {\n    case '02':\n      if (prime.mod(TWENTYFOUR).cmp(ELEVEN)) {\n        // unsuidable generator\n        error += 8;\n      }\n      break;\n    case '05':\n      rem = prime.mod(TEN);\n      if (rem.cmp(THREE) && rem.cmp(SEVEN)) {\n        // prime mod 10 needs to equal 3 or 7\n        error += 8;\n      }\n      break;\n    default:\n      error += 4;\n  }\n  primeCache[hex] = error;\n  return error;\n}\n\nfunction DH(prime, generator, malleable) {\n  this.setGenerator(generator);\n  this.__prime = new BN(prime);\n  this._prime = BN.mont(this.__prime);\n  this._primeLen = prime.length;\n  this._pub = undefined;\n  this._priv = undefined;\n  this._primeCode = undefined;\n  if (malleable) {\n    this.setPublicKey = setPublicKey;\n    this.setPrivateKey = setPrivateKey;\n  } else {\n    this._primeCode = 8;\n  }\n}\nObject.defineProperty(DH.prototype, 'verifyError', {\n  enumerable: true,\n  get: function () {\n    if (typeof this._primeCode !== 'number') {\n      this._primeCode = checkPrime(this.__prime, this.__gen);\n    }\n    return this._primeCode;\n  }\n});\nDH.prototype.generateKeys = function () {\n  if (!this._priv) {\n    this._priv = new BN(randomBytes(this._primeLen));\n  }\n  this._pub = this._gen.toRed(this._prime).redPow(this._priv).fromRed();\n  return this.getPublicKey();\n};\n\nDH.prototype.computeSecret = function (other) {\n  other = new BN(other);\n  other = other.toRed(this._prime);\n  var secret = other.redPow(this._priv).fromRed();\n  var out = new Buffer(secret.toArray());\n  var prime = this.getPrime();\n  if (out.length < prime.length) {\n    var front = new Buffer(prime.length - out.length);\n    front.fill(0);\n    out = Buffer.concat([front, out]);\n  }\n  return out;\n};\n\nDH.prototype.getPublicKey = function getPublicKey(enc) {\n  return formatReturnValue(this._pub, enc);\n};\n\nDH.prototype.getPrivateKey = function getPrivateKey(enc) {\n  return formatReturnValue(this._priv, enc);\n};\n\nDH.prototype.getPrime = function (enc) {\n  return formatReturnValue(this.__prime, enc);\n};\n\nDH.prototype.getGenerator = function (enc) {\n  return formatReturnValue(this._gen, enc);\n};\n\nDH.prototype.setGenerator = function (gen, enc) {\n  enc = enc || 'utf8';\n  if (!Buffer.isBuffer(gen)) {\n    gen = new Buffer(gen, enc);\n  }\n  this.__gen = gen;\n  this._gen = new BN(gen);\n  return this;\n};\n\nfunction formatReturnValue(bn, enc) {\n  var buf = new Buffer(bn.toArray());\n  if (!enc) {\n    return buf;\n  } else {\n    return buf.toString(enc);\n  }\n}\n","var randomBytes = require('randombytes');\nmodule.exports = findPrime;\nfindPrime.simpleSieve = simpleSieve;\nfindPrime.fermatTest = fermatTest;\nvar BN = require('bn.js');\nvar TWENTYFOUR = new BN(24);\nvar MillerRabin = require('miller-rabin');\nvar millerRabin = new MillerRabin();\nvar ONE = new BN(1);\nvar TWO = new BN(2);\nvar FIVE = new BN(5);\nvar SIXTEEN = new BN(16);\nvar EIGHT = new BN(8);\nvar TEN = new BN(10);\nvar THREE = new BN(3);\nvar SEVEN = new BN(7);\nvar ELEVEN = new BN(11);\nvar FOUR = new BN(4);\nvar TWELVE = new BN(12);\nvar primes = null;\n\nfunction _getPrimes() {\n  if (primes !== null)\n    return primes;\n\n  var limit = 0x100000;\n  var res = [];\n  res[0] = 2;\n  for (var i = 1, k = 3; k < limit; k += 2) {\n    var sqrt = Math.ceil(Math.sqrt(k));\n    for (var j = 0; j < i && res[j] <= sqrt; j++)\n      if (k % res[j] === 0)\n        break;\n\n    if (i !== j && res[j] <= sqrt)\n      continue;\n\n    res[i++] = k;\n  }\n  primes = res;\n  return res;\n}\n\nfunction simpleSieve(p) {\n  var primes = _getPrimes();\n\n  for (var i = 0; i < primes.length; i++)\n    if (p.modn(primes[i]) === 0) {\n      if (p.cmpn(primes[i]) === 0) {\n        return true;\n      } else {\n        return false;\n      }\n    }\n\n  return true;\n}\n\nfunction fermatTest(p) {\n  var red = BN.mont(p);\n  return TWO.toRed(red).redPow(p.subn(1)).fromRed().cmpn(1) === 0;\n}\n\nfunction findPrime(bits, gen) {\n  if (bits < 16) {\n    // this is what openssl does\n    if (gen === 2 || gen === 5) {\n      return new BN([0x8c, 0x7b]);\n    } else {\n      return new BN([0x8c, 0x27]);\n    }\n  }\n  gen = new BN(gen);\n\n  var num, n2;\n\n  while (true) {\n    num = new BN(randomBytes(Math.ceil(bits / 8)));\n    while (num.bitLength() > bits) {\n      num.ishrn(1);\n    }\n    if (num.isEven()) {\n      num.iadd(ONE);\n    }\n    if (!num.testn(1)) {\n      num.iadd(TWO);\n    }\n    if (!gen.cmp(TWO)) {\n      while (num.mod(TWENTYFOUR).cmp(ELEVEN)) {\n        num.iadd(FOUR);\n      }\n    } else if (!gen.cmp(FIVE)) {\n      while (num.mod(TEN).cmp(THREE)) {\n        num.iadd(FOUR);\n      }\n    }\n    n2 = num.shrn(1);\n    if (simpleSieve(n2) && simpleSieve(num) &&\n      fermatTest(n2) && fermatTest(num) &&\n      millerRabin.test(n2) && millerRabin.test(num)) {\n      return num;\n    }\n  }\n\n}\n","'use strict';\n\nexports.readUInt32BE = function readUInt32BE(bytes, off) {\n  var res =  (bytes[0 + off] << 24) |\n             (bytes[1 + off] << 16) |\n             (bytes[2 + off] << 8) |\n             bytes[3 + off];\n  return res >>> 0;\n};\n\nexports.writeUInt32BE = function writeUInt32BE(bytes, value, off) {\n  bytes[0 + off] = value >>> 24;\n  bytes[1 + off] = (value >>> 16) & 0xff;\n  bytes[2 + off] = (value >>> 8) & 0xff;\n  bytes[3 + off] = value & 0xff;\n};\n\nexports.ip = function ip(inL, inR, out, off) {\n  var outL = 0;\n  var outR = 0;\n\n  for (var i = 6; i >= 0; i -= 2) {\n    for (var j = 0; j <= 24; j += 8) {\n      outL <<= 1;\n      outL |= (inR >>> (j + i)) & 1;\n    }\n    for (var j = 0; j <= 24; j += 8) {\n      outL <<= 1;\n      outL |= (inL >>> (j + i)) & 1;\n    }\n  }\n\n  for (var i = 6; i >= 0; i -= 2) {\n    for (var j = 1; j <= 25; j += 8) {\n      outR <<= 1;\n      outR |= (inR >>> (j + i)) & 1;\n    }\n    for (var j = 1; j <= 25; j += 8) {\n      outR <<= 1;\n      outR |= (inL >>> (j + i)) & 1;\n    }\n  }\n\n  out[off + 0] = outL >>> 0;\n  out[off + 1] = outR >>> 0;\n};\n\nexports.rip = function rip(inL, inR, out, off) {\n  var outL = 0;\n  var outR = 0;\n\n  for (var i = 0; i < 4; i++) {\n    for (var j = 24; j >= 0; j -= 8) {\n      outL <<= 1;\n      outL |= (inR >>> (j + i)) & 1;\n      outL <<= 1;\n      outL |= (inL >>> (j + i)) & 1;\n    }\n  }\n  for (var i = 4; i < 8; i++) {\n    for (var j = 24; j >= 0; j -= 8) {\n      outR <<= 1;\n      outR |= (inR >>> (j + i)) & 1;\n      outR <<= 1;\n      outR |= (inL >>> (j + i)) & 1;\n    }\n  }\n\n  out[off + 0] = outL >>> 0;\n  out[off + 1] = outR >>> 0;\n};\n\nexports.pc1 = function pc1(inL, inR, out, off) {\n  var outL = 0;\n  var outR = 0;\n\n  // 7, 15, 23, 31, 39, 47, 55, 63\n  // 6, 14, 22, 30, 39, 47, 55, 63\n  // 5, 13, 21, 29, 39, 47, 55, 63\n  // 4, 12, 20, 28\n  for (var i = 7; i >= 5; i--) {\n    for (var j = 0; j <= 24; j += 8) {\n      outL <<= 1;\n      outL |= (inR >> (j + i)) & 1;\n    }\n    for (var j = 0; j <= 24; j += 8) {\n      outL <<= 1;\n      outL |= (inL >> (j + i)) & 1;\n    }\n  }\n  for (var j = 0; j <= 24; j += 8) {\n    outL <<= 1;\n    outL |= (inR >> (j + i)) & 1;\n  }\n\n  // 1, 9, 17, 25, 33, 41, 49, 57\n  // 2, 10, 18, 26, 34, 42, 50, 58\n  // 3, 11, 19, 27, 35, 43, 51, 59\n  // 36, 44, 52, 60\n  for (var i = 1; i <= 3; i++) {\n    for (var j = 0; j <= 24; j += 8) {\n      outR <<= 1;\n      outR |= (inR >> (j + i)) & 1;\n    }\n    for (var j = 0; j <= 24; j += 8) {\n      outR <<= 1;\n      outR |= (inL >> (j + i)) & 1;\n    }\n  }\n  for (var j = 0; j <= 24; j += 8) {\n    outR <<= 1;\n    outR |= (inL >> (j + i)) & 1;\n  }\n\n  out[off + 0] = outL >>> 0;\n  out[off + 1] = outR >>> 0;\n};\n\nexports.r28shl = function r28shl(num, shift) {\n  return ((num << shift) & 0xfffffff) | (num >>> (28 - shift));\n};\n\nvar pc2table = [\n  // inL => outL\n  14, 11, 17, 4, 27, 23, 25, 0,\n  13, 22, 7, 18, 5, 9, 16, 24,\n  2, 20, 12, 21, 1, 8, 15, 26,\n\n  // inR => outR\n  15, 4, 25, 19, 9, 1, 26, 16,\n  5, 11, 23, 8, 12, 7, 17, 0,\n  22, 3, 10, 14, 6, 20, 27, 24\n];\n\nexports.pc2 = function pc2(inL, inR, out, off) {\n  var outL = 0;\n  var outR = 0;\n\n  var len = pc2table.length >>> 1;\n  for (var i = 0; i < len; i++) {\n    outL <<= 1;\n    outL |= (inL >>> pc2table[i]) & 0x1;\n  }\n  for (var i = len; i < pc2table.length; i++) {\n    outR <<= 1;\n    outR |= (inR >>> pc2table[i]) & 0x1;\n  }\n\n  out[off + 0] = outL >>> 0;\n  out[off + 1] = outR >>> 0;\n};\n\nexports.expand = function expand(r, out, off) {\n  var outL = 0;\n  var outR = 0;\n\n  outL = ((r & 1) << 5) | (r >>> 27);\n  for (var i = 23; i >= 15; i -= 4) {\n    outL <<= 6;\n    outL |= (r >>> i) & 0x3f;\n  }\n  for (var i = 11; i >= 3; i -= 4) {\n    outR |= (r >>> i) & 0x3f;\n    outR <<= 6;\n  }\n  outR |= ((r & 0x1f) << 1) | (r >>> 31);\n\n  out[off + 0] = outL >>> 0;\n  out[off + 1] = outR >>> 0;\n};\n\nvar sTable = [\n  14, 0, 4, 15, 13, 7, 1, 4, 2, 14, 15, 2, 11, 13, 8, 1,\n  3, 10, 10, 6, 6, 12, 12, 11, 5, 9, 9, 5, 0, 3, 7, 8,\n  4, 15, 1, 12, 14, 8, 8, 2, 13, 4, 6, 9, 2, 1, 11, 7,\n  15, 5, 12, 11, 9, 3, 7, 14, 3, 10, 10, 0, 5, 6, 0, 13,\n\n  15, 3, 1, 13, 8, 4, 14, 7, 6, 15, 11, 2, 3, 8, 4, 14,\n  9, 12, 7, 0, 2, 1, 13, 10, 12, 6, 0, 9, 5, 11, 10, 5,\n  0, 13, 14, 8, 7, 10, 11, 1, 10, 3, 4, 15, 13, 4, 1, 2,\n  5, 11, 8, 6, 12, 7, 6, 12, 9, 0, 3, 5, 2, 14, 15, 9,\n\n  10, 13, 0, 7, 9, 0, 14, 9, 6, 3, 3, 4, 15, 6, 5, 10,\n  1, 2, 13, 8, 12, 5, 7, 14, 11, 12, 4, 11, 2, 15, 8, 1,\n  13, 1, 6, 10, 4, 13, 9, 0, 8, 6, 15, 9, 3, 8, 0, 7,\n  11, 4, 1, 15, 2, 14, 12, 3, 5, 11, 10, 5, 14, 2, 7, 12,\n\n  7, 13, 13, 8, 14, 11, 3, 5, 0, 6, 6, 15, 9, 0, 10, 3,\n  1, 4, 2, 7, 8, 2, 5, 12, 11, 1, 12, 10, 4, 14, 15, 9,\n  10, 3, 6, 15, 9, 0, 0, 6, 12, 10, 11, 1, 7, 13, 13, 8,\n  15, 9, 1, 4, 3, 5, 14, 11, 5, 12, 2, 7, 8, 2, 4, 14,\n\n  2, 14, 12, 11, 4, 2, 1, 12, 7, 4, 10, 7, 11, 13, 6, 1,\n  8, 5, 5, 0, 3, 15, 15, 10, 13, 3, 0, 9, 14, 8, 9, 6,\n  4, 11, 2, 8, 1, 12, 11, 7, 10, 1, 13, 14, 7, 2, 8, 13,\n  15, 6, 9, 15, 12, 0, 5, 9, 6, 10, 3, 4, 0, 5, 14, 3,\n\n  12, 10, 1, 15, 10, 4, 15, 2, 9, 7, 2, 12, 6, 9, 8, 5,\n  0, 6, 13, 1, 3, 13, 4, 14, 14, 0, 7, 11, 5, 3, 11, 8,\n  9, 4, 14, 3, 15, 2, 5, 12, 2, 9, 8, 5, 12, 15, 3, 10,\n  7, 11, 0, 14, 4, 1, 10, 7, 1, 6, 13, 0, 11, 8, 6, 13,\n\n  4, 13, 11, 0, 2, 11, 14, 7, 15, 4, 0, 9, 8, 1, 13, 10,\n  3, 14, 12, 3, 9, 5, 7, 12, 5, 2, 10, 15, 6, 8, 1, 6,\n  1, 6, 4, 11, 11, 13, 13, 8, 12, 1, 3, 4, 7, 10, 14, 7,\n  10, 9, 15, 5, 6, 0, 8, 15, 0, 14, 5, 2, 9, 3, 2, 12,\n\n  13, 1, 2, 15, 8, 13, 4, 8, 6, 10, 15, 3, 11, 7, 1, 4,\n  10, 12, 9, 5, 3, 6, 14, 11, 5, 0, 0, 14, 12, 9, 7, 2,\n  7, 2, 11, 1, 4, 14, 1, 7, 9, 4, 12, 10, 14, 8, 2, 13,\n  0, 15, 6, 12, 10, 9, 13, 0, 15, 3, 3, 5, 5, 6, 8, 11\n];\n\nexports.substitute = function substitute(inL, inR) {\n  var out = 0;\n  for (var i = 0; i < 4; i++) {\n    var b = (inL >>> (18 - i * 6)) & 0x3f;\n    var sb = sTable[i * 0x40 + b];\n\n    out <<= 4;\n    out |= sb;\n  }\n  for (var i = 0; i < 4; i++) {\n    var b = (inR >>> (18 - i * 6)) & 0x3f;\n    var sb = sTable[4 * 0x40 + i * 0x40 + b];\n\n    out <<= 4;\n    out |= sb;\n  }\n  return out >>> 0;\n};\n\nvar permuteTable = [\n  16, 25, 12, 11, 3, 20, 4, 15, 31, 17, 9, 6, 27, 14, 1, 22,\n  30, 24, 8, 18, 0, 5, 29, 23, 13, 19, 2, 26, 10, 21, 28, 7\n];\n\nexports.permute = function permute(num) {\n  var out = 0;\n  for (var i = 0; i < permuteTable.length; i++) {\n    out <<= 1;\n    out |= (num >>> permuteTable[i]) & 0x1;\n  }\n  return out >>> 0;\n};\n\nexports.padSplit = function padSplit(num, size, group) {\n  var str = num.toString(2);\n  while (str.length < size)\n    str = '0' + str;\n\n  var out = [];\n  for (var i = 0; i < size; i += group)\n    out.push(str.slice(i, i + group));\n  return out.join(' ');\n};\n","'use strict';\n\nvar Buffer = require('safe-buffer').Buffer;\n\nvar getParamBytesForAlg = require('./param-bytes-for-alg');\n\nvar MAX_OCTET = 0x80,\n\tCLASS_UNIVERSAL = 0,\n\tPRIMITIVE_BIT = 0x20,\n\tTAG_SEQ = 0x10,\n\tTAG_INT = 0x02,\n\tENCODED_TAG_SEQ = (TAG_SEQ | PRIMITIVE_BIT) | (CLASS_UNIVERSAL << 6),\n\tENCODED_TAG_INT = TAG_INT | (CLASS_UNIVERSAL << 6);\n\nfunction base64Url(base64) {\n\treturn base64\n\t\t.replace(/=/g, '')\n\t\t.replace(/\\+/g, '-')\n\t\t.replace(/\\//g, '_');\n}\n\nfunction signatureAsBuffer(signature) {\n\tif (Buffer.isBuffer(signature)) {\n\t\treturn signature;\n\t} else if ('string' === typeof signature) {\n\t\treturn Buffer.from(signature, 'base64');\n\t}\n\n\tthrow new TypeError('ECDSA signature must be a Base64 string or a Buffer');\n}\n\nfunction derToJose(signature, alg) {\n\tsignature = signatureAsBuffer(signature);\n\tvar paramBytes = getParamBytesForAlg(alg);\n\n\t// the DER encoded param should at most be the param size, plus a padding\n\t// zero, since due to being a signed integer\n\tvar maxEncodedParamLength = paramBytes + 1;\n\n\tvar inputLength = signature.length;\n\n\tvar offset = 0;\n\tif (signature[offset++] !== ENCODED_TAG_SEQ) {\n\t\tthrow new Error('Could not find expected \"seq\"');\n\t}\n\n\tvar seqLength = signature[offset++];\n\tif (seqLength === (MAX_OCTET | 1)) {\n\t\tseqLength = signature[offset++];\n\t}\n\n\tif (inputLength - offset < seqLength) {\n\t\tthrow new Error('\"seq\" specified length of \"' + seqLength + '\", only \"' + (inputLength - offset) + '\" remaining');\n\t}\n\n\tif (signature[offset++] !== ENCODED_TAG_INT) {\n\t\tthrow new Error('Could not find expected \"int\" for \"r\"');\n\t}\n\n\tvar rLength = signature[offset++];\n\n\tif (inputLength - offset - 2 < rLength) {\n\t\tthrow new Error('\"r\" specified length of \"' + rLength + '\", only \"' + (inputLength - offset - 2) + '\" available');\n\t}\n\n\tif (maxEncodedParamLength < rLength) {\n\t\tthrow new Error('\"r\" specified length of \"' + rLength + '\", max of \"' + maxEncodedParamLength + '\" is acceptable');\n\t}\n\n\tvar rOffset = offset;\n\toffset += rLength;\n\n\tif (signature[offset++] !== ENCODED_TAG_INT) {\n\t\tthrow new Error('Could not find expected \"int\" for \"s\"');\n\t}\n\n\tvar sLength = signature[offset++];\n\n\tif (inputLength - offset !== sLength) {\n\t\tthrow new Error('\"s\" specified length of \"' + sLength + '\", expected \"' + (inputLength - offset) + '\"');\n\t}\n\n\tif (maxEncodedParamLength < sLength) {\n\t\tthrow new Error('\"s\" specified length of \"' + sLength + '\", max of \"' + maxEncodedParamLength + '\" is acceptable');\n\t}\n\n\tvar sOffset = offset;\n\toffset += sLength;\n\n\tif (offset !== inputLength) {\n\t\tthrow new Error('Expected to consume entire buffer, but \"' + (inputLength - offset) + '\" bytes remain');\n\t}\n\n\tvar rPadding = paramBytes - rLength,\n\t\tsPadding = paramBytes - sLength;\n\n\tvar dst = Buffer.allocUnsafe(rPadding + rLength + sPadding + sLength);\n\n\tfor (offset = 0; offset < rPadding; ++offset) {\n\t\tdst[offset] = 0;\n\t}\n\tsignature.copy(dst, offset, rOffset + Math.max(-rPadding, 0), rOffset + rLength);\n\n\toffset = paramBytes;\n\n\tfor (var o = offset; offset < o + sPadding; ++offset) {\n\t\tdst[offset] = 0;\n\t}\n\tsignature.copy(dst, offset, sOffset + Math.max(-sPadding, 0), sOffset + sLength);\n\n\tdst = dst.toString('base64');\n\tdst = base64Url(dst);\n\n\treturn dst;\n}\n\nfunction countPadding(buf, start, stop) {\n\tvar padding = 0;\n\twhile (start + padding < stop && buf[start + padding] === 0) {\n\t\t++padding;\n\t}\n\n\tvar needsSign = buf[start + padding] >= MAX_OCTET;\n\tif (needsSign) {\n\t\t--padding;\n\t}\n\n\treturn padding;\n}\n\nfunction joseToDer(signature, alg) {\n\tsignature = signatureAsBuffer(signature);\n\tvar paramBytes = getParamBytesForAlg(alg);\n\n\tvar signatureBytes = signature.length;\n\tif (signatureBytes !== paramBytes * 2) {\n\t\tthrow new TypeError('\"' + alg + '\" signatures must be \"' + paramBytes * 2 + '\" bytes, saw \"' + signatureBytes + '\"');\n\t}\n\n\tvar rPadding = countPadding(signature, 0, paramBytes);\n\tvar sPadding = countPadding(signature, paramBytes, signature.length);\n\tvar rLength = paramBytes - rPadding;\n\tvar sLength = paramBytes - sPadding;\n\n\tvar rsBytes = 1 + 1 + rLength + 1 + 1 + sLength;\n\n\tvar shortLength = rsBytes < MAX_OCTET;\n\n\tvar dst = Buffer.allocUnsafe((shortLength ? 2 : 3) + rsBytes);\n\n\tvar offset = 0;\n\tdst[offset++] = ENCODED_TAG_SEQ;\n\tif (shortLength) {\n\t\t// Bit 8 has value \"0\"\n\t\t// bits 7-1 give the length.\n\t\tdst[offset++] = rsBytes;\n\t} else {\n\t\t// Bit 8 of first octet has value \"1\"\n\t\t// bits 7-1 give the number of additional length octets.\n\t\tdst[offset++] = MAX_OCTET\t| 1;\n\t\t// length, base 256\n\t\tdst[offset++] = rsBytes & 0xff;\n\t}\n\tdst[offset++] = ENCODED_TAG_INT;\n\tdst[offset++] = rLength;\n\tif (rPadding < 0) {\n\t\tdst[offset++] = 0;\n\t\toffset += signature.copy(dst, offset, 0, paramBytes);\n\t} else {\n\t\toffset += signature.copy(dst, offset, rPadding, paramBytes);\n\t}\n\tdst[offset++] = ENCODED_TAG_INT;\n\tdst[offset++] = sLength;\n\tif (sPadding < 0) {\n\t\tdst[offset++] = 0;\n\t\tsignature.copy(dst, offset, paramBytes);\n\t} else {\n\t\tsignature.copy(dst, offset, paramBytes + sPadding);\n\t}\n\n\treturn dst;\n}\n\nmodule.exports = {\n\tderToJose: derToJose,\n\tjoseToDer: joseToDer\n};\n"],"sourceRoot":""}