{"version":3,"sources":["webpack:///./node_modules/@ethersproject/bignumber/lib.esm/fixednumber.js","webpack:///./node_modules/@ethersproject/constants/lib.esm/hashes.js","webpack:///./node_modules/@ethersproject/bytes/lib.esm/_version.js","webpack:///./node_modules/@ethersproject/bytes/lib.esm/index.js","webpack:///./node_modules/@ethersproject/constants/lib.esm/bignumbers.js","webpack:///./node_modules/@ethersproject/bignumber/lib.esm/_version.js","webpack:///./node_modules/@ethersproject/constants/lib.esm/strings.js","webpack:///./node_modules/@ethersproject/bignumber/node_modules/bn.js/lib/bn.js","webpack:///./node_modules/@ethersproject/constants/lib.esm/addresses.js","webpack:///./node_modules/@ethersproject/bignumber/lib.esm/bignumber.js","webpack:///./node_modules/@ethersproject/contracts/lib.esm/index.js","webpack:///./node_modules/@ethersproject/contracts/lib.esm/_version.js"],"names":["logger","_constructorGuard","Zero","from","NegativeOne","throwFault","message","fault","operation","value","params","throwError","errors","NUMERIC_FAULT","zeros","length","getMultiplier","decimals","toNumber","e","substring","throwArgumentError","formatFixed","multiplier","negative","lt","mul","fraction","mod","toString","match","whole","div","parseFixed","comps","split","wholeValue","fractionValue","wei","add","FixedFormat","constructor","constructorGuard","signed","width","UNSUPPORTED_OPERATION","this","name","String","_multiplier","Object","freeze","static","parseInt","check","key","type","defaultValue","FixedNumber","hex","format","_hex","_value","_isFixedNumber","_checkFormat","other","addUnsafe","a","b","fromValue","subUnsafe","sub","mulUnsafe","divUnsafe","floor","push","result","hasFraction","isNegative","ONE","toFormat","ceiling","round","factor","bump","BUMP","isZero","toHexString","fromTwos","toTwos","toUnsafeFloat","parseFloat","fromString","fixedFormat","numeric","decimal","Error","i","fromBytes","error","code","INVALID_ARGUMENT","HashZero","isHexable","addSlice","array","slice","args","Array","prototype","call","arguments","Uint8Array","apply","isBytesLike","isHexString","isBytes","isInteger","v","arrayify","options","checkSafeUint53","unshift","allowMissingPrefix","hexPad","concat","items","objects","map","item","reduce","accum","offset","object","set","stripZeros","start","zeroPad","HexCharacters","hexlify","Math","toLowerCase","hexDataLength","data","hexDataSlice","endOffset","hexConcat","forEach","hexValue","trimmed","hexStripZeros","hexZeroPad","splitSignature","signature","r","s","_vs","recoveryParam","yParityAndS","compact","bytes","vs","recId","joinSignature","One","Two","WeiPerEther","MaxUint256","MinInt256","MaxInt256","version","EtherSymbol","assert","val","msg","inherits","ctor","superCtor","super_","TempCtor","BN","number","base","endian","isBN","words","red","_init","Buffer","module","exports","wordSize","window","parseHex4Bits","string","index","c","charCodeAt","parseHexByte","lowerBound","parseBase","str","end","len","min","move","dest","src","num","isArray","max","left","right","cmp","_initNumber","_initArray","replace","_parseHex","_parseBase","toArray","ceil","j","w","off","_strip","limbLen","limbPow","total","word","imuln","_iaddn","pow","copy","_move","clone","_expand","size","_normSign","Symbol","for","inspect","groupSizes","groupBases","padding","out","carry","groupSize","groupBase","modrn","idivn","ret","toJSON","toBuffer","toArrayLike","smallMulTo","self","lo","k","ncarry","rword","maxJ","ArrayType","byteLength","reqLength","res","allocUnsafe","allocate","_toArrayLikeLE","position","shift","_toArrayLikeBE","clz32","_countBits","t","_zeroBits","bitLength","hi","zeroBits","abs","inotn","iaddn","testn","notn","ineg","isNeg","neg","iuor","ior","or","uor","iuand","iand","and","uand","iuxor","ixor","xor","uxor","bytesNeeded","bitsLeft","setn","bit","wbit","iadd","isub","comb10MulTo","mid","o","a0","al0","ah0","a1","al1","ah1","a2","al2","ah2","a3","al3","ah3","a4","al4","ah4","a5","al5","ah5","a6","al6","ah6","a7","al7","ah7","a8","al8","ah8","a9","al9","ah9","b0","bl0","bh0","b1","bl1","bh1","b2","bl2","bh2","b3","bl3","bh3","b4","bl4","bh4","b5","bl5","bh5","b6","bl6","bh6","b7","bl7","bh7","b8","bl8","bh8","b9","bl9","bh9","w0","imul","w1","w2","w3","w4","w5","w6","w7","w8","w9","w10","w11","w12","w13","w14","w15","w16","w17","w18","bigMulTo","hncarry","jumboMulTo","FFTM","x","y","mulTo","makeRBT","N","l","revBin","rb","permute","rbt","rws","iws","rtws","itws","transform","rtwdf","cos","PI","itwdf","sin","p","rtwdf_","itwdf_","re","ie","ro","io","rx","guessLen13b","n","m","odd","conjugate","normalize13b","ws","convert13b","stub","ph","mulp","_","rwst","iwst","nrws","nrwst","niwst","rmws","mulf","isNegNum","muln","sqr","isqr","toBitArray","q","iushln","bits","carryMask","newCarry","ishln","iushrn","hint","extended","h","mask","maskedWords","ishrn","shln","ushln","shrn","ushrn","imaskn","maskn","isubn","addn","subn","iabs","_ishlnsubmul","_wordDiv","mode","bhi","diff","qj","divmod","positive","divn","umod","divRound","dm","half","r2","andln","acc","modn","egcd","A","B","C","D","g","isEven","yp","xp","im","isOdd","jm","gcd","_invmp","x1","x2","delta","cmpn","invm","bincn","ucmp","gtn","gt","gten","gte","ltn","lten","lte","eqn","eq","Red","toRed","ctx","convertTo","_forceRed","fromRed","convertFrom","forceRed","redAdd","redIAdd","redSub","redISub","redShl","shl","redMul","_verify2","redIMul","redSqr","_verify1","redISqr","redSqrt","sqrt","redInvm","redNeg","redPow","primes","k256","p224","p192","p25519","MPrime","tmp","_tmp","K256","P224","P192","P25519","prime","_prime","Mont","imod","rinv","minv","ireduce","rlen","imulK","strip","input","output","outLen","prev","next","mod3","one","nOne","lpow","z","inv","wnd","current","currentLen","mont","u","AddressZero","MAX_SAFE","isBigNumberish","BigNumber","isBigNumber","_warnedToStringRadix","_isBigNumber","toBigNumber","toBN","shr","toBigInt","BigInt","warn","UNEXPECTED_ARGUMENT","toHex","anyValue","_base36To16","_base16To36","__awaiter","thisArg","_arguments","P","generator","adopt","resolve","Promise","reject","fulfilled","step","rejected","done","then","allowedTransactionKeys","chainId","gasLimit","gasPrice","nonce","to","accessList","maxFeePerGas","maxPriorityFeePerGas","customData","ccipReadEnabled","resolveName","resolver","nameOrPromise","address","resolveAddresses","paramType","all","components","baseType","arrayChildren","makeError","argument","populateTransaction","contract","fragment","overrides","inputs","pop","checkArgumentCount","signer","override","getAddress","provider","resolved","resolvedAddress","interface","encodeFunctionData","tx","gas","intrinsic","roValue","payable","leftovers","keys","filter","JSON","stringify","join","addContractWait","wait","bind","confirmations","receipt","events","logs","log","event","parsed","parseLog","decode","topics","decodeEventLog","eventFragment","eventSignature","removeListener","getBlock","blockHash","getTransaction","transactionHash","getTransactionReceipt","buildCall","collapseSimple","signerOrProvider","blockTag","deployTransaction","_deployed","decodeFunctionResult","outputs","CALL_EXCEPTION","transaction","buildDefault","constant","txRequest","sendTransaction","buildSend","getEventTag","topic","tag","_listeners","addListener","listener","once","removeAllListeners","listeners","listenerCount","run","argsCopy","setTimeout","prepareEvent","getEmit","ErrorRunningEvent","super","contractInterface","getEventTopic","decodeError","addressOrName","isSigner","isProvider","uniqueFilters","filters","encodeFilterTopics","catch","uniqueNames","uniqueSignatures","functions","callStatic","buildPopulate","estimateGas","buildEstimate","signatures","isInterface","deployed","_deployedPromise","getCode","contractAddress","fallback","connect","attach","isIndexed","_normalizeRunningEvent","runningEvent","_runningEvents","_getRunningEvent","eventName","getEvent","_checkRunningEvents","emit","_wrappedEmits","_wrapEvent","_addEventListener","wrappedEmit","on","queryFilter","fromBlockOrBlockhash","toBlock","fromBlock","getLogs","Contract","bytecode","bytecodeHex","getDeployTransaction","deploy","encodeDeploy","unsignedTx","getContract","compilerOutput","MISSING_ARGUMENT","parse","abi","evm","getInterface"],"mappings":"oHAAA,0JAIA,MAAMA,EAAS,IAAI,IAAO,KAEpBC,EAAoB,CAAC,EACrBC,EAAO,IAAUC,KAAK,GACtBC,EAAc,IAAUD,MAAM,GACpC,SAASE,EAAWC,EAASC,EAAOC,EAAWC,GAC3C,MAAMC,EAAS,CAAEH,MAAOA,EAAOC,UAAWA,GAI1C,YAAO,IAHHC,IACAC,EAAOD,MAAQA,GAEZT,EAAOW,WAAWL,EAAS,IAAOM,OAAOC,cAAeH,GAGnE,IAAII,EAAQ,IACZ,KAAOA,EAAMC,OAAS,KAClBD,GAASA,EAGb,SAASE,EAAcC,GACnB,GAA0B,iBAAf,EACP,IACIA,EAAW,IAAUd,KAAKc,GAAUC,UAAUA,CAElD,MAAOC,IAEX,MAA0B,iBAAf,GAA2BF,GAAY,GAAKA,GAAY,OAASA,EAAW,GAC3E,IAAMH,EAAMM,UAAU,EAAGH,GAE9BjB,EAAOqB,mBAAmB,uBAAwB,WAAYJ,GAElE,SAASK,EAAYb,EAAOQ,GACf,MAAZA,IACAA,EAAW,GAEf,MAAMM,EAAaP,EAAcC,GAG3BO,GADNf,EAAQ,IAAUN,KAAKM,IACAgB,GAAGvB,GACtBsB,IACAf,EAAQA,EAAMiB,IAAItB,IAEtB,IAAIuB,EAAWlB,EAAMmB,IAAIL,GAAYM,WACrC,KAAOF,EAASZ,OAASQ,EAAWR,OAAS,GACzCY,EAAW,IAAMA,EAGrBA,EAAWA,EAASG,MAAM,wBAAwB,GAClD,MAAMC,EAAQtB,EAAMuB,IAAIT,GAAYM,WAUpC,OARIpB,EADsB,IAAtBc,EAAWR,OACHgB,EAGAA,EAAQ,IAAMJ,EAEtBH,IACAf,EAAQ,IAAMA,GAEXA,EAEJ,SAASwB,EAAWxB,EAAOQ,GACd,MAAZA,IACAA,EAAW,GAEf,MAAMM,EAAaP,EAAcC,GACV,iBAAZ,GAAyBR,EAAMqB,MAAM,gBAC5C9B,EAAOqB,mBAAmB,wBAAyB,QAASZ,GAGhE,MAAMe,EAAsC,MAA1Bf,EAAMW,UAAU,EAAG,GACjCI,IACAf,EAAQA,EAAMW,UAAU,IAEd,MAAVX,GACAT,EAAOqB,mBAAmB,gBAAiB,QAASZ,GAGxD,MAAMyB,EAAQzB,EAAM0B,MAAM,KACtBD,EAAMnB,OAAS,GACff,EAAOqB,mBAAmB,0BAA2B,QAASZ,GAElE,IAAIsB,EAAQG,EAAM,GAAIP,EAAWO,EAAM,GAQvC,IAPKH,IACDA,EAAQ,KAEPJ,IACDA,EAAW,KAG0B,MAAlCA,EAASA,EAASZ,OAAS,IAC9BY,EAAWA,EAASP,UAAU,EAAGO,EAASZ,OAAS,GAWvD,IARIY,EAASZ,OAASQ,EAAWR,OAAS,GACtCV,EAAW,wCAAyC,YAAa,cAGpD,KAAbsB,IACAA,EAAW,KAGRA,EAASZ,OAASQ,EAAWR,OAAS,GACzCY,GAAY,IAEhB,MAAMS,EAAa,IAAUjC,KAAK4B,GAC5BM,EAAgB,IAAUlC,KAAKwB,GACrC,IAAIW,EAAOF,EAAWV,IAAIH,GAAagB,IAAIF,GAI3C,OAHIb,IACAc,EAAMA,EAAIZ,IAAItB,IAEXkC,EAEJ,MAAME,EACTC,YAAYC,EAAkBC,EAAQC,EAAO3B,GACrCyB,IAAqBzC,GACrBD,EAAOW,WAAW,2DAA4D,IAAOC,OAAOiC,sBAAuB,CAC/GrC,UAAW,oBAGnBsC,KAAKH,OAASA,EACdG,KAAKF,MAAQA,EACbE,KAAK7B,SAAWA,EAChB6B,KAAKC,MAAQJ,EAAS,GAAK,KAAO,QAAUK,OAAOJ,GAAS,IAAMI,OAAO/B,GACzE6B,KAAKG,YAAcjC,EAAcC,GACjCiC,OAAOC,OAAOL,KAAKA,CAEvBM,YAAY3C,GACR,GAAIA,aAAiB+B,EACjB,OAAO/B,EAEY,iBAAZ,IACPA,EAAQ,YAAYA,GAExB,IAAIkC,KACAC,EAAQ,IACR3B,EAAW,GACf,GAAuB,iBAAZ,EACP,GAAc,UAAVR,QAGC,GAAc,WAAVA,EACLkC,SAEC,CACD,MAAMb,EAAQrB,EAAMqB,MAAM,gCACrBA,GACD9B,EAAOqB,mBAAmB,uBAAwB,SAAUZ,GAEhEkC,EAAuB,MAAbb,EAAM,GAChBc,EAAQS,SAASvB,EAAM,IACvBb,EAAWoC,SAASvB,EAAM,GAAG,MAGhC,GAAIrB,EAAO,CACZ,MAAM6C,EAAQ,CAACC,EAAKC,EAAMC,IACJ,MAAdhD,EAAM8C,GACCE,UAEChD,EAAM8C,KAAUC,GACxBxD,EAAOqB,mBAAmB,yBAA2BkC,EAAM,QAAUC,EAAO,IAAK,UAAYD,EAAK9C,EAAM8C,IAErG9C,EAAM8C,IAEjBZ,EAASW,EAAM,SAAU,UAAWX,GACpCC,EAAQU,EAAM,QAAS,SAAUV,GACjC3B,EAAWqC,EAAM,WAAY,SAAUrC,GAQ3C,OANI2B,EAAQ,GACR5C,EAAOqB,mBAAmB,gDAAiD,eAAgBuB,GAE3F3B,EAAW,IACXjB,EAAOqB,mBAAmB,4CAA6C,kBAAmBJ,GAEvF,IAAIuB,EAAYvC,EAAmB0C,EAAQC,EAAO3B,IAG1D,MAAMyC,EACTjB,YAAYC,EAAkBiB,EAAKlD,EAAOmD,GAClClB,IAAqBzC,GACrBD,EAAOW,WAAW,2DAA4D,IAAOC,OAAOiC,sBAAuB,CAC/GrC,UAAW,oBAGnBsC,KAAKc,OAASA,EACdd,KAAKe,KAAOF,EACZb,KAAKgB,OAASrD,EACdqC,KAAKiB,kBACLb,OAAOC,OAAOL,KAAKA,CAEvBkB,aAAaC,GACLnB,KAAKc,OAAOb,OAASkB,EAAML,OAAOb,MAClC/C,EAAOqB,mBAAmB,gDAAiD,QAAS4C,GAG5FC,UAAUD,GACNnB,KAAKkB,aAAaC,GAClB,MAAME,EAAIlC,EAAWa,KAAKgB,OAAQhB,KAAKc,OAAO3C,UACxCmD,EAAInC,EAAWgC,EAAMH,OAAQG,EAAML,OAAO3C,UAChD,OAAOyC,EAAYW,UAAUF,EAAE5B,IAAI6B,GAAItB,KAAKc,OAAO3C,SAAU6B,KAAKc,OAAOA,CAE7EU,UAAUL,GACNnB,KAAKkB,aAAaC,GAClB,MAAME,EAAIlC,EAAWa,KAAKgB,OAAQhB,KAAKc,OAAO3C,UACxCmD,EAAInC,EAAWgC,EAAMH,OAAQG,EAAML,OAAO3C,UAChD,OAAOyC,EAAYW,UAAUF,EAAEI,IAAIH,GAAItB,KAAKc,OAAO3C,SAAU6B,KAAKc,OAAOA,CAE7EY,UAAUP,GACNnB,KAAKkB,aAAaC,GAClB,MAAME,EAAIlC,EAAWa,KAAKgB,OAAQhB,KAAKc,OAAO3C,UACxCmD,EAAInC,EAAWgC,EAAMH,OAAQG,EAAML,OAAO3C,UAChD,OAAOyC,EAAYW,UAAUF,EAAEzC,IAAI0C,GAAGpC,IAAIc,KAAKc,OAAOX,aAAcH,KAAKc,OAAO3C,SAAU6B,KAAKc,OAAOA,CAE1Ga,UAAUR,GACNnB,KAAKkB,aAAaC,GAClB,MAAME,EAAIlC,EAAWa,KAAKgB,OAAQhB,KAAKc,OAAO3C,UACxCmD,EAAInC,EAAWgC,EAAMH,OAAQG,EAAML,OAAO3C,UAChD,OAAOyC,EAAYW,UAAUF,EAAEzC,IAAIoB,KAAKc,OAAOX,aAAajB,IAAIoC,GAAItB,KAAKc,OAAO3C,SAAU6B,KAAKc,OAAOA,CAE1Gc,QACI,MAAMxC,EAAQY,KAAKjB,WAAWM,MAAM,KACf,IAAjBD,EAAMnB,QACNmB,EAAMyC,KAAK,KAEf,IAAIC,EAASlB,EAAYvD,KAAK+B,EAAM,GAAIY,KAAKc,QAC7C,MAAMiB,GAAe3C,EAAM,GAAGJ,MAAM,UAIpC,OAHIgB,KAAKgC,cAAgBD,IACrBD,EAASA,EAAON,UAAUS,EAAIC,SAASJ,EAAOhB,UAE3CgB,CAACA,CAEZK,UACI,MAAM/C,EAAQY,KAAKjB,WAAWM,MAAM,KACf,IAAjBD,EAAMnB,QACNmB,EAAMyC,KAAK,KAEf,IAAIC,EAASlB,EAAYvD,KAAK+B,EAAM,GAAIY,KAAKc,QAC7C,MAAMiB,GAAe3C,EAAM,GAAGJ,MAAM,UAIpC,OAHKgB,KAAKgC,cAAgBD,IACtBD,EAASA,EAAOV,UAAUa,EAAIC,SAASJ,EAAOhB,UAE3CgB,CAACA,CAGZM,MAAMjE,GACc,MAAZA,IACAA,EAAW,GAGf,MAAMiB,EAAQY,KAAKjB,WAAWM,MAAM,KAOpC,GANqB,IAAjBD,EAAMnB,QACNmB,EAAMyC,KAAK,MAEX1D,EAAW,GAAKA,EAAW,IAAOA,EAAW,IAC7CjB,EAAOqB,mBAAmB,wBAAyB,WAAYJ,GAE/DiB,EAAM,GAAGnB,QAAUE,EACnB,OAAO6B,KAEX,MAAMqC,EAASzB,EAAYvD,KAAK,IAAMW,EAAMM,UAAU,EAAGH,GAAW6B,KAAKc,QACnEwB,EAAOC,EAAKL,SAASlC,KAAKc,QAChC,OAAOd,KAAK0B,UAAUW,GAAQjB,UAAUkB,GAAMV,QAAQD,UAAUU,GAEpEG,SACI,MAAwB,QAAhBxC,KAAKgB,QAAoC,MAAhBhB,KAAKgB,MAAMA,CAEhDgB,aACI,MAA2B,MAAnBhC,KAAKgB,OAAO,EAAE,CAE1BjC,WAAa,OAAOiB,KAAKgB,MAAMA,CAC/ByB,YAAY3C,GACR,GAAa,MAATA,EACA,OAAOE,KAAKe,KAEZjB,EAAQ,GACR5C,EAAOqB,mBAAmB,qBAAsB,QAASuB,GAE7D,MAAMe,EAAM,IAAUxD,KAAK2C,KAAKe,MAAM2B,SAAS1C,KAAKc,OAAOhB,OAAO6C,OAAO7C,GAAO2C,cAChF,OAAO,YAAW5B,EAAKf,EAAQ,EAAE,CAErC8C,gBAAkB,OAAOC,WAAW7C,KAAKjB,WAAWA,CACpDmD,SAASpB,GACL,OAAOF,EAAYkC,WAAW9C,KAAKgB,OAAQF,GAE/CR,iBAAiB3C,EAAOQ,EAAU2C,GAY9B,OAVc,MAAVA,GAA8B,MAAZ3C,GAAqB,YAAeA,KACtD2C,EAAS3C,EACTA,EAAW,MAEC,MAAZA,IACAA,EAAW,GAED,MAAV2C,IACAA,EAAS,SAENF,EAAYkC,WAAWtE,EAAYb,EAAOQ,GAAWuB,EAAYrC,KAAKyD,IAEjFR,kBAAkB3C,EAAOmD,GACP,MAAVA,IACAA,EAAS,SAEb,MAAMiC,EAAcrD,EAAYrC,KAAKyD,GAC/BkC,EAAU7D,EAAWxB,EAAOoF,EAAY5E,WACzC4E,EAAYlD,QAAUmD,EAAQrE,GAAGvB,IAClCG,EAAW,oCAAqC,WAAY,QAASI,GAEzE,IAAIkD,EAAM,KACNkC,EAAYlD,OACZgB,EAAMmC,EAAQL,OAAOI,EAAYjD,OAAO2C,eAGxC5B,EAAMmC,EAAQP,cACd5B,EAAM,YAAWA,EAAKkC,EAAYjD,MAAQ,IAE9C,MAAMmD,EAAUzE,EAAYwE,EAASD,EAAY5E,UACjD,OAAO,IAAIyC,EAAYzD,EAAmB0D,EAAKoC,EAASF,GAE5DzC,iBAAiB3C,EAAOmD,GACN,MAAVA,IACAA,EAAS,SAEb,MAAMiC,EAAcrD,EAAYrC,KAAKyD,GACrC,GAAI,YAASnD,GAAOM,OAAS8E,EAAYjD,MAAQ,EAC7C,MAAM,IAAIoD,MAAM,YAEpB,IAAIF,EAAU,IAAU3F,KAAKM,GACzBoF,EAAYlD,SACZmD,EAAUA,EAAQN,SAASK,EAAYjD,QAE3C,MAAMe,EAAMmC,EAAQL,QAAQI,EAAYlD,OAAS,EAAI,GAAKkD,EAAYjD,OAAO2C,cACvEQ,EAAUzE,EAAYwE,EAASD,EAAY5E,UACjD,OAAO,IAAIyC,EAAYzD,EAAmB0D,EAAKoC,EAASF,GAE5DzC,YAAY3C,EAAOmD,GACf,GAAuB,iBAAZ,EACP,OAAOF,EAAYkC,WAAWnF,EAAOmD,GAEzC,GAAI,OAAAqC,EAAA,GAAQxF,GACR,OAAOiD,EAAYwC,UAAUzF,EAAOmD,GAExC,IACI,OAAOF,EAAYW,UAAU5D,EAAO,EAAGmD,GAE3C,MAAOuC,GAEH,GAAIA,EAAMC,OAAS,IAAOxF,OAAOyF,iBAC7B,MAAMF,CAACA,CAGf,OAAOnG,EAAOqB,mBAAmB,4BAA6B,QAASZ,GAE3E2C,qBAAqB3C,GACjB,SAAUA,IAASA,EAAMsD,eAAeA,EAGhD,MAAMgB,EAAMrB,EAAYvD,KAAK,GACvBkF,EAAO3B,EAAYvD,KAAK,MAAM,E,kCCvWpCgB,EAAA,gCAAO,MAAMmF,EAAW,oEAAoE,E,okBCArF,MCGDtG,EAAS,I,UAAI,GDHI,eCKvB,SAASuG,EAAU9F,GACf,QAAUA,EAAiB,YAE/B,SAAS+F,EAASC,GACd,OAAIA,EAAMC,QAGVD,EAAMC,MAAQ,WACV,MAAMC,EAAOC,MAAMC,UAAUH,MAAMI,KAAKC,WACxC,OAAOP,EAAS,IAAIQ,WAAWJ,MAAMC,UAAUH,MAAMO,MAAMR,EAAOE,OAJ3DF,EAQR,SAASS,EAAYzG,GACxB,OAAS0G,EAAY1G,MAAYA,EAAMM,OAAS,IAAOqG,EAAQ3G,GAEnE,SAAS4G,EAAU5G,GACf,MAA2B,iBAAZ,GAAwBA,GAASA,GAAUA,EAAQ,GAAO,CAAC,CAEvE,SAAS2G,EAAQ3G,GACpB,GAAa,MAATA,EACA,OAAM,EAEV,GAAIA,EAAMgC,cAAgBuE,WACtB,OAAM,EAEV,GAAuB,iBAAZ,EACP,OAAM,EAEV,IAAKK,EAAU5G,EAAMM,SAAWN,EAAMM,OAAS,EAC3C,OAAM,EAEV,IAAK,IAAIkF,EAAI,EAAGA,EAAIxF,EAAMM,OAAQkF,IAAK,CACnC,MAAMqB,EAAI7G,EAAMwF,GAChB,IAAKoB,EAAUC,IAAMA,EAAI,GAAKA,GAAK,IAC/B,OAAM,CAAC,CAGf,OAAM,CAAC,CAEJ,SAASC,EAAS9G,EAAO+G,GAI5B,GAHKA,IACDA,EAAU,CAAC,GAEQ,iBAAZ,EAAsB,CAC7BxH,EAAOyH,gBAAgBhH,EAAO,0BAC9B,MAAMmE,EAAS,GACf,KAAOnE,GACHmE,EAAO8C,QAAgB,IAARjH,GACfA,EAAQ4C,SAASL,OAAOvC,EAAQ,MAKpC,OAHsB,IAAlBmE,EAAO7D,QACP6D,EAAOD,KAAK,GAET6B,EAAS,IAAIQ,WAAWpC,IAQnC,GANI4C,EAAQG,oBAAyC,iBAAZ,GAAkD,OAA1BlH,EAAMW,UAAU,EAAG,KAChFX,EAAQ,KAAOA,GAEf8F,EAAU9F,KACVA,EAAQA,EAAM8E,eAEd4B,EAAY1G,GAAQ,CACpB,IAAIkD,EAAMlD,EAAMW,UAAU,GACtBuC,EAAI5C,OAAS,IACU,SAAnByG,EAAQI,OACRjE,EAAM,IAAMA,EAEY,UAAnB6D,EAAQI,OACbjE,GAAO,IAGP3D,EAAOqB,mBAAmB,yBAA0B,QAASZ,IAGrE,MAAMmE,EAAS,GACf,IAAK,IAAIqB,EAAI,EAAGA,EAAItC,EAAI5C,OAAQkF,GAAK,EACjCrB,EAAOD,KAAKtB,SAASM,EAAIvC,UAAU6E,EAAGA,EAAI,GAAI,KAElD,OAAOO,EAAS,IAAIQ,WAAWpC,IAEnC,OAAIwC,EAAQ3G,GACD+F,EAAS,IAAIQ,WAAWvG,IAE5BT,EAAOqB,mBAAmB,yBAA0B,QAASZ,GAEjE,SAASoH,EAAOC,GACnB,MAAMC,EAAUD,EAAME,KAAIC,GAAQV,EAASU,KACrClH,EAASgH,EAAQG,QAAO,CAACC,EAAOF,IAAUE,EAAQF,EAAKlH,QAAS,GAChE6D,EAAS,IAAIoC,WAAWjG,GAK9B,OAJAgH,EAAQG,QAAO,CAACE,EAAQC,KACpBzD,EAAO0D,IAAID,EAAQD,GACZA,EAASC,EAAOtH,SACxB,GACIyF,EAAS5B,GAEb,SAAS2D,EAAW9H,GACvB,IAAImE,EAAS2C,EAAS9G,GACtB,GAAsB,IAAlBmE,EAAO7D,OACP,OAAO6D,EAGX,IAAI4D,EAAQ,EACZ,KAAOA,EAAQ5D,EAAO7D,QAA4B,IAAlB6D,EAAO4D,IACnCA,IAMJ,OAHIA,IACA5D,EAASA,EAAO8B,MAAM8B,IAEnB5D,CAACA,CAEL,SAAS6D,EAAQhI,EAAOM,IAC3BN,EAAQ8G,EAAS9G,IACPM,OAASA,GACff,EAAOqB,mBAAmB,qBAAsB,QAAS0F,UAAU,IAEvE,MAAMnC,EAAS,IAAIoC,WAAWjG,GAE9B,OADA6D,EAAO0D,IAAI7H,EAAOM,EAASN,EAAMM,QAC1ByF,EAAS5B,GAEb,SAASuC,EAAY1G,EAAOM,GAC/B,QAAuB,iBAAZ,IAAyBN,EAAMqB,MAAM,qBAG5Cf,GAAUN,EAAMM,SAAW,EAAI,EAAIA,GAK3C,MAAM2H,EAAgB,mBACf,SAASC,EAAQlI,EAAO+G,GAI3B,GAHKA,IACDA,EAAU,CAAC,GAEQ,iBAAZ,EAAsB,CAC7BxH,EAAOyH,gBAAgBhH,EAAO,yBAC9B,IAAIkD,EAAM,GACV,KAAOlD,GACHkD,EAAM+E,EAAsB,GAARjI,GAAekD,EACnClD,EAAQmI,KAAKlE,MAAMjE,EAAQ,IAE/B,OAAIkD,EAAI5C,QACA4C,EAAI5C,OAAS,IACb4C,EAAM,IAAMA,GAET,KAAOA,GAEX,MAAM,CAEjB,GAAuB,iBAAZ,EAEP,OADAlD,EAAQA,EAAMoB,SAAS,KACbd,OAAS,EACP,MAAQN,EAEb,KAAOA,EAKlB,GAHI+G,EAAQG,oBAAyC,iBAAZ,GAAkD,OAA1BlH,EAAMW,UAAU,EAAG,KAChFX,EAAQ,KAAOA,GAEf8F,EAAU9F,GACV,OAAOA,EAAM8E,cAEjB,GAAI4B,EAAY1G,GAYZ,OAXIA,EAAMM,OAAS,IACQ,SAAnByG,EAAQI,OACRnH,EAAQ,MAAQA,EAAMW,UAAU,GAER,UAAnBoG,EAAQI,OACbnH,GAAS,IAGTT,EAAOqB,mBAAmB,yBAA0B,QAASZ,IAG9DA,EAAMoI,cAEjB,GAAIzB,EAAQ3G,GAAQ,CAChB,IAAImE,EAAS,KACb,IAAK,IAAIqB,EAAI,EAAGA,EAAIxF,EAAMM,OAAQkF,IAAK,CACnC,IAAIqB,EAAI7G,EAAMwF,GACdrB,GAAU8D,GAAmB,IAAJpB,IAAa,GAAKoB,EAAkB,GAAJpB,GAE7D,OAAO1C,CAACA,CAEZ,OAAO5E,EAAOqB,mBAAmB,wBAAyB,QAASZ,GAUhE,SAASqI,EAAcC,GAC1B,GAAsB,iBAAX,EACPA,EAAOJ,EAAQI,QAEd,IAAK5B,EAAY4B,IAAUA,EAAKhI,OAAS,EAC1C,OAAO,KAEX,OAAQgI,EAAKhI,OAAS,GAAK,CAAC,CAEzB,SAASiI,EAAaD,EAAMX,EAAQa,GAQvC,MAPsB,iBAAX,EACPF,EAAOJ,EAAQI,KAET5B,EAAY4B,IAAUA,EAAKhI,OAAS,IAC1Cf,EAAOqB,mBAAmB,kBAAmB,QAAS0H,GAE1DX,EAAS,EAAI,EAAIA,EACA,MAAba,EACO,KAAOF,EAAK3H,UAAUgH,EAAQ,EAAI,EAAIa,GAE1C,KAAOF,EAAK3H,UAAUgH,GAE1B,SAASc,EAAUpB,GACtB,IAAIlD,EAAS,KAIb,OAHAkD,EAAMqB,SAASlB,IACXrD,GAAU+D,EAAQV,GAAM7G,UAAU,EAAC,IAEhCwD,CAACA,CAEL,SAASwE,EAAS3I,GACrB,MAAM4I,EAAUC,EAAcX,EAAQlI,EAAO,CAAEmH,OAAQ,UACvD,MAAgB,OAAZyB,EACO,MAEJA,EAEJ,SAASC,EAAc7I,GACH,iBAAZ,IACPA,EAAQkI,EAAQlI,IAEf0G,EAAY1G,IACbT,EAAOqB,mBAAmB,qBAAsB,QAASZ,GAE7DA,EAAQA,EAAMW,UAAU,GACxB,IAAIgH,EAAS,EACb,KAAOA,EAAS3H,EAAMM,QAA4B,MAAlBN,EAAM2H,IAClCA,IAEJ,MAAO,KAAO3H,EAAMW,UAAUgH,GAE3B,SAASmB,EAAW9I,EAAOM,GAU9B,IATuB,iBAAZ,EACPN,EAAQkI,EAAQlI,GAEV0G,EAAY1G,IAClBT,EAAOqB,mBAAmB,qBAAsB,QAASZ,GAEzDA,EAAMM,OAAS,EAAIA,EAAS,GAC5Bf,EAAOqB,mBAAmB,qBAAsB,QAAS0F,UAAU,IAEhEtG,EAAMM,OAAS,EAAIA,EAAS,GAC/BN,EAAQ,MAAQA,EAAMW,UAAU,GAEpC,OAAOX,EAEJ,SAAS+I,EAAeC,GAC3B,MAAM7E,EAAS,CACX8E,EAAG,KACHC,EAAG,KACHC,IAAK,KACLC,cAAe,EACfvC,EAAG,EACHwC,YAAa,KACbC,QAAS,MAEb,GAAI7C,EAAYuC,GAAY,CACxB,IAAIO,EAAQzC,EAASkC,GAEA,KAAjBO,EAAMjJ,QAEN6D,EAAO0C,EAAI,IAAM0C,EAAM,KAAO,GAC9BA,EAAM,KAAO,IACbpF,EAAO8E,EAAIf,EAAQqB,EAAMtD,MAAM,EAAG,KAClC9B,EAAO+E,EAAIhB,EAAQqB,EAAMtD,MAAM,GAAI,MAEb,KAAjBsD,EAAMjJ,QACX6D,EAAO8E,EAAIf,EAAQqB,EAAMtD,MAAM,EAAG,KAClC9B,EAAO+E,EAAIhB,EAAQqB,EAAMtD,MAAM,GAAI,KACnC9B,EAAO0C,EAAI0C,EAAM,KAGjBhK,EAAOqB,mBAAmB,2BAA4B,YAAaoI,GAGnE7E,EAAO0C,EAAI,KACM,IAAb1C,EAAO0C,GAAwB,IAAb1C,EAAO0C,EACzB1C,EAAO0C,GAAK,GAGZtH,EAAOqB,mBAAmB,2BAA4B,YAAaoI,IAI3E7E,EAAOiF,cAAgB,EAAKjF,EAAO0C,EAAI,EAEnC1C,EAAOiF,gBACPG,EAAM,KAAO,KAEjBpF,EAAOgF,IAAMjB,EAAQqB,EAAMtD,MAAM,GAAI,IAAI,KAExC,CAQD,GAPA9B,EAAO8E,EAAID,EAAUC,EACrB9E,EAAO+E,EAAIF,EAAUE,EACrB/E,EAAO0C,EAAImC,EAAUnC,EACrB1C,EAAOiF,cAAgBJ,EAAUI,cACjCjF,EAAOgF,IAAMH,EAAUG,IAGL,MAAdhF,EAAOgF,IAAa,CACpB,MAAMK,EAAKxB,EAAQlB,EAAS3C,EAAOgF,KAAM,IACzChF,EAAOgF,IAAMjB,EAAQsB,GAErB,MAAMJ,EAAkBI,EAAG,IAAM,IAAO,EAAI,EAChB,MAAxBrF,EAAOiF,cACPjF,EAAOiF,cAAgBA,EAElBjF,EAAOiF,gBAAkBA,GAC9B7J,EAAOqB,mBAAmB,uCAAwC,YAAaoI,GAGnFQ,EAAG,IAAM,IACT,MAAMN,EAAIhB,EAAQsB,GACF,MAAZrF,EAAO+E,EACP/E,EAAO+E,EAAIA,EAEN/E,EAAO+E,IAAMA,GAClB3J,EAAOqB,mBAAmB,2BAA4B,YAAaoI,GAI3E,GAA4B,MAAxB7E,EAAOiF,cACS,MAAZjF,EAAO0C,EACPtH,EAAOqB,mBAAmB,wCAAyC,YAAaoI,GAE9D,IAAb7E,EAAO0C,GAAwB,IAAb1C,EAAO0C,EAC9B1C,EAAOiF,cAAgBjF,EAAO0C,EAG9B1C,EAAOiF,cAAgB,EAAKjF,EAAO0C,EAAI,OAI3C,GAAgB,MAAZ1C,EAAO0C,EACP1C,EAAO0C,EAAI,GAAK1C,EAAOiF,kBAEtB,CACD,MAAMK,EAAsB,IAAbtF,EAAO0C,GAAwB,IAAb1C,EAAO0C,EAAW1C,EAAO0C,EAAK,EAAK1C,EAAO0C,EAAI,EAC3E1C,EAAOiF,gBAAkBK,GACzBlK,EAAOqB,mBAAmB,qCAAsC,YAAaoI,GAIzE,MAAZ7E,EAAO8E,GAAcvC,EAAYvC,EAAO8E,GAIxC9E,EAAO8E,EAAIH,EAAW3E,EAAO8E,EAAG,IAHhC1J,EAAOqB,mBAAmB,iCAAkC,YAAaoI,GAK7D,MAAZ7E,EAAO+E,GAAcxC,EAAYvC,EAAO+E,GAIxC/E,EAAO+E,EAAIJ,EAAW3E,EAAO+E,EAAG,IAHhC3J,EAAOqB,mBAAmB,iCAAkC,YAAaoI,GAK7E,MAAMQ,EAAK1C,EAAS3C,EAAO+E,GACvBM,EAAG,IAAM,KACTjK,EAAOqB,mBAAmB,2BAA4B,YAAaoI,GAEnE7E,EAAOiF,gBACPI,EAAG,IAAM,KAEb,MAAML,EAAMjB,EAAQsB,GAChBrF,EAAOgF,MACFzC,EAAYvC,EAAOgF,MACpB5J,EAAOqB,mBAAmB,wBAAyB,YAAaoI,GAEpE7E,EAAOgF,IAAML,EAAW3E,EAAOgF,IAAK,KAGtB,MAAdhF,EAAOgF,IACPhF,EAAOgF,IAAMA,EAERhF,EAAOgF,MAAQA,GACpB5J,EAAOqB,mBAAmB,iCAAkC,YAAaoI,GAKjF,OAFA7E,EAAOkF,YAAclF,EAAOgF,IAC5BhF,EAAOmF,QAAUnF,EAAO8E,EAAI9E,EAAOkF,YAAY1I,UAAU,GAClDwD,CAACA,CAEL,SAASuF,EAAcV,GAE1B,OAAOd,EAAQd,EAAO,EADtB4B,EAAYD,EAAeC,IAEbC,EACVD,EAAUE,EACTF,EAAUI,cAAgB,OAAS,Y,oCCrZ5C,oRAAA5D,EAAA,UACA,MAAM7F,EAA6B,IAAUD,MAAM,GAC7CD,EAAsB,IAAUC,KAAK,GACrCiK,EAAqB,IAAUjK,KAAK,GACpCkK,EAAqB,IAAUlK,KAAK,GACpCmK,EAA6B,IAAUnK,KAAK,uBAC5CoK,EAA4B,IAAUpK,KAAK,sEAC3CqK,EAA2B,IAAUrK,KAAK,uEAC1CsK,EAA2B,IAAUtK,KAAK,qEAAqE,E,kCCRrHgB,EAAA,gCAAO,MAAMuJ,EAAU,iBAAiB,E,0iBCCjC,MAAMC,EAAc,K,+BCD3B,kBACE,aAGA,SAASC,EAAQC,EAAKC,GACpB,IAAKD,EAAK,MAAM,IAAI7E,MAAM8E,GAAO,oBAKnC,SAASC,EAAUC,EAAMC,GACvBD,EAAKE,OAASD,EACd,IAAIE,EAAW,aACfA,EAAStE,UAAYoE,EAAUpE,UAC/BmE,EAAKnE,UAAY,IAAIsE,EACrBH,EAAKnE,UAAUpE,YAAcuI,EAK/B,SAASI,EAAIC,EAAQC,EAAMC,GACzB,GAAIH,EAAGI,KAAKH,GACV,OAAOA,EAGTvI,KAAKtB,SAAW,EAChBsB,KAAK2I,MAAQ,KACb3I,KAAK/B,OAAS,EAGd+B,KAAK4I,IAAM,KAEI,OAAXL,IACW,OAATC,GAA0B,OAATA,IACnBC,EAASD,EACTA,EAAO,IAGTxI,KAAK6I,MAAMN,GAAU,EAAGC,GAAQ,GAAIC,GAAU,OAYlD,IAAIK,EATkB,iBAAXC,EACTA,EAAOC,QAAUV,EAEjBU,EAAQV,GAAKA,EAGfA,EAAGA,GAAKA,EACRA,EAAGW,SAAW,GAGd,IAEIH,EADoB,oBAAXI,aAAmD,IAAlBA,OAAOJ,OACxCI,OAAOJ,OAEP,EAAQ,GAAUA,MAAMA,CAEnC,MAAOzK,IAgIT,SAAS8K,EAAeC,EAAQC,GAC9B,IAAIC,EAAIF,EAAOG,WAAWF,GAE1B,OAAIC,GAAK,IAAMA,GAAK,GACXA,EAAI,GAEFA,GAAK,IAAMA,GAAK,GAClBA,EAAI,GAEFA,GAAK,IAAMA,GAAK,IAClBA,EAAI,QAEXxB,KAAc,wBAA0BsB,GAI5C,SAASI,EAAcJ,EAAQK,EAAYJ,GACzC,IAAIzC,EAAIuC,EAAcC,EAAQC,GAI9B,OAHIA,EAAQ,GAAKI,IACf7C,GAAKuC,EAAcC,EAAQC,EAAQ,IAAM,GAEpCzC,EA8CT,SAAS8C,EAAWC,EAAKjE,EAAOkE,EAAKhL,GAInC,IAHA,IAAIgI,EAAI,EACJtF,EAAI,EACJuI,EAAM/D,KAAKgE,IAAIH,EAAI1L,OAAQ2L,GACtBzG,EAAIuC,EAAOvC,EAAI0G,EAAK1G,IAAK,CAChC,IAAImG,EAAIK,EAAIJ,WAAWpG,GAAK,GAE5ByD,GAAKhI,EAIH0C,EADEgI,GAAK,GACHA,EAAI,GAAK,GAGJA,GAAK,GACVA,EAAI,GAAK,GAITA,EAENxB,EAAOwB,GAAK,GAAKhI,EAAI1C,EAAK,qBAC1BgI,GAAKtF,EAEP,OAAOsF,EA4DT,SAASmD,EAAMC,EAAMC,GACnBD,EAAKrB,MAAQsB,EAAItB,MACjBqB,EAAK/L,OAASgM,EAAIhM,OAClB+L,EAAKtL,SAAWuL,EAAIvL,SACpBsL,EAAKpB,IAAMqB,EAAIrB,GAAGA,CAsCpB,GA9TAN,EAAGI,KAAO,SAAewB,GACvB,OAAIA,aAAe5B,GAIJ,OAAR4B,GAA+B,iBAARA,GAC5BA,EAAIvK,YAAYsJ,WAAaX,EAAGW,UAAYnF,MAAMqG,QAAQD,EAAIvB,MAAMA,EAGxEL,EAAG8B,IAAM,SAAcC,EAAMC,GAC3B,OAAID,EAAKE,IAAID,GAAS,EAAUD,EACzBC,CAACA,EAGVhC,EAAGwB,IAAM,SAAcO,EAAMC,GAC3B,OAAID,EAAKE,IAAID,GAAS,EAAUD,EACzBC,CAACA,EAGVhC,EAAGvE,UAAU8E,MAAQ,SAAeN,EAAQC,EAAMC,GAChD,GAAsB,iBAAXF,EACT,OAAOvI,KAAKwK,YAAYjC,EAAQC,EAAMC,GAGxC,GAAsB,iBAAXF,EACT,OAAOvI,KAAKyK,WAAWlC,EAAQC,EAAMC,GAG1B,QAATD,IACFA,EAAO,IAETV,EAAOU,KAAiB,EAAPA,IAAaA,GAAQ,GAAKA,GAAQ,IAGnD,IAAI9C,EAAQ,EACM,OAFlB6C,EAASA,EAAOxJ,WAAW2L,QAAQ,OAAQ,KAEhC,KACThF,IACA1F,KAAKtB,SAAW,GAGdgH,EAAQ6C,EAAOtK,SACJ,KAATuK,EACFxI,KAAK2K,UAAUpC,EAAQ7C,EAAO+C,IAE9BzI,KAAK4K,WAAWrC,EAAQC,EAAM9C,GACf,OAAX+C,GACFzI,KAAKyK,WAAWzK,KAAK6K,UAAWrC,EAAMC,MAM9CH,EAAGvE,UAAUyG,YAAc,SAAsBjC,EAAQC,EAAMC,GACzDF,EAAS,IACXvI,KAAKtB,SAAW,EAChB6J,GAAUA,GAERA,EAAS,UACXvI,KAAK2I,MAAQ,CAAU,SAATJ,GACdvI,KAAK/B,OAAS,GACLsK,EAAS,kBAClBvI,KAAK2I,MAAQ,CACF,SAATJ,EACCA,EAAS,SAAa,UAEzBvI,KAAK/B,OAAS,IAEd6J,EAAOS,EAAS,kBAChBvI,KAAK2I,MAAQ,CACF,SAATJ,EACCA,EAAS,SAAa,SACvB,GAEFvI,KAAK/B,OAAS,GAGD,OAAXwK,GAGJzI,KAAKyK,WAAWzK,KAAK6K,UAAWrC,EAAMC,IAGxCH,EAAGvE,UAAU0G,WAAa,SAAqBlC,EAAQC,EAAMC,GAG3D,GADAX,EAAgC,iBAAlBS,EAAOtK,QACjBsK,EAAOtK,QAAU,EAGnB,OAFA+B,KAAK2I,MAAQ,CAAC,GACd3I,KAAK/B,OAAS,EACP+B,KAGTA,KAAK/B,OAAS6H,KAAKgF,KAAKvC,EAAOtK,OAAS,GACxC+B,KAAK2I,MAAQ,IAAI7E,MAAM9D,KAAK/B,QAC5B,IAAK,IAAIkF,EAAI,EAAGA,EAAInD,KAAK/B,OAAQkF,IAC/BnD,KAAK2I,MAAMxF,GAAK,EAGlB,IAAI4H,EAAGC,EACHC,EAAM,EACV,GAAe,OAAXxC,EACF,IAAKtF,EAAIoF,EAAOtK,OAAS,EAAG8M,EAAI,EAAG5H,GAAK,EAAGA,GAAK,EAC9C6H,EAAIzC,EAAOpF,GAAMoF,EAAOpF,EAAI,IAAM,EAAMoF,EAAOpF,EAAI,IAAM,GACzDnD,KAAK2I,MAAMoC,IAAOC,GAAKC,EAAO,SAC9BjL,KAAK2I,MAAMoC,EAAI,GAAMC,IAAO,GAAKC,EAAQ,UACzCA,GAAO,KACI,KACTA,GAAO,GACPF,UAGC,GAAe,OAAXtC,EACT,IAAKtF,EAAI,EAAG4H,EAAI,EAAG5H,EAAIoF,EAAOtK,OAAQkF,GAAK,EACzC6H,EAAIzC,EAAOpF,GAAMoF,EAAOpF,EAAI,IAAM,EAAMoF,EAAOpF,EAAI,IAAM,GACzDnD,KAAK2I,MAAMoC,IAAOC,GAAKC,EAAO,SAC9BjL,KAAK2I,MAAMoC,EAAI,GAAMC,IAAO,GAAKC,EAAQ,UACzCA,GAAO,KACI,KACTA,GAAO,GACPF,KAIN,OAAO/K,KAAKkL,QAAQA,EA2BtB5C,EAAGvE,UAAU4G,UAAY,SAAoBpC,EAAQ7C,EAAO+C,GAE1DzI,KAAK/B,OAAS6H,KAAKgF,MAAMvC,EAAOtK,OAASyH,GAAS,GAClD1F,KAAK2I,MAAQ,IAAI7E,MAAM9D,KAAK/B,QAC5B,IAAK,IAAIkF,EAAI,EAAGA,EAAInD,KAAK/B,OAAQkF,IAC/BnD,KAAK2I,MAAMxF,GAAK,EAIlB,IAGI6H,EAHAC,EAAM,EACNF,EAAI,EAGR,GAAe,OAAXtC,EACF,IAAKtF,EAAIoF,EAAOtK,OAAS,EAAGkF,GAAKuC,EAAOvC,GAAK,EAC3C6H,EAAIxB,EAAajB,EAAQ7C,EAAOvC,IAAM8H,EACtCjL,KAAK2I,MAAMoC,IAAU,SAAJC,EACbC,GAAO,IACTA,GAAO,GACPF,GAAK,EACL/K,KAAK2I,MAAMoC,IAAMC,IAAM,IAEvBC,GAAO,OAKX,IAAK9H,GADaoF,EAAOtK,OAASyH,GACX,GAAM,EAAIA,EAAQ,EAAIA,EAAOvC,EAAIoF,EAAOtK,OAAQkF,GAAK,EAC1E6H,EAAIxB,EAAajB,EAAQ7C,EAAOvC,IAAM8H,EACtCjL,KAAK2I,MAAMoC,IAAU,SAAJC,EACbC,GAAO,IACTA,GAAO,GACPF,GAAK,EACL/K,KAAK2I,MAAMoC,IAAMC,IAAM,IAEvBC,GAAO,EAKbjL,KAAKkL,QAAQA,EA8Bf5C,EAAGvE,UAAU6G,WAAa,SAAqBrC,EAAQC,EAAM9C,GAE3D1F,KAAK2I,MAAQ,CAAC,GACd3I,KAAK/B,OAAS,EAGd,IAAK,IAAIkN,EAAU,EAAGC,EAAU,EAAGA,GAAW,SAAWA,GAAW5C,EAClE2C,IAEFA,IACAC,EAAWA,EAAU5C,EAAQ,EAO7B,IALA,IAAI6C,EAAQ9C,EAAOtK,OAASyH,EACxB5G,EAAMuM,EAAQF,EACdvB,EAAM9D,KAAKgE,IAAIuB,EAAOA,EAAQvM,GAAO4G,EAErC4F,EAAO,EACFnI,EAAIuC,EAAOvC,EAAIyG,EAAKzG,GAAKgI,EAChCG,EAAO5B,EAAUnB,EAAQpF,EAAGA,EAAIgI,EAAS3C,GAEzCxI,KAAKuL,MAAMH,GACPpL,KAAK2I,MAAM,GAAK2C,EAAO,SACzBtL,KAAK2I,MAAM,IAAM2C,EAEjBtL,KAAKwL,OAAOF,GAIhB,GAAY,IAARxM,EAAW,CACb,IAAI2M,EAAM,EAGV,IAFAH,EAAO5B,EAAUnB,EAAQpF,EAAGoF,EAAOtK,OAAQuK,GAEtCrF,EAAI,EAAGA,EAAIrE,EAAKqE,IACnBsI,GAAOjD,EAGTxI,KAAKuL,MAAME,GACPzL,KAAK2I,MAAM,GAAK2C,EAAO,SACzBtL,KAAK2I,MAAM,IAAM2C,EAEjBtL,KAAKwL,OAAOF,GAIhBtL,KAAKkL,QAAQA,EAGf5C,EAAGvE,UAAU2H,KAAO,SAAe1B,GACjCA,EAAKrB,MAAQ,IAAI7E,MAAM9D,KAAK/B,QAC5B,IAAK,IAAIkF,EAAI,EAAGA,EAAInD,KAAK/B,OAAQkF,IAC/B6G,EAAKrB,MAAMxF,GAAKnD,KAAK2I,MAAMxF,GAE7B6G,EAAK/L,OAAS+B,KAAK/B,OACnB+L,EAAKtL,SAAWsB,KAAKtB,SACrBsL,EAAKpB,IAAM5I,KAAK4I,GAAGA,EAUrBN,EAAGvE,UAAU4H,MAAQ,SAAgB3B,GACnCD,EAAKC,EAAMhK,KAAKA,EAGlBsI,EAAGvE,UAAU6H,MAAQ,WACnB,IAAIhF,EAAI,IAAI0B,EAAG,MAEf,OADAtI,KAAK0L,KAAK9E,GACHA,GAGT0B,EAAGvE,UAAU8H,QAAU,SAAkBC,GACvC,KAAO9L,KAAK/B,OAAS6N,GACnB9L,KAAK2I,MAAM3I,KAAK/B,UAAY,EAE9B,OAAO+B,IAAIA,EAIbsI,EAAGvE,UAAUmH,OAAS,WACpB,KAAOlL,KAAK/B,OAAS,GAAqC,IAAhC+B,KAAK2I,MAAM3I,KAAK/B,OAAS,IACjD+B,KAAK/B,SAEP,OAAO+B,KAAK+L,WAAWA,EAGzBzD,EAAGvE,UAAUgI,UAAY,WAKvB,OAHoB,IAAhB/L,KAAK/B,QAAkC,IAAlB+B,KAAK2I,MAAM,KAClC3I,KAAKtB,SAAW,GAEXsB,IAAIA,EAKS,oBAAXgM,QAAgD,mBAAfA,OAAOC,IACjD,IACE3D,EAAGvE,UAAUiI,OAAOC,IAAI,+BAAiCC,EACzD,MAAO7N,GACPiK,EAAGvE,UAAUmI,QAAUA,OAGzB5D,EAAGvE,UAAUmI,QAAUA,EAGzB,SAASA,IACP,OAAQlM,KAAK4I,IAAM,UAAY,SAAW5I,KAAKjB,SAAS,IAAM,IAiChE,IAAIf,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,6BAGEmO,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,UAG9D9D,EAAGvE,UAAUhF,SAAW,SAAmByJ,EAAM6D,GAI/C,IAAIC,EACJ,GAHAD,EAAoB,EAAVA,GAAe,EAGZ,MAJb7D,EAAOA,GAAQ,KAIa,QAATA,EAAgB,CACjC8D,EAAM,GAGN,IAFA,IAAIrB,EAAM,EACNsB,EAAQ,EACHpJ,EAAI,EAAGA,EAAInD,KAAK/B,OAAQkF,IAAK,CACpC,IAAI6H,EAAIhL,KAAK2I,MAAMxF,GACfmI,GAA+B,UAArBN,GAAKC,EAAOsB,IAAmBxN,SAAS,IACtDwN,EAASvB,IAAO,GAAKC,EAAQ,UAC7BA,GAAO,IACI,KACTA,GAAO,GACP9H,KAGAmJ,EADY,IAAVC,GAAepJ,IAAMnD,KAAK/B,OAAS,EAC/BD,EAAM,EAAIsN,EAAKrN,QAAUqN,EAAOgB,EAEhChB,EAAOgB,EAMjB,IAHc,IAAVC,IACFD,EAAMC,EAAMxN,SAAS,IAAMuN,GAEtBA,EAAIrO,OAASoO,GAAY,GAC9BC,EAAM,IAAMA,EAKd,OAHsB,IAAlBtM,KAAKtB,WACP4N,EAAM,IAAMA,GAEPA,EAGT,GAAI9D,KAAiB,EAAPA,IAAaA,GAAQ,GAAKA,GAAQ,GAAI,CAElD,IAAIgE,EAAYL,EAAW3D,GAEvBiE,EAAYL,EAAW5D,GAC3B8D,EAAM,GACN,IAAIhD,EAAItJ,KAAK4L,QAEb,IADAtC,EAAE5K,SAAW,GACL4K,EAAE9G,UAAU,CAClB,IAAIoE,EAAI0C,EAAEoD,MAAMD,GAAW1N,SAASyJ,GAMlC8D,GALFhD,EAAIA,EAAEqD,MAAMF,IAELjK,SAGCoE,EAAI0F,EAFJtO,EAAMwO,EAAY5F,EAAE3I,QAAU2I,EAAI0F,EAQ5C,IAHItM,KAAKwC,WACP8J,EAAM,IAAMA,GAEPA,EAAIrO,OAASoO,GAAY,GAC9BC,EAAM,IAAMA,EAKd,OAHsB,IAAlBtM,KAAKtB,WACP4N,EAAM,IAAMA,GAEPA,EAGTxE,KAAc,oCAGhBQ,EAAGvE,UAAU3F,SAAW,WACtB,IAAIwO,EAAM5M,KAAK2I,MAAM,GASrB,OARoB,IAAhB3I,KAAK/B,OACP2O,GAAuB,SAAhB5M,KAAK2I,MAAM,GACO,IAAhB3I,KAAK/B,QAAkC,IAAlB+B,KAAK2I,MAAM,GAEzCiE,GAAO,iBAAoC,SAAhB5M,KAAK2I,MAAM,GAC7B3I,KAAK/B,OAAS,GACvB6J,KAAc,8CAEU,IAAlB9H,KAAKtB,UAAmBkO,EAAMA,GAGxCtE,EAAGvE,UAAU8I,OAAS,WACpB,OAAO7M,KAAKjB,SAAS,GAAI,EAAE,EAGzB+J,IACFR,EAAGvE,UAAU+I,SAAW,SAAmBrE,EAAQxK,GACjD,OAAO+B,KAAK+M,YAAYjE,EAAQL,EAAQxK,KAI5CqK,EAAGvE,UAAU8G,QAAU,SAAkBpC,EAAQxK,GAC/C,OAAO+B,KAAK+M,YAAYjJ,MAAO2E,EAAQxK,IA4gBzC,SAAS+O,EAAYC,EAAM/C,EAAKoC,GAC9BA,EAAI5N,SAAWwL,EAAIxL,SAAWuO,EAAKvO,SACnC,IAAImL,EAAOoD,EAAKhP,OAASiM,EAAIjM,OAAU,EACvCqO,EAAIrO,OAAS4L,EACbA,EAAOA,EAAM,EAAK,EAGlB,IAAIxI,EAAoB,EAAhB4L,EAAKtE,MAAM,GACfrH,EAAmB,EAAf4I,EAAIvB,MAAM,GACd/B,EAAIvF,EAAIC,EAER4L,EAAS,SAAJtG,EACL2F,EAAS3F,EAAI,SAAa,EAC9B0F,EAAI3D,MAAM,GAAKuE,EAEf,IAAK,IAAIC,EAAI,EAAGA,EAAItD,EAAKsD,IAAK,CAM5B,IAHA,IAAIC,EAASb,IAAU,GACnBc,EAAgB,SAARd,EACRe,EAAOxH,KAAKgE,IAAIqD,EAAGjD,EAAIjM,OAAS,GAC3B8M,EAAIjF,KAAKsE,IAAI,EAAG+C,EAAIF,EAAKhP,OAAS,GAAI8M,GAAKuC,EAAMvC,IAAK,CAC7D,IAAI5H,EAAKgK,EAAIpC,EAAK,EAIlBqC,IADAxG,GAFAvF,EAAoB,EAAhB4L,EAAKtE,MAAMxF,KACf7B,EAAmB,EAAf4I,EAAIvB,MAAMoC,IACFsC,GACG,SAAa,EAC5BA,EAAY,SAAJzG,EAEV0F,EAAI3D,MAAMwE,GAAa,EAARE,EACfd,EAAiB,EAATa,EAQV,OANc,IAAVb,EACFD,EAAI3D,MAAMwE,GAAa,EAARZ,EAEfD,EAAIrO,SAGCqO,EAAIpB,QAAQA,CAxiBrB5C,EAAGvE,UAAUgJ,YAAc,SAAsBQ,EAAW9E,EAAQxK,GAClE+B,KAAKkL,SAEL,IAAIsC,EAAaxN,KAAKwN,aAClBC,EAAYxP,GAAU6H,KAAKsE,IAAI,EAAGoD,GACtC1F,EAAO0F,GAAcC,EAAW,yCAChC3F,EAAO2F,EAAY,EAAG,+BAEtB,IAAIC,EAfS,SAAmBH,EAAWzB,GAC3C,OAAIyB,EAAUI,YACLJ,EAAUI,YAAY7B,GAExB,IAAIyB,EAAUzB,GAWX8B,CAASL,EAAWE,GAG9B,OADAzN,KAAK,gBADoB,OAAXyI,EAAkB,KAAO,OACRiF,EAAKF,GAC7BE,GAGTpF,EAAGvE,UAAU8J,eAAiB,SAAyBH,EAAKF,GAI1D,IAHA,IAAIM,EAAW,EACXvB,EAAQ,EAEHpJ,EAAI,EAAG4K,EAAQ,EAAG5K,EAAInD,KAAK/B,OAAQkF,IAAK,CAC/C,IAAImI,EAAQtL,KAAK2I,MAAMxF,IAAM4K,EAASxB,EAEtCmB,EAAII,KAAqB,IAAPxC,EACdwC,EAAWJ,EAAIzP,SACjByP,EAAII,KAAexC,GAAQ,EAAK,KAE9BwC,EAAWJ,EAAIzP,SACjByP,EAAII,KAAexC,GAAQ,GAAM,KAGrB,IAAVyC,GACED,EAAWJ,EAAIzP,SACjByP,EAAII,KAAexC,GAAQ,GAAM,KAEnCiB,EAAQ,EACRwB,EAAQ,IAERxB,EAAQjB,IAAS,GACjByC,GAAS,GAIb,GAAID,EAAWJ,EAAIzP,OAGjB,IAFAyP,EAAII,KAAcvB,EAEXuB,EAAWJ,EAAIzP,QACpByP,EAAII,KAAc,GAKxBxF,EAAGvE,UAAUiK,eAAiB,SAAyBN,EAAKF,GAI1D,IAHA,IAAIM,EAAWJ,EAAIzP,OAAS,EACxBsO,EAAQ,EAEHpJ,EAAI,EAAG4K,EAAQ,EAAG5K,EAAInD,KAAK/B,OAAQkF,IAAK,CAC/C,IAAImI,EAAQtL,KAAK2I,MAAMxF,IAAM4K,EAASxB,EAEtCmB,EAAII,KAAqB,IAAPxC,EACdwC,GAAY,IACdJ,EAAII,KAAexC,GAAQ,EAAK,KAE9BwC,GAAY,IACdJ,EAAII,KAAexC,GAAQ,GAAM,KAGrB,IAAVyC,GACED,GAAY,IACdJ,EAAII,KAAexC,GAAQ,GAAM,KAEnCiB,EAAQ,EACRwB,EAAQ,IAERxB,EAAQjB,IAAS,GACjByC,GAAS,GAIb,GAAID,GAAY,EAGd,IAFAJ,EAAII,KAAcvB,EAEXuB,GAAY,GACjBJ,EAAII,KAAc,GAKpBhI,KAAKmI,MACP3F,EAAGvE,UAAUmK,WAAa,SAAqBlD,GAC7C,OAAO,GAAKlF,KAAKmI,MAAMjD,IAGzB1C,EAAGvE,UAAUmK,WAAa,SAAqBlD,GAC7C,IAAImD,EAAInD,EACJpE,EAAI,EAiBR,OAhBIuH,GAAK,OACPvH,GAAK,GACLuH,KAAO,IAELA,GAAK,KACPvH,GAAK,EACLuH,KAAO,GAELA,GAAK,IACPvH,GAAK,EACLuH,KAAO,GAELA,GAAK,IACPvH,GAAK,EACLuH,KAAO,GAEFvH,EAAIuH,GAIf7F,EAAGvE,UAAUqK,UAAY,SAAoBpD,GAE3C,GAAU,IAANA,EAAS,OAAO,GAEpB,IAAImD,EAAInD,EACJpE,EAAI,EAoBR,OAnBqB,IAAZ,KAAJuH,KACHvH,GAAK,GACLuH,KAAO,IAEU,IAAV,IAAJA,KACHvH,GAAK,EACLuH,KAAO,GAES,IAAT,GAAJA,KACHvH,GAAK,EACLuH,KAAO,GAES,IAAT,EAAJA,KACHvH,GAAK,EACLuH,KAAO,GAES,IAAT,EAAJA,IACHvH,IAEKA,GAIT0B,EAAGvE,UAAUsK,UAAY,WACvB,IAAIrD,EAAIhL,KAAK2I,MAAM3I,KAAK/B,OAAS,GAC7BqQ,EAAKtO,KAAKkO,WAAWlD,GACzB,OAA2B,IAAnBhL,KAAK/B,OAAS,GAAUqQ,GAiBlChG,EAAGvE,UAAUwK,SAAW,WACtB,GAAIvO,KAAKwC,SAAU,OAAO,EAG1B,IADA,IAAIoE,EAAI,EACCzD,EAAI,EAAGA,EAAInD,KAAK/B,OAAQkF,IAAK,CACpC,IAAI7B,EAAItB,KAAKoO,UAAUpO,KAAK2I,MAAMxF,IAElC,GADAyD,GAAKtF,EACK,KAANA,EAAU,KAAK,CAErB,OAAOsF,GAGT0B,EAAGvE,UAAUyJ,WAAa,WACxB,OAAO1H,KAAKgF,KAAK9K,KAAKqO,YAAc,EAAE,EAGxC/F,EAAGvE,UAAUpB,OAAS,SAAiB7C,GACrC,OAAsB,IAAlBE,KAAKtB,SACAsB,KAAKwO,MAAMC,MAAM3O,GAAO4O,MAAM,GAEhC1O,KAAK4L,OAAOA,EAGrBtD,EAAGvE,UAAUrB,SAAW,SAAmB5C,GACzC,OAAIE,KAAK2O,MAAM7O,EAAQ,GACdE,KAAK4O,KAAK9O,GAAO4O,MAAM,GAAGG,OAE5B7O,KAAK4L,OAAOA,EAGrBtD,EAAGvE,UAAU+K,MAAQ,WACnB,OAAyB,IAAlB9O,KAAKtB,QAAQA,EAItB4J,EAAGvE,UAAUgL,IAAM,WACjB,OAAO/O,KAAK4L,QAAQiD,MAAMA,EAG5BvG,EAAGvE,UAAU8K,KAAO,WAKlB,OAJK7O,KAAKwC,WACRxC,KAAKtB,UAAY,GAGZsB,IAAIA,EAIbsI,EAAGvE,UAAUiL,KAAO,SAAe9E,GACjC,KAAOlK,KAAK/B,OAASiM,EAAIjM,QACvB+B,KAAK2I,MAAM3I,KAAK/B,UAAY,EAG9B,IAAK,IAAIkF,EAAI,EAAGA,EAAI+G,EAAIjM,OAAQkF,IAC9BnD,KAAK2I,MAAMxF,GAAKnD,KAAK2I,MAAMxF,GAAK+G,EAAIvB,MAAMxF,GAG5C,OAAOnD,KAAKkL,QAAQA,EAGtB5C,EAAGvE,UAAUkL,IAAM,SAAc/E,GAE/B,OADApC,EAA0C,IAAlC9H,KAAKtB,SAAWwL,EAAIxL,WACrBsB,KAAKgP,KAAK9E,IAInB5B,EAAGvE,UAAUmL,GAAK,SAAahF,GAC7B,OAAIlK,KAAK/B,OAASiM,EAAIjM,OAAe+B,KAAK4L,QAAQqD,IAAI/E,GAC/CA,EAAI0B,QAAQqD,IAAIjP,KAAKA,EAG9BsI,EAAGvE,UAAUoL,IAAM,SAAcjF,GAC/B,OAAIlK,KAAK/B,OAASiM,EAAIjM,OAAe+B,KAAK4L,QAAQoD,KAAK9E,GAChDA,EAAI0B,QAAQoD,KAAKhP,KAAKA,EAI/BsI,EAAGvE,UAAUqL,MAAQ,SAAgBlF,GAEnC,IAAI5I,EAEFA,EADEtB,KAAK/B,OAASiM,EAAIjM,OAChBiM,EAEAlK,KAGN,IAAK,IAAImD,EAAI,EAAGA,EAAI7B,EAAErD,OAAQkF,IAC5BnD,KAAK2I,MAAMxF,GAAKnD,KAAK2I,MAAMxF,GAAK+G,EAAIvB,MAAMxF,GAK5C,OAFAnD,KAAK/B,OAASqD,EAAErD,OAET+B,KAAKkL,QAAQA,EAGtB5C,EAAGvE,UAAUsL,KAAO,SAAenF,GAEjC,OADApC,EAA0C,IAAlC9H,KAAKtB,SAAWwL,EAAIxL,WACrBsB,KAAKoP,MAAMlF,IAIpB5B,EAAGvE,UAAUuL,IAAM,SAAcpF,GAC/B,OAAIlK,KAAK/B,OAASiM,EAAIjM,OAAe+B,KAAK4L,QAAQyD,KAAKnF,GAChDA,EAAI0B,QAAQyD,KAAKrP,KAAKA,EAG/BsI,EAAGvE,UAAUwL,KAAO,SAAerF,GACjC,OAAIlK,KAAK/B,OAASiM,EAAIjM,OAAe+B,KAAK4L,QAAQwD,MAAMlF,GACjDA,EAAI0B,QAAQwD,MAAMpP,KAAKA,EAIhCsI,EAAGvE,UAAUyL,MAAQ,SAAgBtF,GAEnC,IAAI7I,EACAC,EACAtB,KAAK/B,OAASiM,EAAIjM,QACpBoD,EAAIrB,KACJsB,EAAI4I,IAEJ7I,EAAI6I,EACJ5I,EAAItB,MAGN,IAAK,IAAImD,EAAI,EAAGA,EAAI7B,EAAErD,OAAQkF,IAC5BnD,KAAK2I,MAAMxF,GAAK9B,EAAEsH,MAAMxF,GAAK7B,EAAEqH,MAAMxF,GAGvC,GAAInD,OAASqB,EACX,KAAO8B,EAAI9B,EAAEpD,OAAQkF,IACnBnD,KAAK2I,MAAMxF,GAAK9B,EAAEsH,MAAMxF,GAM5B,OAFAnD,KAAK/B,OAASoD,EAAEpD,OAET+B,KAAKkL,QAAQA,EAGtB5C,EAAGvE,UAAU0L,KAAO,SAAevF,GAEjC,OADApC,EAA0C,IAAlC9H,KAAKtB,SAAWwL,EAAIxL,WACrBsB,KAAKwP,MAAMtF,IAIpB5B,EAAGvE,UAAU2L,IAAM,SAAcxF,GAC/B,OAAIlK,KAAK/B,OAASiM,EAAIjM,OAAe+B,KAAK4L,QAAQ6D,KAAKvF,GAChDA,EAAI0B,QAAQ6D,KAAKzP,KAAKA,EAG/BsI,EAAGvE,UAAU4L,KAAO,SAAezF,GACjC,OAAIlK,KAAK/B,OAASiM,EAAIjM,OAAe+B,KAAK4L,QAAQ4D,MAAMtF,GACjDA,EAAI0B,QAAQ4D,MAAMxP,KAAKA,EAIhCsI,EAAGvE,UAAU0K,MAAQ,SAAgB3O,GACnCgI,EAAwB,iBAAVhI,GAAsBA,GAAS,GAE7C,IAAI8P,EAAsC,EAAxB9J,KAAKgF,KAAKhL,EAAQ,IAChC+P,EAAW/P,EAAQ,GAGvBE,KAAK6L,QAAQ+D,GAETC,EAAW,GACbD,IAIF,IAAK,IAAIzM,EAAI,EAAGA,EAAIyM,EAAazM,IAC/BnD,KAAK2I,MAAMxF,GAAsB,UAAhBnD,KAAK2I,MAAMxF,GAS9B,OALI0M,EAAW,IACb7P,KAAK2I,MAAMxF,IAAMnD,KAAK2I,MAAMxF,GAAM,UAAc,GAAK0M,GAIhD7P,KAAKkL,QAAQA,EAGtB5C,EAAGvE,UAAU6K,KAAO,SAAe9O,GACjC,OAAOE,KAAK4L,QAAQ6C,MAAM3O,IAI5BwI,EAAGvE,UAAU+L,KAAO,SAAeC,EAAKhI,GACtCD,EAAsB,iBAARiI,GAAoBA,GAAO,GAEzC,IAAI9E,EAAO8E,EAAM,GAAM,EACnBC,EAAOD,EAAM,GAUjB,OARA/P,KAAK6L,QAAQZ,EAAM,GAGjBjL,KAAK2I,MAAMsC,GADTlD,EACgB/H,KAAK2I,MAAMsC,GAAQ,GAAK+E,EAExBhQ,KAAK2I,MAAMsC,KAAS,GAAK+E,GAGtChQ,KAAKkL,QAAQA,EAItB5C,EAAGvE,UAAUkM,KAAO,SAAe/F,GACjC,IAAItD,EAkBAvF,EAAGC,EAfP,GAAsB,IAAlBtB,KAAKtB,UAAmC,IAAjBwL,EAAIxL,SAI7B,OAHAsB,KAAKtB,SAAW,EAChBkI,EAAI5G,KAAKkQ,KAAKhG,GACdlK,KAAKtB,UAAY,EACVsB,KAAK+L,YAGP,GAAsB,IAAlB/L,KAAKtB,UAAmC,IAAjBwL,EAAIxL,SAIpC,OAHAwL,EAAIxL,SAAW,EACfkI,EAAI5G,KAAKkQ,KAAKhG,GACdA,EAAIxL,SAAW,EACRkI,EAAEmF,YAKP/L,KAAK/B,OAASiM,EAAIjM,QACpBoD,EAAIrB,KACJsB,EAAI4I,IAEJ7I,EAAI6I,EACJ5I,EAAItB,MAIN,IADA,IAAIuM,EAAQ,EACHpJ,EAAI,EAAGA,EAAI7B,EAAErD,OAAQkF,IAC5ByD,GAAkB,EAAbvF,EAAEsH,MAAMxF,KAAwB,EAAb7B,EAAEqH,MAAMxF,IAAUoJ,EAC1CvM,KAAK2I,MAAMxF,GAAS,SAAJyD,EAChB2F,EAAQ3F,IAAM,GAEhB,KAAiB,IAAV2F,GAAepJ,EAAI9B,EAAEpD,OAAQkF,IAClCyD,GAAkB,EAAbvF,EAAEsH,MAAMxF,IAAUoJ,EACvBvM,KAAK2I,MAAMxF,GAAS,SAAJyD,EAChB2F,EAAQ3F,IAAM,GAIhB,GADA5G,KAAK/B,OAASoD,EAAEpD,OACF,IAAVsO,EACFvM,KAAK2I,MAAM3I,KAAK/B,QAAUsO,EAC1BvM,KAAK/B,cAEA,GAAIoD,IAAMrB,KACf,KAAOmD,EAAI9B,EAAEpD,OAAQkF,IACnBnD,KAAK2I,MAAMxF,GAAK9B,EAAEsH,MAAMxF,GAI5B,OAAOnD,IAAIA,EAIbsI,EAAGvE,UAAUtE,IAAM,SAAcyK,GAC/B,IAAIwD,EACJ,OAAqB,IAAjBxD,EAAIxL,UAAoC,IAAlBsB,KAAKtB,UAC7BwL,EAAIxL,SAAW,EACfgP,EAAM1N,KAAKyB,IAAIyI,GACfA,EAAIxL,UAAY,EACTgP,GACmB,IAAjBxD,EAAIxL,UAAoC,IAAlBsB,KAAKtB,UACpCsB,KAAKtB,SAAW,EAChBgP,EAAMxD,EAAIzI,IAAIzB,MACdA,KAAKtB,SAAW,EACTgP,GAGL1N,KAAK/B,OAASiM,EAAIjM,OAAe+B,KAAK4L,QAAQqE,KAAK/F,GAEhDA,EAAI0B,QAAQqE,KAAKjQ,KAAKA,EAI/BsI,EAAGvE,UAAUmM,KAAO,SAAehG,GAEjC,GAAqB,IAAjBA,EAAIxL,SAAgB,CACtBwL,EAAIxL,SAAW,EACf,IAAIkI,EAAI5G,KAAKiQ,KAAK/F,GAElB,OADAA,EAAIxL,SAAW,EACRkI,EAAEmF,WAAWA,CAGf,GAAsB,IAAlB/L,KAAKtB,SAId,OAHAsB,KAAKtB,SAAW,EAChBsB,KAAKiQ,KAAK/F,GACVlK,KAAKtB,SAAW,EACTsB,KAAK+L,YAId,IAWI1K,EAAGC,EAXHiJ,EAAMvK,KAAKuK,IAAIL,GAGnB,GAAY,IAARK,EAIF,OAHAvK,KAAKtB,SAAW,EAChBsB,KAAK/B,OAAS,EACd+B,KAAK2I,MAAM,GAAK,EACT3I,KAKLuK,EAAM,GACRlJ,EAAIrB,KACJsB,EAAI4I,IAEJ7I,EAAI6I,EACJ5I,EAAItB,MAIN,IADA,IAAIuM,EAAQ,EACHpJ,EAAI,EAAGA,EAAI7B,EAAErD,OAAQkF,IAE5BoJ,GADA3F,GAAkB,EAAbvF,EAAEsH,MAAMxF,KAAwB,EAAb7B,EAAEqH,MAAMxF,IAAUoJ,IAC7B,GACbvM,KAAK2I,MAAMxF,GAAS,SAAJyD,EAElB,KAAiB,IAAV2F,GAAepJ,EAAI9B,EAAEpD,OAAQkF,IAElCoJ,GADA3F,GAAkB,EAAbvF,EAAEsH,MAAMxF,IAAUoJ,IACV,GACbvM,KAAK2I,MAAMxF,GAAS,SAAJyD,EAIlB,GAAc,IAAV2F,GAAepJ,EAAI9B,EAAEpD,QAAUoD,IAAMrB,KACvC,KAAOmD,EAAI9B,EAAEpD,OAAQkF,IACnBnD,KAAK2I,MAAMxF,GAAK9B,EAAEsH,MAAMxF,GAU5B,OANAnD,KAAK/B,OAAS6H,KAAKsE,IAAIpK,KAAK/B,OAAQkF,GAEhC9B,IAAMrB,OACRA,KAAKtB,SAAW,GAGXsB,KAAKkL,QAAQA,EAItB5C,EAAGvE,UAAUtC,IAAM,SAAcyI,GAC/B,OAAOlK,KAAK4L,QAAQsE,KAAKhG,IA+C3B,IAAIiG,EAAc,SAAsBlD,EAAM/C,EAAKoC,GACjD,IAIIY,EACAkD,EACA9B,EANAjN,EAAI4L,EAAKtE,MACTrH,EAAI4I,EAAIvB,MACR0H,EAAI/D,EAAI3D,MACRW,EAAI,EAIJgH,EAAY,EAAPjP,EAAE,GACPkP,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPpP,EAAE,GACPqP,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPvP,EAAE,GACPwP,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP1P,EAAE,GACP2P,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP7P,EAAE,GACP8P,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPhQ,EAAE,GACPiQ,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPnQ,EAAE,GACPoQ,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPtQ,EAAE,GACPuQ,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPzQ,EAAE,GACP0Q,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP5Q,EAAE,GACP6Q,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP9Q,EAAE,GACP+Q,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPjR,EAAE,GACPkR,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPpR,EAAE,GACPqR,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPvR,EAAE,GACPwR,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP1R,EAAE,GACP2R,EAAW,KAALD,EACNE,GAAMF,IAAO,GACbG,GAAY,EAAP7R,EAAE,GACP8R,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAPhS,EAAE,GACPiS,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAPnS,EAAE,GACPoS,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAPtS,EAAE,GACPuS,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAPzS,EAAE,GACP0S,GAAW,KAALD,GACNE,GAAMF,KAAO,GAEjBzH,EAAI5N,SAAWuO,EAAKvO,SAAWwL,EAAIxL,SACnC4N,EAAIrO,OAAS,GAMb,IAAIiW,IAAQ5K,GAJZ4D,EAAKpH,KAAKqO,KAAK5D,EAAK8B,IAIE,KAAa,MAFnCjC,GADAA,EAAMtK,KAAKqO,KAAK5D,EAAK+B,IACRxM,KAAKqO,KAAK3D,EAAK6B,GAAQ,KAEU,IAAO,EACrD/I,IAFAgF,EAAKxI,KAAKqO,KAAK3D,EAAK8B,KAEPlC,IAAQ,IAAO,IAAM8D,KAAO,IAAO,EAChDA,IAAM,SAENhH,EAAKpH,KAAKqO,KAAKzD,EAAK2B,GAEpBjC,GADAA,EAAMtK,KAAKqO,KAAKzD,EAAK4B,IACRxM,KAAKqO,KAAKxD,EAAK0B,GAAQ,EACpC/D,EAAKxI,KAAKqO,KAAKxD,EAAK2B,GAKpB,IAAI8B,IAAQ9K,GAJZ4D,EAAMA,EAAKpH,KAAKqO,KAAK5D,EAAKiC,GAAQ,GAIZ,KAAa,MAFnCpC,GADAA,EAAOA,EAAMtK,KAAKqO,KAAK5D,EAAKkC,GAAQ,GACvB3M,KAAKqO,KAAK3D,EAAKgC,GAAQ,KAEU,IAAO,EACrDlJ,IAFAgF,EAAMA,EAAKxI,KAAKqO,KAAK3D,EAAKiC,GAAQ,IAErBrC,IAAQ,IAAO,IAAMgE,KAAO,IAAO,EAChDA,IAAM,SAENlH,EAAKpH,KAAKqO,KAAKtD,EAAKwB,GAEpBjC,GADAA,EAAMtK,KAAKqO,KAAKtD,EAAKyB,IACRxM,KAAKqO,KAAKrD,EAAKuB,GAAQ,EACpC/D,EAAKxI,KAAKqO,KAAKrD,EAAKwB,GACpBpF,EAAMA,EAAKpH,KAAKqO,KAAKzD,EAAK8B,GAAQ,EAElCpC,GADAA,EAAOA,EAAMtK,KAAKqO,KAAKzD,EAAK+B,GAAQ,GACvB3M,KAAKqO,KAAKxD,EAAK6B,GAAQ,EACpClE,EAAMA,EAAKxI,KAAKqO,KAAKxD,EAAK8B,GAAQ,EAKlC,IAAI4B,IAAQ/K,GAJZ4D,EAAMA,EAAKpH,KAAKqO,KAAK5D,EAAKoC,GAAQ,GAIZ,KAAa,MAFnCvC,GADAA,EAAOA,EAAMtK,KAAKqO,KAAK5D,EAAKqC,GAAQ,GACvB9M,KAAKqO,KAAK3D,EAAKmC,GAAQ,KAEU,IAAO,EACrDrJ,IAFAgF,EAAMA,EAAKxI,KAAKqO,KAAK3D,EAAKoC,GAAQ,IAErBxC,IAAQ,IAAO,IAAMiE,KAAO,IAAO,EAChDA,IAAM,SAENnH,EAAKpH,KAAKqO,KAAKnD,EAAKqB,GAEpBjC,GADAA,EAAMtK,KAAKqO,KAAKnD,EAAKsB,IACRxM,KAAKqO,KAAKlD,EAAKoB,GAAQ,EACpC/D,EAAKxI,KAAKqO,KAAKlD,EAAKqB,GACpBpF,EAAMA,EAAKpH,KAAKqO,KAAKtD,EAAK2B,GAAQ,EAElCpC,GADAA,EAAOA,EAAMtK,KAAKqO,KAAKtD,EAAK4B,GAAQ,GACvB3M,KAAKqO,KAAKrD,EAAK0B,GAAQ,EACpClE,EAAMA,EAAKxI,KAAKqO,KAAKrD,EAAK2B,GAAQ,EAClCvF,EAAMA,EAAKpH,KAAKqO,KAAKzD,EAAKiC,GAAQ,EAElCvC,GADAA,EAAOA,EAAMtK,KAAKqO,KAAKzD,EAAKkC,GAAQ,GACvB9M,KAAKqO,KAAKxD,EAAKgC,GAAQ,EACpCrE,EAAMA,EAAKxI,KAAKqO,KAAKxD,EAAKiC,GAAQ,EAKlC,IAAI0B,IAAQhL,GAJZ4D,EAAMA,EAAKpH,KAAKqO,KAAK5D,EAAKuC,GAAQ,GAIZ,KAAa,MAFnC1C,GADAA,EAAOA,EAAMtK,KAAKqO,KAAK5D,EAAKwC,GAAQ,GACvBjN,KAAKqO,KAAK3D,EAAKsC,GAAQ,KAEU,IAAO,EACrDxJ,IAFAgF,EAAMA,EAAKxI,KAAKqO,KAAK3D,EAAKuC,GAAQ,IAErB3C,IAAQ,IAAO,IAAMkE,KAAO,IAAO,EAChDA,IAAM,SAENpH,EAAKpH,KAAKqO,KAAKhD,EAAKkB,GAEpBjC,GADAA,EAAMtK,KAAKqO,KAAKhD,EAAKmB,IACRxM,KAAKqO,KAAK/C,EAAKiB,GAAQ,EACpC/D,EAAKxI,KAAKqO,KAAK/C,EAAKkB,GACpBpF,EAAMA,EAAKpH,KAAKqO,KAAKnD,EAAKwB,GAAQ,EAElCpC,GADAA,EAAOA,EAAMtK,KAAKqO,KAAKnD,EAAKyB,GAAQ,GACvB3M,KAAKqO,KAAKlD,EAAKuB,GAAQ,EACpClE,EAAMA,EAAKxI,KAAKqO,KAAKlD,EAAKwB,GAAQ,EAClCvF,EAAMA,EAAKpH,KAAKqO,KAAKtD,EAAK8B,GAAQ,EAElCvC,GADAA,EAAOA,EAAMtK,KAAKqO,KAAKtD,EAAK+B,GAAQ,GACvB9M,KAAKqO,KAAKrD,EAAK6B,GAAQ,EACpCrE,EAAMA,EAAKxI,KAAKqO,KAAKrD,EAAK8B,GAAQ,EAClC1F,EAAMA,EAAKpH,KAAKqO,KAAKzD,EAAKoC,GAAQ,EAElC1C,GADAA,EAAOA,EAAMtK,KAAKqO,KAAKzD,EAAKqC,GAAQ,GACvBjN,KAAKqO,KAAKxD,EAAKmC,GAAQ,EACpCxE,EAAMA,EAAKxI,KAAKqO,KAAKxD,EAAKoC,GAAQ,EAKlC,IAAIwB,IAAQjL,GAJZ4D,EAAMA,EAAKpH,KAAKqO,KAAK5D,EAAK0C,GAAQ,GAIZ,KAAa,MAFnC7C,GADAA,EAAOA,EAAMtK,KAAKqO,KAAK5D,EAAK2C,IAAQ,GACvBpN,KAAKqO,KAAK3D,EAAKyC,GAAQ,KAEU,IAAO,EACrD3J,IAFAgF,EAAMA,EAAKxI,KAAKqO,KAAK3D,EAAK0C,IAAQ,IAErB9C,IAAQ,IAAO,IAAMmE,KAAO,IAAO,EAChDA,IAAM,SAENrH,EAAKpH,KAAKqO,KAAK7C,EAAKe,GAEpBjC,GADAA,EAAMtK,KAAKqO,KAAK7C,EAAKgB,IACRxM,KAAKqO,KAAK5C,EAAKc,GAAQ,EACpC/D,EAAKxI,KAAKqO,KAAK5C,EAAKe,GACpBpF,EAAMA,EAAKpH,KAAKqO,KAAKhD,EAAKqB,GAAQ,EAElCpC,GADAA,EAAOA,EAAMtK,KAAKqO,KAAKhD,EAAKsB,GAAQ,GACvB3M,KAAKqO,KAAK/C,EAAKoB,GAAQ,EACpClE,EAAMA,EAAKxI,KAAKqO,KAAK/C,EAAKqB,GAAQ,EAClCvF,EAAMA,EAAKpH,KAAKqO,KAAKnD,EAAK2B,GAAQ,EAElCvC,GADAA,EAAOA,EAAMtK,KAAKqO,KAAKnD,EAAK4B,GAAQ,GACvB9M,KAAKqO,KAAKlD,EAAK0B,GAAQ,EACpCrE,EAAMA,EAAKxI,KAAKqO,KAAKlD,EAAK2B,GAAQ,EAClC1F,EAAMA,EAAKpH,KAAKqO,KAAKtD,EAAKiC,GAAQ,EAElC1C,GADAA,EAAOA,EAAMtK,KAAKqO,KAAKtD,EAAKkC,GAAQ,GACvBjN,KAAKqO,KAAKrD,EAAKgC,GAAQ,EACpCxE,EAAMA,EAAKxI,KAAKqO,KAAKrD,EAAKiC,GAAQ,EAClC7F,EAAMA,EAAKpH,KAAKqO,KAAKzD,EAAKuC,GAAQ,EAElC7C,GADAA,EAAOA,EAAMtK,KAAKqO,KAAKzD,EAAKwC,IAAQ,GACvBpN,KAAKqO,KAAKxD,EAAKsC,GAAQ,EACpC3E,EAAMA,EAAKxI,KAAKqO,KAAKxD,EAAKuC,IAAQ,EAKlC,IAAIsB,IAAQlL,GAJZ4D,EAAMA,EAAKpH,KAAKqO,KAAK5D,EAAK6C,IAAQ,GAIZ,KAAa,MAFnChD,GADAA,EAAOA,EAAMtK,KAAKqO,KAAK5D,EAAK8C,IAAQ,GACvBvN,KAAKqO,KAAK3D,EAAK4C,IAAQ,KAEU,IAAO,EACrD9J,IAFAgF,EAAMA,EAAKxI,KAAKqO,KAAK3D,EAAK6C,IAAQ,IAErBjD,IAAQ,IAAO,IAAMoE,KAAO,IAAO,EAChDA,IAAM,SAENtH,EAAKpH,KAAKqO,KAAK1C,EAAKY,GAEpBjC,GADAA,EAAMtK,KAAKqO,KAAK1C,EAAKa,IACRxM,KAAKqO,KAAKzC,EAAKW,GAAQ,EACpC/D,EAAKxI,KAAKqO,KAAKzC,EAAKY,GACpBpF,EAAMA,EAAKpH,KAAKqO,KAAK7C,EAAKkB,GAAQ,EAElCpC,GADAA,EAAOA,EAAMtK,KAAKqO,KAAK7C,EAAKmB,GAAQ,GACvB3M,KAAKqO,KAAK5C,EAAKiB,GAAQ,EACpClE,EAAMA,EAAKxI,KAAKqO,KAAK5C,EAAKkB,GAAQ,EAClCvF,EAAMA,EAAKpH,KAAKqO,KAAKhD,EAAKwB,GAAQ,EAElCvC,GADAA,EAAOA,EAAMtK,KAAKqO,KAAKhD,EAAKyB,GAAQ,GACvB9M,KAAKqO,KAAK/C,EAAKuB,GAAQ,EACpCrE,EAAMA,EAAKxI,KAAKqO,KAAK/C,EAAKwB,GAAQ,EAClC1F,EAAMA,EAAKpH,KAAKqO,KAAKnD,EAAK8B,GAAQ,EAElC1C,GADAA,EAAOA,EAAMtK,KAAKqO,KAAKnD,EAAK+B,GAAQ,GACvBjN,KAAKqO,KAAKlD,EAAK6B,GAAQ,EACpCxE,EAAMA,EAAKxI,KAAKqO,KAAKlD,EAAK8B,GAAQ,EAClC7F,EAAMA,EAAKpH,KAAKqO,KAAKtD,EAAKoC,GAAQ,EAElC7C,GADAA,EAAOA,EAAMtK,KAAKqO,KAAKtD,EAAKqC,IAAQ,GACvBpN,KAAKqO,KAAKrD,EAAKmC,GAAQ,EACpC3E,EAAMA,EAAKxI,KAAKqO,KAAKrD,EAAKoC,IAAQ,EAClChG,EAAMA,EAAKpH,KAAKqO,KAAKzD,EAAK0C,IAAQ,EAElChD,GADAA,EAAOA,EAAMtK,KAAKqO,KAAKzD,EAAK2C,IAAQ,GACvBvN,KAAKqO,KAAKxD,EAAKyC,IAAQ,EACpC9E,EAAMA,EAAKxI,KAAKqO,KAAKxD,EAAK0C,IAAQ,EAKlC,IAAIoB,IAAQnL,GAJZ4D,EAAMA,EAAKpH,KAAKqO,KAAK5D,EAAKgD,IAAQ,GAIZ,KAAa,MAFnCnD,GADAA,EAAOA,EAAMtK,KAAKqO,KAAK5D,EAAKiD,IAAQ,GACvB1N,KAAKqO,KAAK3D,EAAK+C,IAAQ,KAEU,IAAO,EACrDjK,IAFAgF,EAAMA,EAAKxI,KAAKqO,KAAK3D,EAAKgD,IAAQ,IAErBpD,IAAQ,IAAO,IAAMqE,KAAO,IAAO,EAChDA,IAAM,SAENvH,EAAKpH,KAAKqO,KAAKvC,EAAKS,GAEpBjC,GADAA,EAAMtK,KAAKqO,KAAKvC,EAAKU,IACRxM,KAAKqO,KAAKtC,EAAKQ,GAAQ,EACpC/D,EAAKxI,KAAKqO,KAAKtC,EAAKS,GACpBpF,EAAMA,EAAKpH,KAAKqO,KAAK1C,EAAKe,GAAQ,EAElCpC,GADAA,EAAOA,EAAMtK,KAAKqO,KAAK1C,EAAKgB,GAAQ,GACvB3M,KAAKqO,KAAKzC,EAAKc,GAAQ,EACpClE,EAAMA,EAAKxI,KAAKqO,KAAKzC,EAAKe,GAAQ,EAClCvF,EAAMA,EAAKpH,KAAKqO,KAAK7C,EAAKqB,GAAQ,EAElCvC,GADAA,EAAOA,EAAMtK,KAAKqO,KAAK7C,EAAKsB,GAAQ,GACvB9M,KAAKqO,KAAK5C,EAAKoB,GAAQ,EACpCrE,EAAMA,EAAKxI,KAAKqO,KAAK5C,EAAKqB,GAAQ,EAClC1F,EAAMA,EAAKpH,KAAKqO,KAAKhD,EAAK2B,GAAQ,EAElC1C,GADAA,EAAOA,EAAMtK,KAAKqO,KAAKhD,EAAK4B,GAAQ,GACvBjN,KAAKqO,KAAK/C,EAAK0B,GAAQ,EACpCxE,EAAMA,EAAKxI,KAAKqO,KAAK/C,EAAK2B,GAAQ,EAClC7F,EAAMA,EAAKpH,KAAKqO,KAAKnD,EAAKiC,GAAQ,EAElC7C,GADAA,EAAOA,EAAMtK,KAAKqO,KAAKnD,EAAKkC,IAAQ,GACvBpN,KAAKqO,KAAKlD,EAAKgC,GAAQ,EACpC3E,EAAMA,EAAKxI,KAAKqO,KAAKlD,EAAKiC,IAAQ,EAClChG,EAAMA,EAAKpH,KAAKqO,KAAKtD,EAAKuC,IAAQ,EAElChD,GADAA,EAAOA,EAAMtK,KAAKqO,KAAKtD,EAAKwC,IAAQ,GACvBvN,KAAKqO,KAAKrD,EAAKsC,IAAQ,EACpC9E,EAAMA,EAAKxI,KAAKqO,KAAKrD,EAAKuC,IAAQ,EAClCnG,EAAMA,EAAKpH,KAAKqO,KAAKzD,EAAK6C,IAAQ,EAElCnD,GADAA,EAAOA,EAAMtK,KAAKqO,KAAKzD,EAAK8C,IAAQ,GACvB1N,KAAKqO,KAAKxD,EAAK4C,IAAQ,EACpCjF,EAAMA,EAAKxI,KAAKqO,KAAKxD,EAAK6C,IAAQ,EAKlC,IAAIkB,IAAQpL,GAJZ4D,EAAMA,EAAKpH,KAAKqO,KAAK5D,EAAKmD,IAAQ,GAIZ,KAAa,MAFnCtD,GADAA,EAAOA,EAAMtK,KAAKqO,KAAK5D,EAAKoD,IAAQ,GACvB7N,KAAKqO,KAAK3D,EAAKkD,IAAQ,KAEU,IAAO,EACrDpK,IAFAgF,EAAMA,EAAKxI,KAAKqO,KAAK3D,EAAKmD,IAAQ,IAErBvD,IAAQ,IAAO,IAAMsE,KAAO,IAAO,EAChDA,IAAM,SAENxH,EAAKpH,KAAKqO,KAAKpC,EAAKM,GAEpBjC,GADAA,EAAMtK,KAAKqO,KAAKpC,EAAKO,IACRxM,KAAKqO,KAAKnC,EAAKK,GAAQ,EACpC/D,EAAKxI,KAAKqO,KAAKnC,EAAKM,GACpBpF,EAAMA,EAAKpH,KAAKqO,KAAKvC,EAAKY,GAAQ,EAElCpC,GADAA,EAAOA,EAAMtK,KAAKqO,KAAKvC,EAAKa,GAAQ,GACvB3M,KAAKqO,KAAKtC,EAAKW,GAAQ,EACpClE,EAAMA,EAAKxI,KAAKqO,KAAKtC,EAAKY,GAAQ,EAClCvF,EAAMA,EAAKpH,KAAKqO,KAAK1C,EAAKkB,GAAQ,EAElCvC,GADAA,EAAOA,EAAMtK,KAAKqO,KAAK1C,EAAKmB,GAAQ,GACvB9M,KAAKqO,KAAKzC,EAAKiB,GAAQ,EACpCrE,EAAMA,EAAKxI,KAAKqO,KAAKzC,EAAKkB,GAAQ,EAClC1F,EAAMA,EAAKpH,KAAKqO,KAAK7C,EAAKwB,GAAQ,EAElC1C,GADAA,EAAOA,EAAMtK,KAAKqO,KAAK7C,EAAKyB,GAAQ,GACvBjN,KAAKqO,KAAK5C,EAAKuB,GAAQ,EACpCxE,EAAMA,EAAKxI,KAAKqO,KAAK5C,EAAKwB,GAAQ,EAClC7F,EAAMA,EAAKpH,KAAKqO,KAAKhD,EAAK8B,GAAQ,EAElC7C,GADAA,EAAOA,EAAMtK,KAAKqO,KAAKhD,EAAK+B,IAAQ,GACvBpN,KAAKqO,KAAK/C,EAAK6B,GAAQ,EACpC3E,EAAMA,EAAKxI,KAAKqO,KAAK/C,EAAK8B,IAAQ,EAClChG,EAAMA,EAAKpH,KAAKqO,KAAKnD,EAAKoC,IAAQ,EAElChD,GADAA,EAAOA,EAAMtK,KAAKqO,KAAKnD,EAAKqC,IAAQ,GACvBvN,KAAKqO,KAAKlD,EAAKmC,IAAQ,EACpC9E,EAAMA,EAAKxI,KAAKqO,KAAKlD,EAAKoC,IAAQ,EAClCnG,EAAMA,EAAKpH,KAAKqO,KAAKtD,EAAK0C,IAAQ,EAElCnD,GADAA,EAAOA,EAAMtK,KAAKqO,KAAKtD,EAAK2C,IAAQ,GACvB1N,KAAKqO,KAAKrD,EAAKyC,IAAQ,EACpCjF,EAAMA,EAAKxI,KAAKqO,KAAKrD,EAAK0C,IAAQ,EAClCtG,EAAMA,EAAKpH,KAAKqO,KAAKzD,EAAKgD,IAAQ,EAElCtD,GADAA,EAAOA,EAAMtK,KAAKqO,KAAKzD,EAAKiD,IAAQ,GACvB7N,KAAKqO,KAAKxD,EAAK+C,IAAQ,EACpCpF,EAAMA,EAAKxI,KAAKqO,KAAKxD,EAAKgD,IAAQ,EAKlC,IAAIgB,IAAQrL,GAJZ4D,EAAMA,EAAKpH,KAAKqO,KAAK5D,EAAKsD,IAAQ,GAIZ,KAAa,MAFnCzD,GADAA,EAAOA,EAAMtK,KAAKqO,KAAK5D,EAAKuD,IAAQ,GACvBhO,KAAKqO,KAAK3D,EAAKqD,IAAQ,KAEU,IAAO,EACrDvK,IAFAgF,EAAMA,EAAKxI,KAAKqO,KAAK3D,EAAKsD,IAAQ,IAErB1D,IAAQ,IAAO,IAAMuE,KAAO,IAAO,EAChDA,IAAM,SAENzH,EAAKpH,KAAKqO,KAAKjC,EAAKG,GAEpBjC,GADAA,EAAMtK,KAAKqO,KAAKjC,EAAKI,IACRxM,KAAKqO,KAAKhC,EAAKE,GAAQ,EACpC/D,EAAKxI,KAAKqO,KAAKhC,EAAKG,GACpBpF,EAAMA,EAAKpH,KAAKqO,KAAKpC,EAAKS,GAAQ,EAElCpC,GADAA,EAAOA,EAAMtK,KAAKqO,KAAKpC,EAAKU,GAAQ,GACvB3M,KAAKqO,KAAKnC,EAAKQ,GAAQ,EACpClE,EAAMA,EAAKxI,KAAKqO,KAAKnC,EAAKS,GAAQ,EAClCvF,EAAMA,EAAKpH,KAAKqO,KAAKvC,EAAKe,GAAQ,EAElCvC,GADAA,EAAOA,EAAMtK,KAAKqO,KAAKvC,EAAKgB,GAAQ,GACvB9M,KAAKqO,KAAKtC,EAAKc,GAAQ,EACpCrE,EAAMA,EAAKxI,KAAKqO,KAAKtC,EAAKe,GAAQ,EAClC1F,EAAMA,EAAKpH,KAAKqO,KAAK1C,EAAKqB,GAAQ,EAElC1C,GADAA,EAAOA,EAAMtK,KAAKqO,KAAK1C,EAAKsB,GAAQ,GACvBjN,KAAKqO,KAAKzC,EAAKoB,GAAQ,EACpCxE,EAAMA,EAAKxI,KAAKqO,KAAKzC,EAAKqB,GAAQ,EAClC7F,EAAMA,EAAKpH,KAAKqO,KAAK7C,EAAK2B,GAAQ,EAElC7C,GADAA,EAAOA,EAAMtK,KAAKqO,KAAK7C,EAAK4B,IAAQ,GACvBpN,KAAKqO,KAAK5C,EAAK0B,GAAQ,EACpC3E,EAAMA,EAAKxI,KAAKqO,KAAK5C,EAAK2B,IAAQ,EAClChG,EAAMA,EAAKpH,KAAKqO,KAAKhD,EAAKiC,IAAQ,EAElChD,GADAA,EAAOA,EAAMtK,KAAKqO,KAAKhD,EAAKkC,IAAQ,GACvBvN,KAAKqO,KAAK/C,EAAKgC,IAAQ,EACpC9E,EAAMA,EAAKxI,KAAKqO,KAAK/C,EAAKiC,IAAQ,EAClCnG,EAAMA,EAAKpH,KAAKqO,KAAKnD,EAAKuC,IAAQ,EAElCnD,GADAA,EAAOA,EAAMtK,KAAKqO,KAAKnD,EAAKwC,IAAQ,GACvB1N,KAAKqO,KAAKlD,EAAKsC,IAAQ,EACpCjF,EAAMA,EAAKxI,KAAKqO,KAAKlD,EAAKuC,IAAQ,EAClCtG,EAAMA,EAAKpH,KAAKqO,KAAKtD,EAAK6C,IAAQ,EAElCtD,GADAA,EAAOA,EAAMtK,KAAKqO,KAAKtD,EAAK8C,IAAQ,GACvB7N,KAAKqO,KAAKrD,EAAK4C,IAAQ,EACpCpF,EAAMA,EAAKxI,KAAKqO,KAAKrD,EAAK6C,IAAQ,EAClCzG,EAAMA,EAAKpH,KAAKqO,KAAKzD,EAAKmD,IAAQ,EAElCzD,GADAA,EAAOA,EAAMtK,KAAKqO,KAAKzD,EAAKoD,IAAQ,GACvBhO,KAAKqO,KAAKxD,EAAKkD,IAAQ,EACpCvF,EAAMA,EAAKxI,KAAKqO,KAAKxD,EAAKmD,IAAQ,EAKlC,IAAIc,IAAQtL,GAJZ4D,EAAMA,EAAKpH,KAAKqO,KAAK5D,EAAKyD,IAAQ,GAIZ,KAAa,MAFnC5D,GADAA,EAAOA,EAAMtK,KAAKqO,KAAK5D,EAAK0D,IAAQ,GACvBnO,KAAKqO,KAAK3D,EAAKwD,IAAQ,KAEU,IAAO,EACrD1K,IAFAgF,EAAMA,EAAKxI,KAAKqO,KAAK3D,EAAKyD,IAAQ,IAErB7D,IAAQ,IAAO,IAAMwE,KAAO,IAAO,EAChDA,IAAM,SAEN1H,EAAKpH,KAAKqO,KAAKjC,EAAKM,GAEpBpC,GADAA,EAAMtK,KAAKqO,KAAKjC,EAAKO,IACR3M,KAAKqO,KAAKhC,EAAKK,GAAQ,EACpClE,EAAKxI,KAAKqO,KAAKhC,EAAKM,GACpBvF,EAAMA,EAAKpH,KAAKqO,KAAKpC,EAAKY,GAAQ,EAElCvC,GADAA,EAAOA,EAAMtK,KAAKqO,KAAKpC,EAAKa,GAAQ,GACvB9M,KAAKqO,KAAKnC,EAAKW,GAAQ,EACpCrE,EAAMA,EAAKxI,KAAKqO,KAAKnC,EAAKY,GAAQ,EAClC1F,EAAMA,EAAKpH,KAAKqO,KAAKvC,EAAKkB,GAAQ,EAElC1C,GADAA,EAAOA,EAAMtK,KAAKqO,KAAKvC,EAAKmB,GAAQ,GACvBjN,KAAKqO,KAAKtC,EAAKiB,GAAQ,EACpCxE,EAAMA,EAAKxI,KAAKqO,KAAKtC,EAAKkB,GAAQ,EAClC7F,EAAMA,EAAKpH,KAAKqO,KAAK1C,EAAKwB,GAAQ,EAElC7C,GADAA,EAAOA,EAAMtK,KAAKqO,KAAK1C,EAAKyB,IAAQ,GACvBpN,KAAKqO,KAAKzC,EAAKuB,GAAQ,EACpC3E,EAAMA,EAAKxI,KAAKqO,KAAKzC,EAAKwB,IAAQ,EAClChG,EAAMA,EAAKpH,KAAKqO,KAAK7C,EAAK8B,IAAQ,EAElChD,GADAA,EAAOA,EAAMtK,KAAKqO,KAAK7C,EAAK+B,IAAQ,GACvBvN,KAAKqO,KAAK5C,EAAK6B,IAAQ,EACpC9E,EAAMA,EAAKxI,KAAKqO,KAAK5C,EAAK8B,IAAQ,EAClCnG,EAAMA,EAAKpH,KAAKqO,KAAKhD,EAAKoC,IAAQ,EAElCnD,GADAA,EAAOA,EAAMtK,KAAKqO,KAAKhD,EAAKqC,IAAQ,GACvB1N,KAAKqO,KAAK/C,EAAKmC,IAAQ,EACpCjF,EAAMA,EAAKxI,KAAKqO,KAAK/C,EAAKoC,IAAQ,EAClCtG,EAAMA,EAAKpH,KAAKqO,KAAKnD,EAAK0C,IAAQ,EAElCtD,GADAA,EAAOA,EAAMtK,KAAKqO,KAAKnD,EAAK2C,IAAQ,GACvB7N,KAAKqO,KAAKlD,EAAKyC,IAAQ,EACpCpF,EAAMA,EAAKxI,KAAKqO,KAAKlD,EAAK0C,IAAQ,EAClCzG,EAAMA,EAAKpH,KAAKqO,KAAKtD,EAAKgD,IAAQ,EAElCzD,GADAA,EAAOA,EAAMtK,KAAKqO,KAAKtD,EAAKiD,IAAQ,GACvBhO,KAAKqO,KAAKrD,EAAK+C,IAAQ,EACpCvF,EAAMA,EAAKxI,KAAKqO,KAAKrD,EAAKgD,IAAQ,EAKlC,IAAIe,IAASvL,GAJb4D,EAAMA,EAAKpH,KAAKqO,KAAKzD,EAAKsD,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMtK,KAAKqO,KAAKzD,EAAKuD,IAAQ,GACvBnO,KAAKqO,KAAKxD,EAAKqD,IAAQ,KAEW,IAAO,EACtD1K,IAFAgF,EAAMA,EAAKxI,KAAKqO,KAAKxD,EAAKsD,IAAQ,IAErB7D,IAAQ,IAAO,IAAMyE,KAAQ,IAAO,EACjDA,IAAO,SAEP3H,EAAKpH,KAAKqO,KAAKjC,EAAKS,GAEpBvC,GADAA,EAAMtK,KAAKqO,KAAKjC,EAAKU,IACR9M,KAAKqO,KAAKhC,EAAKQ,GAAQ,EACpCrE,EAAKxI,KAAKqO,KAAKhC,EAAKS,GACpB1F,EAAMA,EAAKpH,KAAKqO,KAAKpC,EAAKe,GAAQ,EAElC1C,GADAA,EAAOA,EAAMtK,KAAKqO,KAAKpC,EAAKgB,GAAQ,GACvBjN,KAAKqO,KAAKnC,EAAKc,GAAQ,EACpCxE,EAAMA,EAAKxI,KAAKqO,KAAKnC,EAAKe,GAAQ,EAClC7F,EAAMA,EAAKpH,KAAKqO,KAAKvC,EAAKqB,GAAQ,EAElC7C,GADAA,EAAOA,EAAMtK,KAAKqO,KAAKvC,EAAKsB,IAAQ,GACvBpN,KAAKqO,KAAKtC,EAAKoB,GAAQ,EACpC3E,EAAMA,EAAKxI,KAAKqO,KAAKtC,EAAKqB,IAAQ,EAClChG,EAAMA,EAAKpH,KAAKqO,KAAK1C,EAAK2B,IAAQ,EAElChD,GADAA,EAAOA,EAAMtK,KAAKqO,KAAK1C,EAAK4B,IAAQ,GACvBvN,KAAKqO,KAAKzC,EAAK0B,IAAQ,EACpC9E,EAAMA,EAAKxI,KAAKqO,KAAKzC,EAAK2B,IAAQ,EAClCnG,EAAMA,EAAKpH,KAAKqO,KAAK7C,EAAKiC,IAAQ,EAElCnD,GADAA,EAAOA,EAAMtK,KAAKqO,KAAK7C,EAAKkC,IAAQ,GACvB1N,KAAKqO,KAAK5C,EAAKgC,IAAQ,EACpCjF,EAAMA,EAAKxI,KAAKqO,KAAK5C,EAAKiC,IAAQ,EAClCtG,EAAMA,EAAKpH,KAAKqO,KAAKhD,EAAKuC,IAAQ,EAElCtD,GADAA,EAAOA,EAAMtK,KAAKqO,KAAKhD,EAAKwC,IAAQ,GACvB7N,KAAKqO,KAAK/C,EAAKsC,IAAQ,EACpCpF,EAAMA,EAAKxI,KAAKqO,KAAK/C,EAAKuC,IAAQ,EAClCzG,EAAMA,EAAKpH,KAAKqO,KAAKnD,EAAK6C,IAAQ,EAElCzD,GADAA,EAAOA,EAAMtK,KAAKqO,KAAKnD,EAAK8C,IAAQ,GACvBhO,KAAKqO,KAAKlD,EAAK4C,IAAQ,EACpCvF,EAAMA,EAAKxI,KAAKqO,KAAKlD,EAAK6C,IAAQ,EAKlC,IAAIgB,IAASxL,GAJb4D,EAAMA,EAAKpH,KAAKqO,KAAKtD,EAAKmD,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMtK,KAAKqO,KAAKtD,EAAKoD,IAAQ,GACvBnO,KAAKqO,KAAKrD,EAAKkD,IAAQ,KAEW,IAAO,EACtD1K,IAFAgF,EAAMA,EAAKxI,KAAKqO,KAAKrD,EAAKmD,IAAQ,IAErB7D,IAAQ,IAAO,IAAM0E,KAAQ,IAAO,EACjDA,IAAO,SAEP5H,EAAKpH,KAAKqO,KAAKjC,EAAKY,GAEpB1C,GADAA,EAAMtK,KAAKqO,KAAKjC,EAAKa,IACRjN,KAAKqO,KAAKhC,EAAKW,GAAQ,EACpCxE,EAAKxI,KAAKqO,KAAKhC,EAAKY,GACpB7F,EAAMA,EAAKpH,KAAKqO,KAAKpC,EAAKkB,GAAQ,EAElC7C,GADAA,EAAOA,EAAMtK,KAAKqO,KAAKpC,EAAKmB,IAAQ,GACvBpN,KAAKqO,KAAKnC,EAAKiB,GAAQ,EACpC3E,EAAMA,EAAKxI,KAAKqO,KAAKnC,EAAKkB,IAAQ,EAClChG,EAAMA,EAAKpH,KAAKqO,KAAKvC,EAAKwB,IAAQ,EAElChD,GADAA,EAAOA,EAAMtK,KAAKqO,KAAKvC,EAAKyB,IAAQ,GACvBvN,KAAKqO,KAAKtC,EAAKuB,IAAQ,EACpC9E,EAAMA,EAAKxI,KAAKqO,KAAKtC,EAAKwB,IAAQ,EAClCnG,EAAMA,EAAKpH,KAAKqO,KAAK1C,EAAK8B,IAAQ,EAElCnD,GADAA,EAAOA,EAAMtK,KAAKqO,KAAK1C,EAAK+B,IAAQ,GACvB1N,KAAKqO,KAAKzC,EAAK6B,IAAQ,EACpCjF,EAAMA,EAAKxI,KAAKqO,KAAKzC,EAAK8B,IAAQ,EAClCtG,EAAMA,EAAKpH,KAAKqO,KAAK7C,EAAKoC,IAAQ,EAElCtD,GADAA,EAAOA,EAAMtK,KAAKqO,KAAK7C,EAAKqC,IAAQ,GACvB7N,KAAKqO,KAAK5C,EAAKmC,IAAQ,EACpCpF,EAAMA,EAAKxI,KAAKqO,KAAK5C,EAAKoC,IAAQ,EAClCzG,EAAMA,EAAKpH,KAAKqO,KAAKhD,EAAK0C,IAAQ,EAElCzD,GADAA,EAAOA,EAAMtK,KAAKqO,KAAKhD,EAAK2C,IAAQ,GACvBhO,KAAKqO,KAAK/C,EAAKyC,IAAQ,EACpCvF,EAAMA,EAAKxI,KAAKqO,KAAK/C,EAAK0C,IAAQ,EAKlC,IAAIiB,IAASzL,GAJb4D,EAAMA,EAAKpH,KAAKqO,KAAKnD,EAAKgD,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMtK,KAAKqO,KAAKnD,EAAKiD,IAAQ,GACvBnO,KAAKqO,KAAKlD,EAAK+C,IAAQ,KAEW,IAAO,EACtD1K,IAFAgF,EAAMA,EAAKxI,KAAKqO,KAAKlD,EAAKgD,IAAQ,IAErB7D,IAAQ,IAAO,IAAM2E,KAAQ,IAAO,EACjDA,IAAO,SAEP7H,EAAKpH,KAAKqO,KAAKjC,EAAKe,GAEpB7C,GADAA,EAAMtK,KAAKqO,KAAKjC,EAAKgB,KACRpN,KAAKqO,KAAKhC,EAAKc,GAAQ,EACpC3E,EAAKxI,KAAKqO,KAAKhC,EAAKe,IACpBhG,EAAMA,EAAKpH,KAAKqO,KAAKpC,EAAKqB,IAAQ,EAElChD,GADAA,EAAOA,EAAMtK,KAAKqO,KAAKpC,EAAKsB,IAAQ,GACvBvN,KAAKqO,KAAKnC,EAAKoB,IAAQ,EACpC9E,EAAMA,EAAKxI,KAAKqO,KAAKnC,EAAKqB,IAAQ,EAClCnG,EAAMA,EAAKpH,KAAKqO,KAAKvC,EAAK2B,IAAQ,EAElCnD,GADAA,EAAOA,EAAMtK,KAAKqO,KAAKvC,EAAK4B,IAAQ,GACvB1N,KAAKqO,KAAKtC,EAAK0B,IAAQ,EACpCjF,EAAMA,EAAKxI,KAAKqO,KAAKtC,EAAK2B,IAAQ,EAClCtG,EAAMA,EAAKpH,KAAKqO,KAAK1C,EAAKiC,IAAQ,EAElCtD,GADAA,EAAOA,EAAMtK,KAAKqO,KAAK1C,EAAKkC,IAAQ,GACvB7N,KAAKqO,KAAKzC,EAAKgC,IAAQ,EACpCpF,EAAMA,EAAKxI,KAAKqO,KAAKzC,EAAKiC,IAAQ,EAClCzG,EAAMA,EAAKpH,KAAKqO,KAAK7C,EAAKuC,IAAQ,EAElCzD,GADAA,EAAOA,EAAMtK,KAAKqO,KAAK7C,EAAKwC,IAAQ,GACvBhO,KAAKqO,KAAK5C,EAAKsC,IAAQ,EACpCvF,EAAMA,EAAKxI,KAAKqO,KAAK5C,EAAKuC,IAAQ,EAKlC,IAAIkB,IAAS1L,GAJb4D,EAAMA,EAAKpH,KAAKqO,KAAKhD,EAAK6C,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMtK,KAAKqO,KAAKhD,EAAK8C,IAAQ,GACvBnO,KAAKqO,KAAK/C,EAAK4C,IAAQ,KAEW,IAAO,EACtD1K,IAFAgF,EAAMA,EAAKxI,KAAKqO,KAAK/C,EAAK6C,IAAQ,IAErB7D,IAAQ,IAAO,IAAM4E,KAAQ,IAAO,EACjDA,IAAO,SAEP9H,EAAKpH,KAAKqO,KAAKjC,EAAKkB,IAEpBhD,GADAA,EAAMtK,KAAKqO,KAAKjC,EAAKmB,KACRvN,KAAKqO,KAAKhC,EAAKiB,IAAQ,EACpC9E,EAAKxI,KAAKqO,KAAKhC,EAAKkB,IACpBnG,EAAMA,EAAKpH,KAAKqO,KAAKpC,EAAKwB,IAAQ,EAElCnD,GADAA,EAAOA,EAAMtK,KAAKqO,KAAKpC,EAAKyB,IAAQ,GACvB1N,KAAKqO,KAAKnC,EAAKuB,IAAQ,EACpCjF,EAAMA,EAAKxI,KAAKqO,KAAKnC,EAAKwB,IAAQ,EAClCtG,EAAMA,EAAKpH,KAAKqO,KAAKvC,EAAK8B,IAAQ,EAElCtD,GADAA,EAAOA,EAAMtK,KAAKqO,KAAKvC,EAAK+B,IAAQ,GACvB7N,KAAKqO,KAAKtC,EAAK6B,IAAQ,EACpCpF,EAAMA,EAAKxI,KAAKqO,KAAKtC,EAAK8B,IAAQ,EAClCzG,EAAMA,EAAKpH,KAAKqO,KAAK1C,EAAKoC,IAAQ,EAElCzD,GADAA,EAAOA,EAAMtK,KAAKqO,KAAK1C,EAAKqC,IAAQ,GACvBhO,KAAKqO,KAAKzC,EAAKmC,IAAQ,EACpCvF,EAAMA,EAAKxI,KAAKqO,KAAKzC,EAAKoC,IAAQ,EAKlC,IAAImB,IAAS3L,GAJb4D,EAAMA,EAAKpH,KAAKqO,KAAK7C,EAAK0C,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMtK,KAAKqO,KAAK7C,EAAK2C,IAAQ,GACvBnO,KAAKqO,KAAK5C,EAAKyC,IAAQ,KAEW,IAAO,EACtD1K,IAFAgF,EAAMA,EAAKxI,KAAKqO,KAAK5C,EAAK0C,IAAQ,IAErB7D,IAAQ,IAAO,IAAM6E,KAAQ,IAAO,EACjDA,IAAO,SAEP/H,EAAKpH,KAAKqO,KAAKjC,EAAKqB,IAEpBnD,GADAA,EAAMtK,KAAKqO,KAAKjC,EAAKsB,KACR1N,KAAKqO,KAAKhC,EAAKoB,IAAQ,EACpCjF,EAAKxI,KAAKqO,KAAKhC,EAAKqB,IACpBtG,EAAMA,EAAKpH,KAAKqO,KAAKpC,EAAK2B,IAAQ,EAElCtD,GADAA,EAAOA,EAAMtK,KAAKqO,KAAKpC,EAAK4B,IAAQ,GACvB7N,KAAKqO,KAAKnC,EAAK0B,IAAQ,EACpCpF,EAAMA,EAAKxI,KAAKqO,KAAKnC,EAAK2B,IAAQ,EAClCzG,EAAMA,EAAKpH,KAAKqO,KAAKvC,EAAKiC,IAAQ,EAElCzD,GADAA,EAAOA,EAAMtK,KAAKqO,KAAKvC,EAAKkC,IAAQ,GACvBhO,KAAKqO,KAAKtC,EAAKgC,IAAQ,EACpCvF,EAAMA,EAAKxI,KAAKqO,KAAKtC,EAAKiC,IAAQ,EAKlC,IAAIoB,IAAS5L,GAJb4D,EAAMA,EAAKpH,KAAKqO,KAAK1C,EAAKuC,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMtK,KAAKqO,KAAK1C,EAAKwC,IAAQ,GACvBnO,KAAKqO,KAAKzC,EAAKsC,IAAQ,KAEW,IAAO,EACtD1K,IAFAgF,EAAMA,EAAKxI,KAAKqO,KAAKzC,EAAKuC,IAAQ,IAErB7D,IAAQ,IAAO,IAAM8E,KAAQ,IAAO,EACjDA,IAAO,SAEPhI,EAAKpH,KAAKqO,KAAKjC,EAAKwB,IAEpBtD,GADAA,EAAMtK,KAAKqO,KAAKjC,EAAKyB,KACR7N,KAAKqO,KAAKhC,EAAKuB,IAAQ,EACpCpF,EAAKxI,KAAKqO,KAAKhC,EAAKwB,IACpBzG,EAAMA,EAAKpH,KAAKqO,KAAKpC,EAAK8B,IAAQ,EAElCzD,GADAA,EAAOA,EAAMtK,KAAKqO,KAAKpC,EAAK+B,IAAQ,GACvBhO,KAAKqO,KAAKnC,EAAK6B,IAAQ,EACpCvF,EAAMA,EAAKxI,KAAKqO,KAAKnC,EAAK8B,IAAQ,EAKlC,IAAIqB,IAAS7L,GAJb4D,EAAMA,EAAKpH,KAAKqO,KAAKvC,EAAKoC,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMtK,KAAKqO,KAAKvC,EAAKqC,IAAQ,GACvBnO,KAAKqO,KAAKtC,EAAKmC,IAAQ,KAEW,IAAO,EACtD1K,IAFAgF,EAAMA,EAAKxI,KAAKqO,KAAKtC,EAAKoC,IAAQ,IAErB7D,IAAQ,IAAO,IAAM+E,KAAQ,IAAO,EACjDA,IAAO,SAEPjI,EAAKpH,KAAKqO,KAAKjC,EAAK2B,IAEpBzD,GADAA,EAAMtK,KAAKqO,KAAKjC,EAAK4B,KACRhO,KAAKqO,KAAKhC,EAAK0B,IAAQ,EACpCvF,EAAKxI,KAAKqO,KAAKhC,EAAK2B,IAKpB,IAAIsB,IAAS9L,GAJb4D,EAAMA,EAAKpH,KAAKqO,KAAKpC,EAAKiC,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMtK,KAAKqO,KAAKpC,EAAKkC,IAAQ,GACvBnO,KAAKqO,KAAKnC,EAAKgC,IAAQ,KAEW,IAAO,EACtD1K,IAFAgF,EAAMA,EAAKxI,KAAKqO,KAAKnC,EAAKiC,IAAQ,IAErB7D,IAAQ,IAAO,IAAMgF,KAAQ,IAAO,EACjDA,IAAO,SAMP,IAAIC,IAAS/L,GAJb4D,EAAKpH,KAAKqO,KAAKjC,EAAK8B,KAIG,KAAa,MAFpC5D,GADAA,EAAMtK,KAAKqO,KAAKjC,EAAK+B,KACRnO,KAAKqO,KAAKhC,EAAK6B,IAAQ,KAEW,IAAO,EA0BtD,OAzBA1K,IAFAgF,EAAKxI,KAAKqO,KAAKhC,EAAK8B,MAEP7D,IAAQ,IAAO,IAAMiF,KAAQ,IAAO,EACjDA,IAAO,SACPhF,EAAE,GAAK6D,GACP7D,EAAE,GAAK+D,GACP/D,EAAE,GAAKgE,GACPhE,EAAE,GAAKiE,GACPjE,EAAE,GAAKkE,GACPlE,EAAE,GAAKmE,GACPnE,EAAE,GAAKoE,GACPpE,EAAE,GAAKqE,GACPrE,EAAE,GAAKsE,GACPtE,EAAE,GAAKuE,GACPvE,EAAE,IAAMwE,GACRxE,EAAE,IAAMyE,GACRzE,EAAE,IAAM0E,GACR1E,EAAE,IAAM2E,GACR3E,EAAE,IAAM4E,GACR5E,EAAE,IAAM6E,GACR7E,EAAE,IAAM8E,GACR9E,EAAE,IAAM+E,GACR/E,EAAE,IAAMgF,GACE,IAAN/L,IACF+G,EAAE,IAAM/G,EACRgD,EAAIrO,UAECqO,GAQT,SAASgJ,EAAUrI,EAAM/C,EAAKoC,GAC5BA,EAAI5N,SAAWwL,EAAIxL,SAAWuO,EAAKvO,SACnC4N,EAAIrO,OAASgP,EAAKhP,OAASiM,EAAIjM,OAI/B,IAFA,IAAIsO,EAAQ,EACRgJ,EAAU,EACLpI,EAAI,EAAGA,EAAIb,EAAIrO,OAAS,EAAGkP,IAAK,CAGvC,IAAIC,EAASmI,EACbA,EAAU,EAGV,IAFA,IAAIlI,EAAgB,SAARd,EACRe,EAAOxH,KAAKgE,IAAIqD,EAAGjD,EAAIjM,OAAS,GAC3B8M,EAAIjF,KAAKsE,IAAI,EAAG+C,EAAIF,EAAKhP,OAAS,GAAI8M,GAAKuC,EAAMvC,IAAK,CAC7D,IAAI5H,EAAIgK,EAAIpC,EAGRnE,GAFoB,EAAhBqG,EAAKtE,MAAMxF,KACI,EAAf+G,EAAIvB,MAAMoC,IAGdmC,EAAS,SAAJtG,EAGTyG,EAAa,UADbH,EAAMA,EAAKG,EAAS,GAIpBkI,IAFAnI,GAHAA,EAAUA,GAAWxG,EAAI,SAAa,GAAM,IAGxBsG,IAAO,IAAO,KAEZ,GACtBE,GAAU,SAEZd,EAAI3D,MAAMwE,GAAKE,EACfd,EAAQa,EACRA,EAASmI,EAQX,OANc,IAAVhJ,EACFD,EAAI3D,MAAMwE,GAAKZ,EAEfD,EAAIrO,SAGCqO,EAAIpB,QAAQA,CAGrB,SAASsK,EAAYvI,EAAM/C,EAAKoC,GAI9B,OAAOgJ,EAASrI,EAAM/C,EAAKoC,GAsB7B,SAASmJ,EAAMC,EAAGC,GAChB3V,KAAK0V,EAAIA,EACT1V,KAAK2V,EAAIA,EAzEN7P,KAAKqO,OACRhE,EAAcnD,GAmDhB1E,EAAGvE,UAAU6R,MAAQ,SAAgB1L,EAAKoC,GACxC,IACIzC,EAAM7J,KAAK/B,OAASiM,EAAIjM,OAW5B,OAVoB,KAAhB+B,KAAK/B,QAAgC,KAAfiM,EAAIjM,OACtBkS,EAAYnQ,KAAMkK,EAAKoC,GACpBzC,EAAM,GACTmD,EAAWhN,KAAMkK,EAAKoC,GACnBzC,EAAM,KACTyL,EAAStV,KAAMkK,EAAKoC,GAEpBkJ,EAAWxV,KAAMkK,EAAKoC,EAGvBoB,EAWT+H,EAAK1R,UAAU8R,QAAU,SAAkBC,GAGzC,IAFA,IAAI3H,EAAI,IAAIrK,MAAMgS,GACdC,EAAIzN,EAAGvE,UAAUmK,WAAW4H,GAAK,EAC5B3S,EAAI,EAAGA,EAAI2S,EAAG3S,IACrBgL,EAAEhL,GAAKnD,KAAKgW,OAAO7S,EAAG4S,EAAGD,GAG3B,OAAO3H,GAITsH,EAAK1R,UAAUiS,OAAS,SAAiBN,EAAGK,EAAGD,GAC7C,GAAU,IAANJ,GAAWA,IAAMI,EAAI,EAAG,OAAOJ,EAGnC,IADA,IAAIO,EAAK,EACA9S,EAAI,EAAGA,EAAI4S,EAAG5S,IACrB8S,IAAW,EAAJP,IAAWK,EAAI5S,EAAI,EAC1BuS,IAAM,EAGR,OAAOO,GAKTR,EAAK1R,UAAUmS,QAAU,SAAkBC,EAAKC,EAAKC,EAAKC,EAAMC,EAAMT,GACpE,IAAK,IAAI3S,EAAI,EAAGA,EAAI2S,EAAG3S,IACrBmT,EAAKnT,GAAKiT,EAAID,EAAIhT,IAClBoT,EAAKpT,GAAKkT,EAAIF,EAAIhT,KAItBsS,EAAK1R,UAAUyS,UAAY,SAAoBJ,EAAKC,EAAKC,EAAMC,EAAMT,EAAGK,GACtEnW,KAAKkW,QAAQC,EAAKC,EAAKC,EAAKC,EAAMC,EAAMT,GAExC,IAAK,IAAIjP,EAAI,EAAGA,EAAIiP,EAAGjP,IAAM,EAM3B,IALA,IAAIkP,EAAIlP,GAAK,EAET4P,EAAQ3Q,KAAK4Q,IAAI,EAAI5Q,KAAK6Q,GAAKZ,GAC/Ba,EAAQ9Q,KAAK+Q,IAAI,EAAI/Q,KAAK6Q,GAAKZ,GAE1Be,EAAI,EAAGA,EAAIhB,EAAGgB,GAAKf,EAI1B,IAHA,IAAIgB,EAASN,EACTO,EAASJ,EAEJ7L,EAAI,EAAGA,EAAIlE,EAAGkE,IAAK,CAC1B,IAAIkM,EAAKX,EAAKQ,EAAI/L,GACdmM,EAAKX,EAAKO,EAAI/L,GAEdoM,EAAKb,EAAKQ,EAAI/L,EAAIlE,GAClBuQ,EAAKb,EAAKO,EAAI/L,EAAIlE,GAElBwQ,EAAKN,EAASI,EAAKH,EAASI,EAEhCA,EAAKL,EAASK,EAAKJ,EAASG,EAC5BA,EAAKE,EAELf,EAAKQ,EAAI/L,GAAKkM,EAAKE,EACnBZ,EAAKO,EAAI/L,GAAKmM,EAAKE,EAEnBd,EAAKQ,EAAI/L,EAAIlE,GAAKoQ,EAAKE,EACvBZ,EAAKO,EAAI/L,EAAIlE,GAAKqQ,EAAKE,EAGnBrM,IAAMgL,IACRsB,EAAKZ,EAAQM,EAASH,EAAQI,EAE9BA,EAASP,EAAQO,EAASJ,EAAQG,EAClCA,EAASM,KAOnB5B,EAAK1R,UAAUuT,YAAc,SAAsBC,EAAGC,GACpD,IAAI1B,EAAqB,EAAjBhQ,KAAKsE,IAAIoN,EAAGD,GAChBE,EAAU,EAAJ3B,EACN3S,EAAI,EACR,IAAK2S,EAAIA,EAAI,EAAI,EAAGA,EAAGA,KAAU,EAC/B3S,IAGF,OAAO,GAAKA,EAAI,EAAIsU,GAGtBhC,EAAK1R,UAAU2T,UAAY,SAAoBtB,EAAKC,EAAKP,GACvD,KAAIA,GAAK,GAET,IAAK,IAAI3S,EAAI,EAAGA,EAAI2S,EAAI,EAAG3S,IAAK,CAC9B,IAAIgL,EAAIiI,EAAIjT,GAEZiT,EAAIjT,GAAKiT,EAAIN,EAAI3S,EAAI,GACrBiT,EAAIN,EAAI3S,EAAI,GAAKgL,EAEjBA,EAAIkI,EAAIlT,GAERkT,EAAIlT,IAAMkT,EAAIP,EAAI3S,EAAI,GACtBkT,EAAIP,EAAI3S,EAAI,IAAMgL,IAItBsH,EAAK1R,UAAU4T,aAAe,SAAuBC,EAAI9B,GAEvD,IADA,IAAIvJ,EAAQ,EACHpJ,EAAI,EAAGA,EAAI2S,EAAI,EAAG3S,IAAK,CAC9B,IAAI6H,EAAoC,KAAhClF,KAAK1D,MAAMwV,EAAG,EAAIzU,EAAI,GAAK2S,GACjChQ,KAAK1D,MAAMwV,EAAG,EAAIzU,GAAK2S,GACvBvJ,EAEFqL,EAAGzU,GAAS,SAAJ6H,EAGNuB,EADEvB,EAAI,SACE,EAEAA,EAAI,SAAY,CAAC,CAI7B,OAAO4M,GAGTnC,EAAK1R,UAAU8T,WAAa,SAAqBD,EAAI/N,EAAKuM,EAAKN,GAE7D,IADA,IAAIvJ,EAAQ,EACHpJ,EAAI,EAAGA,EAAI0G,EAAK1G,IACvBoJ,GAAyB,EAARqL,EAAGzU,GAEpBiT,EAAI,EAAIjT,GAAa,KAARoJ,EAAgBA,KAAkB,GAC/C6J,EAAI,EAAIjT,EAAI,GAAa,KAARoJ,EAAgBA,KAAkB,GAIrD,IAAKpJ,EAAI,EAAI0G,EAAK1G,EAAI2S,IAAK3S,EACzBiT,EAAIjT,GAAK,EAGX2E,EAAiB,IAAVyE,GACPzE,EAA6B,KAAb,KAARyE,KAGVkJ,EAAK1R,UAAU+T,KAAO,SAAehC,GAEnC,IADA,IAAIiC,EAAK,IAAIjU,MAAMgS,GACV3S,EAAI,EAAGA,EAAI2S,EAAG3S,IACrB4U,EAAG5U,GAAK,EAGV,OAAO4U,GAGTtC,EAAK1R,UAAUiU,KAAO,SAAetC,EAAGC,EAAGrJ,GACzC,IAAIwJ,EAAI,EAAI9V,KAAKsX,YAAY5B,EAAEzX,OAAQ0X,EAAE1X,QAErCkY,EAAMnW,KAAK6V,QAAQC,GAEnBmC,EAAIjY,KAAK8X,KAAKhC,GAEdM,EAAM,IAAItS,MAAMgS,GAChBoC,EAAO,IAAIpU,MAAMgS,GACjBqC,EAAO,IAAIrU,MAAMgS,GAEjBsC,EAAO,IAAItU,MAAMgS,GACjBuC,EAAQ,IAAIvU,MAAMgS,GAClBwC,EAAQ,IAAIxU,MAAMgS,GAElByC,EAAOjM,EAAI3D,MACf4P,EAAKta,OAAS6X,EAEd9V,KAAK6X,WAAWnC,EAAE/M,MAAO+M,EAAEzX,OAAQmY,EAAKN,GACxC9V,KAAK6X,WAAWlC,EAAEhN,MAAOgN,EAAE1X,OAAQma,EAAMtC,GAEzC9V,KAAKwW,UAAUJ,EAAK6B,EAAGC,EAAMC,EAAMrC,EAAGK,GACtCnW,KAAKwW,UAAU4B,EAAMH,EAAGI,EAAOC,EAAOxC,EAAGK,GAEzC,IAAK,IAAIhT,EAAI,EAAGA,EAAI2S,EAAG3S,IAAK,CAC1B,IAAIkU,EAAKa,EAAK/U,GAAKkV,EAAMlV,GAAKgV,EAAKhV,GAAKmV,EAAMnV,GAC9CgV,EAAKhV,GAAK+U,EAAK/U,GAAKmV,EAAMnV,GAAKgV,EAAKhV,GAAKkV,EAAMlV,GAC/C+U,EAAK/U,GAAKkU,EAUZ,OAPArX,KAAK0X,UAAUQ,EAAMC,EAAMrC,GAC3B9V,KAAKwW,UAAU0B,EAAMC,EAAMI,EAAMN,EAAGnC,EAAGK,GACvCnW,KAAK0X,UAAUa,EAAMN,EAAGnC,GACxB9V,KAAK2X,aAAaY,EAAMzC,GAExBxJ,EAAI5N,SAAWgX,EAAEhX,SAAWiX,EAAEjX,SAC9B4N,EAAIrO,OAASyX,EAAEzX,OAAS0X,EAAE1X,OACnBqO,EAAIpB,QAAQA,EAIrB5C,EAAGvE,UAAUnF,IAAM,SAAcsL,GAC/B,IAAIoC,EAAM,IAAIhE,EAAG,MAEjB,OADAgE,EAAI3D,MAAQ,IAAI7E,MAAM9D,KAAK/B,OAASiM,EAAIjM,QACjC+B,KAAK4V,MAAM1L,EAAKoC,IAIzBhE,EAAGvE,UAAUyU,KAAO,SAAetO,GACjC,IAAIoC,EAAM,IAAIhE,EAAG,MAEjB,OADAgE,EAAI3D,MAAQ,IAAI7E,MAAM9D,KAAK/B,OAASiM,EAAIjM,QACjCuX,EAAWxV,KAAMkK,EAAKoC,IAI/BhE,EAAGvE,UAAUoQ,KAAO,SAAejK,GACjC,OAAOlK,KAAK4L,QAAQgK,MAAM1L,EAAKlK,KAAKA,EAGtCsI,EAAGvE,UAAUwH,MAAQ,SAAgBrB,GACnC,IAAIuO,EAAWvO,EAAM,EACjBuO,IAAUvO,GAAOA,GAErBpC,EAAsB,iBAARoC,GACdpC,EAAOoC,EAAM,UAIb,IADA,IAAIqC,EAAQ,EACHpJ,EAAI,EAAGA,EAAInD,KAAK/B,OAAQkF,IAAK,CACpC,IAAI6H,GAAqB,EAAhBhL,KAAK2I,MAAMxF,IAAU+G,EAC1BgD,GAAU,SAAJlC,IAA0B,SAARuB,GAC5BA,IAAU,GACVA,GAAUvB,EAAI,SAAa,EAE3BuB,GAASW,IAAO,GAChBlN,KAAK2I,MAAMxF,GAAU,SAAL+J,EAQlB,OALc,IAAVX,IACFvM,KAAK2I,MAAMxF,GAAKoJ,EAChBvM,KAAK/B,UAGAwa,EAAWzY,KAAK6O,OAAS7O,IAAIA,EAGtCsI,EAAGvE,UAAU2U,KAAO,SAAexO,GACjC,OAAOlK,KAAK4L,QAAQL,MAAMrB,IAI5B5B,EAAGvE,UAAU4U,IAAM,WACjB,OAAO3Y,KAAKpB,IAAIoB,KAAKA,EAIvBsI,EAAGvE,UAAU6U,KAAO,WAClB,OAAO5Y,KAAKmU,KAAKnU,KAAK4L,QAAQA,EAIhCtD,EAAGvE,UAAU0H,IAAM,SAAcvB,GAC/B,IAAIc,EA7xCN,SAAqBd,GAGnB,IAFA,IAAIc,EAAI,IAAIlH,MAAMoG,EAAImE,aAEb0B,EAAM,EAAGA,EAAM/E,EAAE/M,OAAQ8R,IAAO,CACvC,IAAI9E,EAAO8E,EAAM,GAAM,EACnBC,EAAOD,EAAM,GAEjB/E,EAAE+E,GAAQ7F,EAAIvB,MAAMsC,KAAS+E,EAAQ,EAGvC,OAAOhF,EAmxCC6N,CAAW3O,GACnB,GAAiB,IAAbc,EAAE/M,OAAc,OAAO,IAAIqK,EAAG,GAIlC,IADA,IAAIoF,EAAM1N,KACDmD,EAAI,EAAGA,EAAI6H,EAAE/M,QACP,IAAT+M,EAAE7H,GADsBA,IAAKuK,EAAMA,EAAIiL,OAI7C,KAAMxV,EAAI6H,EAAE/M,OACV,IAAK,IAAI6a,EAAIpL,EAAIiL,MAAOxV,EAAI6H,EAAE/M,OAAQkF,IAAK2V,EAAIA,EAAEH,MAClC,IAAT3N,EAAE7H,KAENuK,EAAMA,EAAI9O,IAAIka,IAIlB,OAAOpL,GAITpF,EAAGvE,UAAUgV,OAAS,SAAiBC,GACrClR,EAAuB,iBAATkR,GAAqBA,GAAQ,GAC3C,IAGI7V,EAHAyD,EAAIoS,EAAO,GACXnS,GAAKmS,EAAOpS,GAAK,GACjBqS,EAAa,WAAe,GAAKrS,GAAQ,GAAKA,EAGlD,GAAU,IAANA,EAAS,CACX,IAAI2F,EAAQ,EAEZ,IAAKpJ,EAAI,EAAGA,EAAInD,KAAK/B,OAAQkF,IAAK,CAChC,IAAI+V,EAAWlZ,KAAK2I,MAAMxF,GAAK8V,EAC3B3P,GAAsB,EAAhBtJ,KAAK2I,MAAMxF,IAAU+V,GAAatS,EAC5C5G,KAAK2I,MAAMxF,GAAKmG,EAAIiD,EACpBA,EAAQ2M,IAAc,GAAKtS,EAGzB2F,IACFvM,KAAK2I,MAAMxF,GAAKoJ,EAChBvM,KAAK/B,UAIT,GAAU,IAAN4I,EAAS,CACX,IAAK1D,EAAInD,KAAK/B,OAAS,EAAGkF,GAAK,EAAGA,IAChCnD,KAAK2I,MAAMxF,EAAI0D,GAAK7G,KAAK2I,MAAMxF,GAGjC,IAAKA,EAAI,EAAGA,EAAI0D,EAAG1D,IACjBnD,KAAK2I,MAAMxF,GAAK,EAGlBnD,KAAK/B,QAAU4I,EAGjB,OAAO7G,KAAKkL,QAAQA,EAGtB5C,EAAGvE,UAAUoV,MAAQ,SAAgBH,GAGnC,OADAlR,EAAyB,IAAlB9H,KAAKtB,UACLsB,KAAK+Y,OAAOC,IAMrB1Q,EAAGvE,UAAUqV,OAAS,SAAiBJ,EAAMK,EAAMC,GAEjD,IAAIC,EADJzR,EAAuB,iBAATkR,GAAqBA,GAAQ,GAGzCO,EADEF,GACGA,EAAQA,EAAO,IAAO,GAEvB,EAGN,IAAIzS,EAAIoS,EAAO,GACXnS,EAAIf,KAAKgE,KAAKkP,EAAOpS,GAAK,GAAI5G,KAAK/B,QACnCub,EAAO,SAAc,WAAc5S,GAAMA,EACzC6S,EAAcH,EAMlB,GAJAC,GAAK1S,EACL0S,EAAIzT,KAAKsE,IAAI,EAAGmP,GAGZE,EAAa,CACf,IAAK,IAAItW,EAAI,EAAGA,EAAI0D,EAAG1D,IACrBsW,EAAY9Q,MAAMxF,GAAKnD,KAAK2I,MAAMxF,GAEpCsW,EAAYxb,OAAS4I,EAGvB,GAAU,IAANA,QAEG,GAAI7G,KAAK/B,OAAS4I,EAEvB,IADA7G,KAAK/B,QAAU4I,EACV1D,EAAI,EAAGA,EAAInD,KAAK/B,OAAQkF,IAC3BnD,KAAK2I,MAAMxF,GAAKnD,KAAK2I,MAAMxF,EAAI0D,QAGjC7G,KAAK2I,MAAM,GAAK,EAChB3I,KAAK/B,OAAS,EAGhB,IAAIsO,EAAQ,EACZ,IAAKpJ,EAAInD,KAAK/B,OAAS,EAAGkF,GAAK,IAAgB,IAAVoJ,GAAepJ,GAAKoW,GAAIpW,IAAK,CAChE,IAAImI,EAAuB,EAAhBtL,KAAK2I,MAAMxF,GACtBnD,KAAK2I,MAAMxF,GAAMoJ,GAAU,GAAK3F,EAAO0E,IAAS1E,EAChD2F,EAAQjB,EAAOkO,EAajB,OATIC,GAAyB,IAAVlN,IACjBkN,EAAY9Q,MAAM8Q,EAAYxb,UAAYsO,GAGxB,IAAhBvM,KAAK/B,SACP+B,KAAK2I,MAAM,GAAK,EAChB3I,KAAK/B,OAAS,GAGT+B,KAAKkL,QAAQA,EAGtB5C,EAAGvE,UAAU2V,MAAQ,SAAgBV,EAAMK,EAAMC,GAG/C,OADAxR,EAAyB,IAAlB9H,KAAKtB,UACLsB,KAAKoZ,OAAOJ,EAAMK,EAAMC,IAIjChR,EAAGvE,UAAU4V,KAAO,SAAeX,GACjC,OAAOhZ,KAAK4L,QAAQuN,MAAMH,IAG5B1Q,EAAGvE,UAAU6V,MAAQ,SAAgBZ,GACnC,OAAOhZ,KAAK4L,QAAQmN,OAAOC,IAI7B1Q,EAAGvE,UAAU8V,KAAO,SAAeb,GACjC,OAAOhZ,KAAK4L,QAAQ8N,MAAMV,IAG5B1Q,EAAGvE,UAAU+V,MAAQ,SAAgBd,GACnC,OAAOhZ,KAAK4L,QAAQwN,OAAOJ,IAI7B1Q,EAAGvE,UAAU4K,MAAQ,SAAgBoB,GACnCjI,EAAsB,iBAARiI,GAAoBA,GAAO,GACzC,IAAInJ,EAAImJ,EAAM,GACVlJ,GAAKkJ,EAAMnJ,GAAK,GAChBkS,EAAI,GAAKlS,EAGb,QAAI5G,KAAK/B,QAAU4I,OAGX7G,KAAK2I,MAAM9B,GAELiS,IAIhBxQ,EAAGvE,UAAUgW,OAAS,SAAiBf,GACrClR,EAAuB,iBAATkR,GAAqBA,GAAQ,GAC3C,IAAIpS,EAAIoS,EAAO,GACXnS,GAAKmS,EAAOpS,GAAK,GAIrB,GAFAkB,EAAyB,IAAlB9H,KAAKtB,SAAgB,2CAExBsB,KAAK/B,QAAU4I,EACjB,OAAO7G,KAQT,GALU,IAAN4G,GACFC,IAEF7G,KAAK/B,OAAS6H,KAAKgE,IAAIjD,EAAG7G,KAAK/B,QAErB,IAAN2I,EAAS,CACX,IAAI4S,EAAO,SAAc,WAAc5S,GAAMA,EAC7C5G,KAAK2I,MAAM3I,KAAK/B,OAAS,IAAMub,EAGjC,OAAOxZ,KAAKkL,QAAQA,EAItB5C,EAAGvE,UAAUiW,MAAQ,SAAgBhB,GACnC,OAAOhZ,KAAK4L,QAAQmO,OAAOf,IAI7B1Q,EAAGvE,UAAU2K,MAAQ,SAAgBxE,GAGnC,OAFApC,EAAsB,iBAARoC,GACdpC,EAAOoC,EAAM,UACTA,EAAM,EAAUlK,KAAKia,OAAO/P,GAGV,IAAlBlK,KAAKtB,SACa,IAAhBsB,KAAK/B,SAAiC,EAAhB+B,KAAK2I,MAAM,KAAWuB,GAC9ClK,KAAK2I,MAAM,GAAKuB,GAAuB,EAAhBlK,KAAK2I,MAAM,IAClC3I,KAAKtB,SAAW,EACTsB,OAGTA,KAAKtB,SAAW,EAChBsB,KAAKia,MAAM/P,GACXlK,KAAKtB,SAAW,EACTsB,MAIFA,KAAKwL,OAAOtB,IAGrB5B,EAAGvE,UAAUyH,OAAS,SAAiBtB,GACrClK,KAAK2I,MAAM,IAAMuB,EAGjB,IAAK,IAAI/G,EAAI,EAAGA,EAAInD,KAAK/B,QAAU+B,KAAK2I,MAAMxF,IAAM,SAAWA,IAC7DnD,KAAK2I,MAAMxF,IAAM,SACbA,IAAMnD,KAAK/B,OAAS,EACtB+B,KAAK2I,MAAMxF,EAAI,GAAK,EAEpBnD,KAAK2I,MAAMxF,EAAI,KAKnB,OAFAnD,KAAK/B,OAAS6H,KAAKsE,IAAIpK,KAAK/B,OAAQkF,EAAI,GAEjCnD,IAAIA,EAIbsI,EAAGvE,UAAUkW,MAAQ,SAAgB/P,GAGnC,GAFApC,EAAsB,iBAARoC,GACdpC,EAAOoC,EAAM,UACTA,EAAM,EAAG,OAAOlK,KAAK0O,OAAOxE,GAEhC,GAAsB,IAAlBlK,KAAKtB,SAIP,OAHAsB,KAAKtB,SAAW,EAChBsB,KAAK0O,MAAMxE,GACXlK,KAAKtB,SAAW,EACTsB,KAKT,GAFAA,KAAK2I,MAAM,IAAMuB,EAEG,IAAhBlK,KAAK/B,QAAgB+B,KAAK2I,MAAM,GAAK,EACvC3I,KAAK2I,MAAM,IAAM3I,KAAK2I,MAAM,GAC5B3I,KAAKtB,SAAW,OAGhB,IAAK,IAAIyE,EAAI,EAAGA,EAAInD,KAAK/B,QAAU+B,KAAK2I,MAAMxF,GAAK,EAAGA,IACpDnD,KAAK2I,MAAMxF,IAAM,SACjBnD,KAAK2I,MAAMxF,EAAI,IAAM,EAIzB,OAAOnD,KAAKkL,QAAQA,EAGtB5C,EAAGvE,UAAUmW,KAAO,SAAehQ,GACjC,OAAOlK,KAAK4L,QAAQ8C,MAAMxE,IAG5B5B,EAAGvE,UAAUoW,KAAO,SAAejQ,GACjC,OAAOlK,KAAK4L,QAAQqO,MAAM/P,IAG5B5B,EAAGvE,UAAUqW,KAAO,WAGlB,OAFApa,KAAKtB,SAAW,EAETsB,IAAIA,EAGbsI,EAAGvE,UAAUyK,IAAM,WACjB,OAAOxO,KAAK4L,QAAQwO,MAAMA,EAG5B9R,EAAGvE,UAAUsW,aAAe,SAAuBnQ,EAAKtL,EAAKmP,GAC3D,IACI5K,EAIA6H,EALAnB,EAAMK,EAAIjM,OAAS8P,EAGvB/N,KAAK6L,QAAQhC,GAGb,IAAI0C,EAAQ,EACZ,IAAKpJ,EAAI,EAAGA,EAAI+G,EAAIjM,OAAQkF,IAAK,CAC/B6H,GAA6B,EAAxBhL,KAAK2I,MAAMxF,EAAI4K,IAAcxB,EAClC,IAAIjC,GAAwB,EAAfJ,EAAIvB,MAAMxF,IAAUvE,EAEjC2N,IADAvB,GAAa,SAARV,IACS,KAAQA,EAAQ,SAAa,GAC3CtK,KAAK2I,MAAMxF,EAAI4K,GAAa,SAAJ/C,EAE1B,KAAO7H,EAAInD,KAAK/B,OAAS8P,EAAO5K,IAE9BoJ,GADAvB,GAA6B,EAAxBhL,KAAK2I,MAAMxF,EAAI4K,IAAcxB,IACrB,GACbvM,KAAK2I,MAAMxF,EAAI4K,GAAa,SAAJ/C,EAG1B,GAAc,IAAVuB,EAAa,OAAOvM,KAAKkL,SAK7B,IAFApD,GAAkB,IAAXyE,GACPA,EAAQ,EACHpJ,EAAI,EAAGA,EAAInD,KAAK/B,OAAQkF,IAE3BoJ,GADAvB,IAAsB,EAAhBhL,KAAK2I,MAAMxF,IAAUoJ,IACd,GACbvM,KAAK2I,MAAMxF,GAAS,SAAJ6H,EAIlB,OAFAhL,KAAKtB,SAAW,EAETsB,KAAKkL,QAAQA,EAGtB5C,EAAGvE,UAAUuW,SAAW,SAAmBpQ,EAAKqQ,GAC9C,IAAIxM,GAAQ/N,KAAK/B,OAASiM,EAAIjM,QAE1BoD,EAAIrB,KAAK4L,QACTtK,EAAI4I,EAGJsQ,EAA8B,EAAxBlZ,EAAEqH,MAAMrH,EAAErD,OAAS,GAGf,KADd8P,EAAQ,GADM/N,KAAKkO,WAAWsM,MAG5BlZ,EAAIA,EAAEsY,MAAM7L,GACZ1M,EAAE0X,OAAOhL,GACTyM,EAA8B,EAAxBlZ,EAAEqH,MAAMrH,EAAErD,OAAS,IAI3B,IACI6a,EADAtB,EAAInW,EAAEpD,OAASqD,EAAErD,OAGrB,GAAa,QAATsc,EAAgB,EAClBzB,EAAI,IAAIxQ,EAAG,OACTrK,OAASuZ,EAAI,EACfsB,EAAEnQ,MAAQ,IAAI7E,MAAMgV,EAAE7a,QACtB,IAAK,IAAIkF,EAAI,EAAGA,EAAI2V,EAAE7a,OAAQkF,IAC5B2V,EAAEnQ,MAAMxF,GAAK,CAAC,CAIlB,IAAIsX,EAAOpZ,EAAEuK,QAAQyO,aAAa/Y,EAAG,EAAGkW,GAClB,IAAlBiD,EAAK/b,WACP2C,EAAIoZ,EACA3B,IACFA,EAAEnQ,MAAM6O,GAAK,IAIjB,IAAK,IAAIzM,EAAIyM,EAAI,EAAGzM,GAAK,EAAGA,IAAK,CAC/B,IAAI2P,EAAmC,UAAL,EAAxBrZ,EAAEsH,MAAMrH,EAAErD,OAAS8M,KACE,EAA5B1J,EAAEsH,MAAMrH,EAAErD,OAAS8M,EAAI,IAO1B,IAHA2P,EAAK5U,KAAKgE,IAAK4Q,EAAKF,EAAO,EAAG,UAE9BnZ,EAAEgZ,aAAa/Y,EAAGoZ,EAAI3P,GACA,IAAf1J,EAAE3C,UACPgc,IACArZ,EAAE3C,SAAW,EACb2C,EAAEgZ,aAAa/Y,EAAG,EAAGyJ,GAChB1J,EAAEmB,WACLnB,EAAE3C,UAAY,GAGdoa,IACFA,EAAEnQ,MAAMoC,GAAK2P,GAajB,OAVI5B,GACFA,EAAE5N,SAEJ7J,EAAE6J,SAGW,QAATqP,GAA4B,IAAVxM,GACpB1M,EAAE+X,OAAOrL,GAGJ,CACL7O,IAAK4Z,GAAK,KACVha,IAAKuC,IAQTiH,EAAGvE,UAAU4W,OAAS,SAAiBzQ,EAAKqQ,EAAMK,GAGhD,OAFA9S,GAAQoC,EAAI1H,UAERxC,KAAKwC,SACA,CACLtD,IAAK,IAAIoJ,EAAG,GACZxJ,IAAK,IAAIwJ,EAAG,IAKM,IAAlBtI,KAAKtB,UAAmC,IAAjBwL,EAAIxL,UAC7BgP,EAAM1N,KAAK+O,MAAM4L,OAAOzQ,EAAKqQ,GAEhB,QAATA,IACFrb,EAAMwO,EAAIxO,IAAI6P,OAGH,QAATwL,IACFzb,EAAM4O,EAAI5O,IAAIiQ,MACV6L,GAA6B,IAAjB9b,EAAIJ,UAClBI,EAAImR,KAAK/F,IAIN,CACLhL,IAAKA,EACLJ,IAAKA,IAIa,IAAlBkB,KAAKtB,UAAmC,IAAjBwL,EAAIxL,UAC7BgP,EAAM1N,KAAK2a,OAAOzQ,EAAI6E,MAAOwL,GAEhB,QAATA,IACFrb,EAAMwO,EAAIxO,IAAI6P,OAGT,CACL7P,IAAKA,EACLJ,IAAK4O,EAAI5O,MAI0B,IAAlCkB,KAAKtB,SAAWwL,EAAIxL,WACvBgP,EAAM1N,KAAK+O,MAAM4L,OAAOzQ,EAAI6E,MAAOwL,GAEtB,QAATA,IACFzb,EAAM4O,EAAI5O,IAAIiQ,MACV6L,GAA6B,IAAjB9b,EAAIJ,UAClBI,EAAIoR,KAAKhG,IAIN,CACLhL,IAAKwO,EAAIxO,IACTJ,IAAKA,IAOLoL,EAAIjM,OAAS+B,KAAK/B,QAAU+B,KAAKuK,IAAIL,GAAO,EACvC,CACLhL,IAAK,IAAIoJ,EAAG,GACZxJ,IAAKkB,MAKU,IAAfkK,EAAIjM,OACO,QAATsc,EACK,CACLrb,IAAKc,KAAK6a,KAAK3Q,EAAIvB,MAAM,IACzB7J,IAAK,MAII,QAATyb,EACK,CACLrb,IAAK,KACLJ,IAAK,IAAIwJ,EAAGtI,KAAK0M,MAAMxC,EAAIvB,MAAM,MAI9B,CACLzJ,IAAKc,KAAK6a,KAAK3Q,EAAIvB,MAAM,IACzB7J,IAAK,IAAIwJ,EAAGtI,KAAK0M,MAAMxC,EAAIvB,MAAM,MAI9B3I,KAAKsa,SAASpQ,EAAKqQ,GAlF1B,IAAIrb,EAAKJ,EAAK4O,GAsFhBpF,EAAGvE,UAAU7E,IAAM,SAAcgL,GAC/B,OAAOlK,KAAK2a,OAAOzQ,EAAK,UAAchL,GAAGA,EAI3CoJ,EAAGvE,UAAUjF,IAAM,SAAcoL,GAC/B,OAAOlK,KAAK2a,OAAOzQ,EAAK,UAAcpL,GAAGA,EAG3CwJ,EAAGvE,UAAU+W,KAAO,SAAe5Q,GACjC,OAAOlK,KAAK2a,OAAOzQ,EAAK,UAAapL,GAAGA,EAI1CwJ,EAAGvE,UAAUgX,SAAW,SAAmB7Q,GACzC,IAAI8Q,EAAKhb,KAAK2a,OAAOzQ,GAGrB,GAAI8Q,EAAGlc,IAAI0D,SAAU,OAAOwY,EAAG9b,IAE/B,IAAIJ,EAA0B,IAApBkc,EAAG9b,IAAIR,SAAiBsc,EAAGlc,IAAIoR,KAAKhG,GAAO8Q,EAAGlc,IAEpDmc,EAAO/Q,EAAI4P,MAAM,GACjBoB,EAAKhR,EAAIiR,MAAM,GACf5Q,EAAMzL,EAAIyL,IAAI0Q,GAGlB,OAAI1Q,EAAM,GAAa,IAAP2Q,GAAoB,IAAR3Q,EAAmByQ,EAAG9b,IAGvB,IAApB8b,EAAG9b,IAAIR,SAAiBsc,EAAG9b,IAAI+a,MAAM,GAAKe,EAAG9b,IAAIwP,MAAM,EAAE,EAGlEpG,EAAGvE,UAAU2I,MAAQ,SAAgBxC,GACnC,IAAIuO,EAAWvO,EAAM,EACjBuO,IAAUvO,GAAOA,GAErBpC,EAAOoC,GAAO,UAId,IAHA,IAAI4M,GAAK,GAAK,IAAM5M,EAEhBkR,EAAM,EACDjY,EAAInD,KAAK/B,OAAS,EAAGkF,GAAK,EAAGA,IACpCiY,GAAOtE,EAAIsE,GAAuB,EAAhBpb,KAAK2I,MAAMxF,KAAW+G,EAG1C,OAAOuO,GAAY2C,EAAMA,GAI3B9S,EAAGvE,UAAUsX,KAAO,SAAenR,GACjC,OAAOlK,KAAK0M,MAAMxC,IAIpB5B,EAAGvE,UAAU4I,MAAQ,SAAgBzC,GACnC,IAAIuO,EAAWvO,EAAM,EACjBuO,IAAUvO,GAAOA,GAErBpC,EAAOoC,GAAO,UAGd,IADA,IAAIqC,EAAQ,EACHpJ,EAAInD,KAAK/B,OAAS,EAAGkF,GAAK,EAAGA,IAAK,CACzC,IAAI6H,GAAqB,EAAhBhL,KAAK2I,MAAMxF,IAAkB,SAARoJ,EAC9BvM,KAAK2I,MAAMxF,GAAM6H,EAAId,EAAO,EAC5BqC,EAAQvB,EAAId,EAId,OADAlK,KAAKkL,SACEuN,EAAWzY,KAAK6O,OAAS7O,IAAIA,EAGtCsI,EAAGvE,UAAU8W,KAAO,SAAe3Q,GACjC,OAAOlK,KAAK4L,QAAQe,MAAMzC,IAG5B5B,EAAGvE,UAAUuX,KAAO,SAAexE,GACjChP,EAAsB,IAAfgP,EAAEpY,UACToJ,GAAQgP,EAAEtU,UAEV,IAAIkT,EAAI1V,KACJ2V,EAAImB,EAAElL,QAGR8J,EADiB,IAAfA,EAAEhX,SACAgX,EAAEoF,KAAKhE,GAEPpB,EAAE9J,QAaR,IATA,IAAI2P,EAAI,IAAIjT,EAAG,GACXkT,EAAI,IAAIlT,EAAG,GAGXmT,EAAI,IAAInT,EAAG,GACXoT,EAAI,IAAIpT,EAAG,GAEXqT,EAAI,EAEDjG,EAAEkG,UAAYjG,EAAEiG,UACrBlG,EAAE0D,OAAO,GACTzD,EAAEyD,OAAO,KACPuC,EAMJ,IAHA,IAAIE,EAAKlG,EAAE/J,QACPkQ,EAAKpG,EAAE9J,SAEH8J,EAAElT,UAAU,CAClB,IAAK,IAAIW,EAAI,EAAG4Y,EAAK,EAAyB,IAArBrG,EAAE/M,MAAM,GAAKoT,IAAa5Y,EAAI,KAAMA,EAAG4Y,IAAO,GACvE,GAAI5Y,EAAI,EAEN,IADAuS,EAAE0D,OAAOjW,GACFA,KAAM,IACPoY,EAAES,SAAWR,EAAEQ,WACjBT,EAAEtL,KAAK4L,GACPL,EAAEtL,KAAK4L,IAGTP,EAAEnC,OAAO,GACToC,EAAEpC,OAAO,GAIb,IAAK,IAAIrO,EAAI,EAAGkR,EAAK,EAAyB,IAArBtG,EAAEhN,MAAM,GAAKsT,IAAalR,EAAI,KAAMA,EAAGkR,IAAO,GACvE,GAAIlR,EAAI,EAEN,IADA4K,EAAEyD,OAAOrO,GACFA,KAAM,IACP0Q,EAAEO,SAAWN,EAAEM,WACjBP,EAAExL,KAAK4L,GACPH,EAAExL,KAAK4L,IAGTL,EAAErC,OAAO,GACTsC,EAAEtC,OAAO,GAIT1D,EAAEnL,IAAIoL,IAAM,GACdD,EAAExF,KAAKyF,GACP4F,EAAErL,KAAKuL,GACPD,EAAEtL,KAAKwL,KAEP/F,EAAEzF,KAAKwF,GACP+F,EAAEvL,KAAKqL,GACPG,EAAExL,KAAKsL,IAIX,MAAO,CACLna,EAAGoa,EACHna,EAAGoa,EACHQ,IAAKvG,EAAEoD,OAAO4C,KAOlBrT,EAAGvE,UAAUoY,OAAS,SAAiBrF,GACrChP,EAAsB,IAAfgP,EAAEpY,UACToJ,GAAQgP,EAAEtU,UAEV,IAAInB,EAAIrB,KACJsB,EAAIwV,EAAElL,QAGRvK,EADiB,IAAfA,EAAE3C,SACA2C,EAAEyZ,KAAKhE,GAEPzV,EAAEuK,QAQR,IALA,IAuCI8B,EAvCA0O,EAAK,IAAI9T,EAAG,GACZ+T,EAAK,IAAI/T,EAAG,GAEZgU,EAAQhb,EAAEsK,QAEPvK,EAAEkb,KAAK,GAAK,GAAKjb,EAAEib,KAAK,GAAK,GAAG,CACrC,IAAK,IAAIpZ,EAAI,EAAG4Y,EAAK,EAAyB,IAArB1a,EAAEsH,MAAM,GAAKoT,IAAa5Y,EAAI,KAAMA,EAAG4Y,IAAO,GACvE,GAAI5Y,EAAI,EAEN,IADA9B,EAAE+X,OAAOjW,GACFA,KAAM,GACPiZ,EAAGJ,SACLI,EAAGnM,KAAKqM,GAGVF,EAAGhD,OAAO,GAId,IAAK,IAAIrO,EAAI,EAAGkR,EAAK,EAAyB,IAArB3a,EAAEqH,MAAM,GAAKsT,IAAalR,EAAI,KAAMA,EAAGkR,IAAO,GACvE,GAAIlR,EAAI,EAEN,IADAzJ,EAAE8X,OAAOrO,GACFA,KAAM,GACPsR,EAAGL,SACLK,EAAGpM,KAAKqM,GAGVD,EAAGjD,OAAO,GAIV/X,EAAEkJ,IAAIjJ,IAAM,GACdD,EAAE6O,KAAK5O,GACP8a,EAAGlM,KAAKmM,KAER/a,EAAE4O,KAAK7O,GACPgb,EAAGnM,KAAKkM,IAeZ,OATE1O,EADgB,IAAdrM,EAAEkb,KAAK,GACHH,EAEAC,GAGAE,KAAK,GAAK,GAChB7O,EAAIuC,KAAK6G,GAGJpJ,GAGTpF,EAAGvE,UAAUmY,IAAM,SAAchS,GAC/B,GAAIlK,KAAKwC,SAAU,OAAO0H,EAAIsE,MAC9B,GAAItE,EAAI1H,SAAU,OAAOxC,KAAKwO,MAE9B,IAAInN,EAAIrB,KAAK4L,QACTtK,EAAI4I,EAAI0B,QACZvK,EAAE3C,SAAW,EACb4C,EAAE5C,SAAW,EAGb,IAAK,IAAIqP,EAAQ,EAAG1M,EAAEua,UAAYta,EAAEsa,SAAU7N,IAC5C1M,EAAE+X,OAAO,GACT9X,EAAE8X,OAAO,GAGX,OAAG,CACD,KAAO/X,EAAEua,UACPva,EAAE+X,OAAO,GAEX,KAAO9X,EAAEsa,UACPta,EAAE8X,OAAO,GAGX,IAAIxS,EAAIvF,EAAEkJ,IAAIjJ,GACd,GAAIsF,EAAI,EAAG,CAET,IAAIuH,EAAI9M,EACRA,EAAIC,EACJA,EAAI6M,OACC,GAAU,IAANvH,GAAyB,IAAdtF,EAAEib,KAAK,GAC3B,MAGFlb,EAAE6O,KAAK5O,GAGT,OAAOA,EAAEyX,OAAOhL,IAIlBzF,EAAGvE,UAAUyY,KAAO,SAAetS,GACjC,OAAOlK,KAAKsb,KAAKpR,GAAK7I,EAAEyZ,KAAK5Q,IAG/B5B,EAAGvE,UAAU6X,OAAS,WACpB,OAA+B,IAAP,EAAhB5b,KAAK2I,MAAM,KAGrBL,EAAGvE,UAAUiY,MAAQ,WACnB,OAA+B,IAAP,EAAhBhc,KAAK2I,MAAM,KAIrBL,EAAGvE,UAAUoX,MAAQ,SAAgBjR,GACnC,OAAOlK,KAAK2I,MAAM,GAAKuB,GAIzB5B,EAAGvE,UAAU0Y,MAAQ,SAAgB1M,GACnCjI,EAAsB,iBAARiI,GACd,IAAInJ,EAAImJ,EAAM,GACVlJ,GAAKkJ,EAAMnJ,GAAK,GAChBkS,EAAI,GAAKlS,EAGb,GAAI5G,KAAK/B,QAAU4I,EAGjB,OAFA7G,KAAK6L,QAAQhF,EAAI,GACjB7G,KAAK2I,MAAM9B,IAAMiS,EACV9Y,KAKT,IADA,IAAIuM,EAAQuM,EACH3V,EAAI0D,EAAa,IAAV0F,GAAepJ,EAAInD,KAAK/B,OAAQkF,IAAK,CACnD,IAAI6H,EAAoB,EAAhBhL,KAAK2I,MAAMxF,GAEnBoJ,GADAvB,GAAKuB,KACS,GACdvB,GAAK,SACLhL,KAAK2I,MAAMxF,GAAK6H,EAMlB,OAJc,IAAVuB,IACFvM,KAAK2I,MAAMxF,GAAKoJ,EAChBvM,KAAK/B,UAEA+B,IAAIA,EAGbsI,EAAGvE,UAAUvB,OAAS,WACpB,OAAuB,IAAhBxC,KAAK/B,QAAkC,IAAlB+B,KAAK2I,MAAM,EAAE,EAG3CL,EAAGvE,UAAUwY,KAAO,SAAerS,GACjC,IAOIwD,EAPAhP,EAAWwL,EAAM,EAErB,GAAsB,IAAlBlK,KAAKtB,WAAmBA,EAAU,OAAQ,EAC9C,GAAsB,IAAlBsB,KAAKtB,UAAkBA,EAAU,OAAO,EAK5C,GAHAsB,KAAKkL,SAGDlL,KAAK/B,OAAS,EAChByP,EAAM,MACD,CACDhP,IACFwL,GAAOA,GAGTpC,EAAOoC,GAAO,SAAW,qBAEzB,IAAIc,EAAoB,EAAhBhL,KAAK2I,MAAM,GACnB+E,EAAM1C,IAAMd,EAAM,EAAIc,EAAId,GAAO,EAAI,CAAC,CAExC,OAAsB,IAAlBlK,KAAKtB,SAA8B,GAANgP,EAC1BA,CAACA,EAOVpF,EAAGvE,UAAUwG,IAAM,SAAcL,GAC/B,GAAsB,IAAlBlK,KAAKtB,UAAmC,IAAjBwL,EAAIxL,SAAgB,OAAQ,EACvD,GAAsB,IAAlBsB,KAAKtB,UAAmC,IAAjBwL,EAAIxL,SAAgB,OAAO,EAEtD,IAAIgP,EAAM1N,KAAK0c,KAAKxS,GACpB,OAAsB,IAAlBlK,KAAKtB,SAA8B,GAANgP,EAC1BA,CAACA,EAIVpF,EAAGvE,UAAU2Y,KAAO,SAAexS,GAEjC,GAAIlK,KAAK/B,OAASiM,EAAIjM,OAAQ,OAAO,EACrC,GAAI+B,KAAK/B,OAASiM,EAAIjM,OAAQ,OAAQ,EAGtC,IADA,IAAIyP,EAAM,EACDvK,EAAInD,KAAK/B,OAAS,EAAGkF,GAAK,EAAGA,IAAK,CACzC,IAAI9B,EAAoB,EAAhBrB,KAAK2I,MAAMxF,GACf7B,EAAmB,EAAf4I,EAAIvB,MAAMxF,GAElB,GAAI9B,IAAMC,EAAV,CACID,EAAIC,EACNoM,GAAO,EACErM,EAAIC,IACboM,EAAM,GAER,KAAK,CAAL,CAEF,OAAOA,CAACA,EAGVpF,EAAGvE,UAAU4Y,IAAM,SAAczS,GAC/B,OAA0B,IAAnBlK,KAAKuc,KAAKrS,IAGnB5B,EAAGvE,UAAU6Y,GAAK,SAAa1S,GAC7B,OAAyB,IAAlBlK,KAAKuK,IAAIL,IAGlB5B,EAAGvE,UAAU8Y,KAAO,SAAe3S,GACjC,OAAOlK,KAAKuc,KAAKrS,IAAQ,CAAC,EAG5B5B,EAAGvE,UAAU+Y,IAAM,SAAc5S,GAC/B,OAAOlK,KAAKuK,IAAIL,IAAQ,CAAC,EAG3B5B,EAAGvE,UAAUgZ,IAAM,SAAc7S,GAC/B,OAA2B,IAApBlK,KAAKuc,KAAKrS,IAGnB5B,EAAGvE,UAAUpF,GAAK,SAAauL,GAC7B,OAA0B,IAAnBlK,KAAKuK,IAAIL,IAGlB5B,EAAGvE,UAAUiZ,KAAO,SAAe9S,GACjC,OAAOlK,KAAKuc,KAAKrS,IAAQ,CAAC,EAG5B5B,EAAGvE,UAAUkZ,IAAM,SAAc/S,GAC/B,OAAOlK,KAAKuK,IAAIL,IAAQ,CAAC,EAG3B5B,EAAGvE,UAAUmZ,IAAM,SAAchT,GAC/B,OAA0B,IAAnBlK,KAAKuc,KAAKrS,IAGnB5B,EAAGvE,UAAUoZ,GAAK,SAAajT,GAC7B,OAAyB,IAAlBlK,KAAKuK,IAAIL,IAOlB5B,EAAGM,IAAM,SAAcsB,GACrB,OAAO,IAAIkT,EAAIlT,IAGjB5B,EAAGvE,UAAUsZ,MAAQ,SAAgBC,GAGnC,OAFAxV,GAAQ9H,KAAK4I,IAAK,yCAClBd,EAAyB,IAAlB9H,KAAKtB,SAAgB,iCACrB4e,EAAIC,UAAUvd,MAAMwd,UAAUF,IAGvChV,EAAGvE,UAAU0Z,QAAU,WAErB,OADA3V,EAAO9H,KAAK4I,IAAK,wDACV5I,KAAK4I,IAAI8U,YAAY1d,KAAKA,EAGnCsI,EAAGvE,UAAUyZ,UAAY,SAAoBF,GAE3C,OADAtd,KAAK4I,IAAM0U,EACJtd,IAAIA,EAGbsI,EAAGvE,UAAU4Z,SAAW,SAAmBL,GAEzC,OADAxV,GAAQ9H,KAAK4I,IAAK,yCACX5I,KAAKwd,UAAUF,IAGxBhV,EAAGvE,UAAU6Z,OAAS,SAAiB1T,GAErC,OADApC,EAAO9H,KAAK4I,IAAK,sCACV5I,KAAK4I,IAAInJ,IAAIO,KAAMkK,IAG5B5B,EAAGvE,UAAU8Z,QAAU,SAAkB3T,GAEvC,OADApC,EAAO9H,KAAK4I,IAAK,uCACV5I,KAAK4I,IAAIqH,KAAKjQ,KAAMkK,IAG7B5B,EAAGvE,UAAU+Z,OAAS,SAAiB5T,GAErC,OADApC,EAAO9H,KAAK4I,IAAK,sCACV5I,KAAK4I,IAAInH,IAAIzB,KAAMkK,IAG5B5B,EAAGvE,UAAUga,QAAU,SAAkB7T,GAEvC,OADApC,EAAO9H,KAAK4I,IAAK,uCACV5I,KAAK4I,IAAIsH,KAAKlQ,KAAMkK,IAG7B5B,EAAGvE,UAAUia,OAAS,SAAiB9T,GAErC,OADApC,EAAO9H,KAAK4I,IAAK,sCACV5I,KAAK4I,IAAIqV,IAAIje,KAAMkK,IAG5B5B,EAAGvE,UAAUma,OAAS,SAAiBhU,GAGrC,OAFApC,EAAO9H,KAAK4I,IAAK,sCACjB5I,KAAK4I,IAAIuV,SAASne,KAAMkK,GACjBlK,KAAK4I,IAAIhK,IAAIoB,KAAMkK,IAG5B5B,EAAGvE,UAAUqa,QAAU,SAAkBlU,GAGvC,OAFApC,EAAO9H,KAAK4I,IAAK,sCACjB5I,KAAK4I,IAAIuV,SAASne,KAAMkK,GACjBlK,KAAK4I,IAAIuL,KAAKnU,KAAMkK,IAG7B5B,EAAGvE,UAAUsa,OAAS,WAGpB,OAFAvW,EAAO9H,KAAK4I,IAAK,sCACjB5I,KAAK4I,IAAI0V,SAASte,MACXA,KAAK4I,IAAI+P,IAAI3Y,KAAKA,EAG3BsI,EAAGvE,UAAUwa,QAAU,WAGrB,OAFAzW,EAAO9H,KAAK4I,IAAK,uCACjB5I,KAAK4I,IAAI0V,SAASte,MACXA,KAAK4I,IAAIgQ,KAAK5Y,KAAKA,EAI5BsI,EAAGvE,UAAUya,QAAU,WAGrB,OAFA1W,EAAO9H,KAAK4I,IAAK,uCACjB5I,KAAK4I,IAAI0V,SAASte,MACXA,KAAK4I,IAAI6V,KAAKze,KAAKA,EAG5BsI,EAAGvE,UAAU2a,QAAU,WAGrB,OAFA5W,EAAO9H,KAAK4I,IAAK,uCACjB5I,KAAK4I,IAAI0V,SAASte,MACXA,KAAK4I,IAAI4T,KAAKxc,KAAKA,EAI5BsI,EAAGvE,UAAU4a,OAAS,WAGpB,OAFA7W,EAAO9H,KAAK4I,IAAK,sCACjB5I,KAAK4I,IAAI0V,SAASte,MACXA,KAAK4I,IAAImG,IAAI/O,KAAKA,EAG3BsI,EAAGvE,UAAU6a,OAAS,SAAiB1U,GAGrC,OAFApC,EAAO9H,KAAK4I,MAAQsB,EAAItB,IAAK,qBAC7B5I,KAAK4I,IAAI0V,SAASte,MACXA,KAAK4I,IAAI6C,IAAIzL,KAAMkK,IAI5B,IAAI2U,EAAS,CACXC,KAAM,KACNC,KAAM,KACNC,KAAM,KACNC,OAAQ,MAIV,SAASC,EAAQjf,EAAM6W,GAErB9W,KAAKC,KAAOA,EACZD,KAAK8W,EAAI,IAAIxO,EAAGwO,EAAG,IACnB9W,KAAKuX,EAAIvX,KAAK8W,EAAEzI,YAChBrO,KAAKmN,EAAI,IAAI7E,EAAG,GAAGyQ,OAAO/Y,KAAKuX,GAAGrH,KAAKlQ,KAAK8W,GAE5C9W,KAAKmf,IAAMnf,KAAKof,MAAMA,CAiDxB,SAASC,IACPH,EAAOlb,KACLhE,KACA,OACA,2EA+DJ,SAASsf,IACPJ,EAAOlb,KACLhE,KACA,OACA,kEAIJ,SAASuf,IACPL,EAAOlb,KACLhE,KACA,OACA,yDAIJ,SAASwf,IAEPN,EAAOlb,KACLhE,KACA,QACA,uEA8CJ,SAASod,EAAK5F,GACZ,GAAiB,iBAANA,EAAgB,CACzB,IAAIiI,EAAQnX,EAAGoX,OAAOlI,GACtBxX,KAAKwX,EAAIiI,EAAM3I,EACf9W,KAAKyf,MAAQA,OAEb3X,EAAO0P,EAAEmF,IAAI,GAAI,kCACjB3c,KAAKwX,EAAIA,EACTxX,KAAKyf,MAAQ,IAAI,CAoOrB,SAASE,EAAMnI,GACb4F,EAAIpZ,KAAKhE,KAAMwX,GAEfxX,KAAK+N,MAAQ/N,KAAKwX,EAAEnJ,YAChBrO,KAAK+N,MAAQ,IAAO,IACtB/N,KAAK+N,OAAS,GAAM/N,KAAK+N,MAAQ,IAGnC/N,KAAK4G,EAAI,IAAI0B,EAAG,GAAGyQ,OAAO/Y,KAAK+N,OAC/B/N,KAAKkb,GAAKlb,KAAK4f,KAAK5f,KAAK4G,EAAE+R,OAC3B3Y,KAAK6f,KAAO7f,KAAK4G,EAAEuV,OAAOnc,KAAKwX,GAE/BxX,KAAK8f,KAAO9f,KAAK6f,KAAKjhB,IAAIoB,KAAK4G,GAAGqT,MAAM,GAAG/a,IAAIc,KAAKwX,GACpDxX,KAAK8f,KAAO9f,KAAK8f,KAAKhF,KAAK9a,KAAK4G,GAChC5G,KAAK8f,KAAO9f,KAAK4G,EAAEnF,IAAIzB,KAAK8f,KAAKA,CA9anCZ,EAAOnb,UAAUqb,KAAO,WACtB,IAAID,EAAM,IAAI7W,EAAG,MAEjB,OADA6W,EAAIxW,MAAQ,IAAI7E,MAAMgC,KAAKgF,KAAK9K,KAAKuX,EAAI,KAClC4H,CAACA,EAGVD,EAAOnb,UAAUgc,QAAU,SAAkB7V,GAG3C,IACI8V,EADApZ,EAAIsD,EAGR,GACElK,KAAKX,MAAMuH,EAAG5G,KAAKmf,KAGnBa,GADApZ,GADAA,EAAI5G,KAAKigB,MAAMrZ,IACTqJ,KAAKjQ,KAAKmf,MACP9Q,kBACF2R,EAAOhgB,KAAKuX,GAErB,IAAIhN,EAAMyV,EAAOhgB,KAAKuX,GAAK,EAAI3Q,EAAE8V,KAAK1c,KAAK8W,GAgB3C,OAfY,IAARvM,GACF3D,EAAE+B,MAAM,GAAK,EACb/B,EAAE3I,OAAS,GACFsM,EAAM,EACf3D,EAAEsJ,KAAKlQ,KAAK8W,YAERlQ,EAAEsZ,MAEJtZ,EAAEsZ,QAGFtZ,EAAEsE,SAICtE,GAGTsY,EAAOnb,UAAU1E,MAAQ,SAAgB8gB,EAAO7T,GAC9C6T,EAAM/G,OAAOpZ,KAAKuX,EAAG,EAAGjL,IAG1B4S,EAAOnb,UAAUkc,MAAQ,SAAgB/V,GACvC,OAAOA,EAAIiK,KAAKnU,KAAKmN,EAAEA,EASzBlF,EAASoX,EAAMH,GAEfG,EAAKtb,UAAU1E,MAAQ,SAAgB8gB,EAAOC,GAK5C,IAHA,IAAI5G,EAAO,QAEP6G,EAASva,KAAKgE,IAAIqW,EAAMliB,OAAQ,GAC3BkF,EAAI,EAAGA,EAAIkd,EAAQld,IAC1Bid,EAAOzX,MAAMxF,GAAKgd,EAAMxX,MAAMxF,GAIhC,GAFAid,EAAOniB,OAASoiB,EAEZF,EAAMliB,QAAU,EAGlB,OAFAkiB,EAAMxX,MAAM,GAAK,OACjBwX,EAAMliB,OAAS,GAKjB,IAAIqiB,EAAOH,EAAMxX,MAAM,GAGvB,IAFAyX,EAAOzX,MAAMyX,EAAOniB,UAAYqiB,EAAO9G,EAElCrW,EAAI,GAAIA,EAAIgd,EAAMliB,OAAQkF,IAAK,CAClC,IAAIod,EAAwB,EAAjBJ,EAAMxX,MAAMxF,GACvBgd,EAAMxX,MAAMxF,EAAI,KAAQod,EAAO/G,IAAS,EAAM8G,IAAS,GACvDA,EAAOC,EAETD,KAAU,GACVH,EAAMxX,MAAMxF,EAAI,IAAMmd,EACT,IAATA,GAAcH,EAAMliB,OAAS,GAC/BkiB,EAAMliB,QAAU,GAEhBkiB,EAAMliB,QAAU,CAAC,EAIrBohB,EAAKtb,UAAUkc,MAAQ,SAAgB/V,GAErCA,EAAIvB,MAAMuB,EAAIjM,QAAU,EACxBiM,EAAIvB,MAAMuB,EAAIjM,OAAS,GAAK,EAC5BiM,EAAIjM,QAAU,EAId,IADA,IAAIiP,EAAK,EACA/J,EAAI,EAAGA,EAAI+G,EAAIjM,OAAQkF,IAAK,CACnC,IAAI6H,EAAmB,EAAfd,EAAIvB,MAAMxF,GAClB+J,GAAU,IAAJlC,EACNd,EAAIvB,MAAMxF,GAAU,SAAL+J,EACfA,EAAS,GAAJlC,GAAakC,EAAK,SAAa,EAAE,CAUxC,OANkC,IAA9BhD,EAAIvB,MAAMuB,EAAIjM,OAAS,KACzBiM,EAAIjM,SAC8B,IAA9BiM,EAAIvB,MAAMuB,EAAIjM,OAAS,IACzBiM,EAAIjM,UAGDiM,GASTjC,EAASqX,EAAMJ,GAQfjX,EAASsX,EAAML,GASfjX,EAASuX,EAAQN,GAEjBM,EAAOzb,UAAUkc,MAAQ,SAAgB/V,GAGvC,IADA,IAAIqC,EAAQ,EACHpJ,EAAI,EAAGA,EAAI+G,EAAIjM,OAAQkF,IAAK,CACnC,IAAImL,EAA0B,IAAL,EAAfpE,EAAIvB,MAAMxF,IAAiBoJ,EACjCW,EAAU,SAALoB,EACTA,KAAQ,GAERpE,EAAIvB,MAAMxF,GAAK+J,EACfX,EAAQ+B,EAKV,OAHc,IAAV/B,IACFrC,EAAIvB,MAAMuB,EAAIjM,UAAYsO,GAErBrC,GAIT5B,EAAGoX,OAAS,SAAgBzf,GAE1B,GAAI4e,EAAO5e,GAAO,OAAO4e,EAAO5e,GAEhC,IAAIwf,EACJ,GAAa,SAATxf,EACFwf,EAAQ,IAAIJ,OACP,GAAa,SAATpf,EACTwf,EAAQ,IAAIH,OACP,GAAa,SAATrf,EACTwf,EAAQ,IAAIF,MACP,IAAa,WAATtf,EAGT,MAAM,IAAIiD,MAAM,iBAAmBjD,GAFnCwf,EAAQ,IAAID,EAMd,OAFAX,EAAO5e,GAAQwf,EAERA,GAkBTrC,EAAIrZ,UAAUua,SAAW,SAAmBjd,GAC1CyG,EAAsB,IAAfzG,EAAE3C,SAAgB,iCACzBoJ,EAAOzG,EAAEuH,IAAK,oCAGhBwU,EAAIrZ,UAAUoa,SAAW,SAAmB9c,EAAGC,GAC7CwG,EAAqC,IAA7BzG,EAAE3C,SAAW4C,EAAE5C,UAAiB,iCACxCoJ,EAAOzG,EAAEuH,KAAOvH,EAAEuH,MAAQtH,EAAEsH,IAC1B,oCAGJwU,EAAIrZ,UAAU6b,KAAO,SAAeve,GAClC,OAAIrB,KAAKyf,MAAczf,KAAKyf,MAAMM,QAAQ1e,GAAGmc,UAAUxd,OAEvD+J,EAAK1I,EAAGA,EAAEyZ,KAAK9a,KAAKwX,GAAGgG,UAAUxd,OAC1BqB,IAGT+b,EAAIrZ,UAAUgL,IAAM,SAAc1N,GAChC,OAAIA,EAAEmB,SACGnB,EAAEuK,QAGJ5L,KAAKwX,EAAE/V,IAAIJ,GAAGmc,UAAUxd,KAAKA,EAGtCod,EAAIrZ,UAAUtE,IAAM,SAAc4B,EAAGC,GACnCtB,KAAKme,SAAS9c,EAAGC,GAEjB,IAAIoM,EAAMrM,EAAE5B,IAAI6B,GAIhB,OAHIoM,EAAInD,IAAIvK,KAAKwX,IAAM,GACrB9J,EAAIwC,KAAKlQ,KAAKwX,GAET9J,EAAI8P,UAAUxd,KAAKA,EAG5Bod,EAAIrZ,UAAUkM,KAAO,SAAe5O,EAAGC,GACrCtB,KAAKme,SAAS9c,EAAGC,GAEjB,IAAIoM,EAAMrM,EAAE4O,KAAK3O,GAIjB,OAHIoM,EAAInD,IAAIvK,KAAKwX,IAAM,GACrB9J,EAAIwC,KAAKlQ,KAAKwX,GAET9J,GAGT0P,EAAIrZ,UAAUtC,IAAM,SAAcJ,EAAGC,GACnCtB,KAAKme,SAAS9c,EAAGC,GAEjB,IAAIoM,EAAMrM,EAAEI,IAAIH,GAIhB,OAHIoM,EAAI6O,KAAK,GAAK,GAChB7O,EAAIuC,KAAKjQ,KAAKwX,GAET9J,EAAI8P,UAAUxd,KAAKA,EAG5Bod,EAAIrZ,UAAUmM,KAAO,SAAe7O,EAAGC,GACrCtB,KAAKme,SAAS9c,EAAGC,GAEjB,IAAIoM,EAAMrM,EAAE6O,KAAK5O,GAIjB,OAHIoM,EAAI6O,KAAK,GAAK,GAChB7O,EAAIuC,KAAKjQ,KAAKwX,GAET9J,GAGT0P,EAAIrZ,UAAUka,IAAM,SAAc5c,EAAG6I,GAEnC,OADAlK,KAAKse,SAASjd,GACPrB,KAAK4f,KAAKve,EAAEuY,MAAM1P,KAG3BkT,EAAIrZ,UAAUoQ,KAAO,SAAe9S,EAAGC,GAErC,OADAtB,KAAKme,SAAS9c,EAAGC,GACVtB,KAAK4f,KAAKve,EAAE8S,KAAK7S,KAG1B8b,EAAIrZ,UAAUnF,IAAM,SAAcyC,EAAGC,GAEnC,OADAtB,KAAKme,SAAS9c,EAAGC,GACVtB,KAAK4f,KAAKve,EAAEzC,IAAI0C,KAGzB8b,EAAIrZ,UAAU6U,KAAO,SAAevX,GAClC,OAAOrB,KAAKmU,KAAK9S,EAAGA,EAAEuK,QAAQA,EAGhCwR,EAAIrZ,UAAU4U,IAAM,SAActX,GAChC,OAAOrB,KAAKpB,IAAIyC,EAAGA,IAGrB+b,EAAIrZ,UAAU0a,KAAO,SAAepd,GAClC,GAAIA,EAAEmB,SAAU,OAAOnB,EAAEuK,QAEzB,IAAI4U,EAAOxgB,KAAKwX,EAAE2D,MAAM,GAIxB,GAHArT,EAAO0Y,EAAO,GAAM,GAGP,IAATA,EAAY,CACd,IAAI/U,EAAMzL,KAAKwX,EAAE/X,IAAI,IAAI6I,EAAG,IAAI8Q,OAAO,GACvC,OAAOpZ,KAAKyL,IAAIpK,EAAGoK,GAQrB,IAFA,IAAIqN,EAAI9Y,KAAKwX,EAAE2C,KAAK,GAChBtT,EAAI,GACAiS,EAAEtW,UAA2B,IAAfsW,EAAEqC,MAAM,IAC5BtU,IACAiS,EAAEM,OAAO,GAEXtR,GAAQgR,EAAEtW,UAEV,IAAIie,EAAM,IAAInY,EAAG,GAAG+U,MAAMrd,MACtB0gB,EAAOD,EAAI9B,SAIXgC,EAAO3gB,KAAKwX,EAAE2C,KAAK,GAAGf,OAAO,GAC7BwH,EAAI5gB,KAAKwX,EAAEnJ,YAGf,IAFAuS,EAAI,IAAItY,EAAG,EAAIsY,EAAIA,GAAGvD,MAAMrd,MAEW,IAAhCA,KAAKyL,IAAImV,EAAGD,GAAMpW,IAAImW,IAC3BE,EAAE/C,QAAQ6C,GAOZ,IAJA,IAAIpX,EAAItJ,KAAKyL,IAAImV,EAAG9H,GAChBlS,EAAI5G,KAAKyL,IAAIpK,EAAGyX,EAAEoB,KAAK,GAAGd,OAAO,IACjCjL,EAAInO,KAAKyL,IAAIpK,EAAGyX,GAChBtB,EAAI3Q,EACc,IAAfsH,EAAE5D,IAAIkW,IAAY,CAEvB,IADA,IAAItB,EAAMhR,EACDhL,EAAI,EAAoB,IAAjBgc,EAAI5U,IAAIkW,GAAYtd,IAClCgc,EAAMA,EAAId,SAEZvW,EAAO3E,EAAIqU,GACX,IAAIlW,EAAItB,KAAKyL,IAAInC,EAAG,IAAIhB,EAAG,GAAGyQ,OAAOvB,EAAIrU,EAAI,IAE7CyD,EAAIA,EAAEsX,OAAO5c,GACbgI,EAAIhI,EAAE+c,SACNlQ,EAAIA,EAAE+P,OAAO5U,GACbkO,EAAIrU,EAGN,OAAOyD,GAGTwW,EAAIrZ,UAAUyY,KAAO,SAAenb,GAClC,IAAIwf,EAAMxf,EAAE8a,OAAOnc,KAAKwX,GACxB,OAAqB,IAAjBqJ,EAAIniB,UACNmiB,EAAIniB,SAAW,EACRsB,KAAK4f,KAAKiB,GAAKlC,UAEf3e,KAAK4f,KAAKiB,IAIrBzD,EAAIrZ,UAAU0H,IAAM,SAAcpK,EAAG6I,GACnC,GAAIA,EAAI1H,SAAU,OAAO,IAAI8F,EAAG,GAAG+U,MAAMrd,MACzC,GAAoB,IAAhBkK,EAAIqS,KAAK,GAAU,OAAOlb,EAAEuK,QAEhC,IACIkV,EAAM,IAAIhd,MAAM,IACpBgd,EAAI,GAAK,IAAIxY,EAAG,GAAG+U,MAAMrd,MACzB8gB,EAAI,GAAKzf,EACT,IAAK,IAAI8B,EAAI,EAAGA,EAAI2d,EAAI7iB,OAAQkF,IAC9B2d,EAAI3d,GAAKnD,KAAKpB,IAAIkiB,EAAI3d,EAAI,GAAI9B,GAGhC,IAAIqM,EAAMoT,EAAI,GACVC,EAAU,EACVC,EAAa,EACbtb,EAAQwE,EAAImE,YAAc,GAK9B,IAJc,IAAV3I,IACFA,EAAQ,IAGLvC,EAAI+G,EAAIjM,OAAS,EAAGkF,GAAK,EAAGA,IAAK,CAEpC,IADA,IAAImI,EAAOpB,EAAIvB,MAAMxF,GACZ4H,EAAIrF,EAAQ,EAAGqF,GAAK,EAAGA,IAAK,CACnC,IAAIgF,EAAOzE,GAAQP,EAAK,EACpB2C,IAAQoT,EAAI,KACdpT,EAAM1N,KAAK2Y,IAAIjL,IAGL,IAARqC,GAAyB,IAAZgR,GAKjBA,IAAY,EACZA,GAAWhR,GA9BE,MA+BbiR,GACwC,IAAN7d,GAAiB,IAAN4H,KAE7C2C,EAAM1N,KAAKpB,IAAI8O,EAAKoT,EAAIC,IACxBC,EAAa,EACbD,EAAU,IAXRC,EAAa,CAAC,CAalBtb,EAAQ,EAAE,CAGZ,OAAOgI,GAGT0P,EAAIrZ,UAAUwZ,UAAY,SAAoBrT,GAC5C,IAAItD,EAAIsD,EAAI4Q,KAAK9a,KAAKwX,GAEtB,OAAO5Q,IAAMsD,EAAMtD,EAAEgF,QAAUhF,CAACA,EAGlCwW,EAAIrZ,UAAU2Z,YAAc,SAAsBxT,GAChD,IAAIwD,EAAMxD,EAAI0B,QAEd,OADA8B,EAAI9E,IAAM,KACH8E,CAACA,EAOVpF,EAAG2Y,KAAO,SAAe/W,GACvB,OAAO,IAAIyV,EAAKzV,IAmBlBjC,EAAS0X,EAAMvC,GAEfuC,EAAK5b,UAAUwZ,UAAY,SAAoBrT,GAC7C,OAAOlK,KAAK4f,KAAK1V,EAAI0P,MAAM5Z,KAAK+N,OAAOA,EAGzC4R,EAAK5b,UAAU2Z,YAAc,SAAsBxT,GACjD,IAAItD,EAAI5G,KAAK4f,KAAK1V,EAAItL,IAAIoB,KAAK6f,OAE/B,OADAjZ,EAAEgC,IAAM,KACDhC,CAACA,EAGV+Y,EAAK5b,UAAUoQ,KAAO,SAAe9S,EAAGC,GACtC,GAAID,EAAEmB,UAAYlB,EAAEkB,SAGlB,OAFAnB,EAAEsH,MAAM,GAAK,EACbtH,EAAEpD,OAAS,EACJoD,EAGT,IAAI8M,EAAI9M,EAAE8S,KAAK7S,GACXgI,EAAI6E,EAAE6L,MAAMha,KAAK+N,OAAOnP,IAAIoB,KAAK8f,MAAM/F,OAAO/Z,KAAK+N,OAAOnP,IAAIoB,KAAKwX,GACnE0J,EAAI/S,EAAE+B,KAAK5G,GAAG8P,OAAOpZ,KAAK+N,OAC1BL,EAAMwT,EAQV,OANIA,EAAE3W,IAAIvK,KAAKwX,IAAM,EACnB9J,EAAMwT,EAAEhR,KAAKlQ,KAAKwX,GACT0J,EAAE3E,KAAK,GAAK,IACrB7O,EAAMwT,EAAEjR,KAAKjQ,KAAKwX,IAGb9J,EAAI8P,UAAUxd,KAAKA,EAG5B2f,EAAK5b,UAAUnF,IAAM,SAAcyC,EAAGC,GACpC,GAAID,EAAEmB,UAAYlB,EAAEkB,SAAU,OAAO,IAAI8F,EAAG,GAAGkV,UAAUxd,MAEzD,IAAImO,EAAI9M,EAAEzC,IAAI0C,GACVgI,EAAI6E,EAAE6L,MAAMha,KAAK+N,OAAOnP,IAAIoB,KAAK8f,MAAM/F,OAAO/Z,KAAK+N,OAAOnP,IAAIoB,KAAKwX,GACnE0J,EAAI/S,EAAE+B,KAAK5G,GAAG8P,OAAOpZ,KAAK+N,OAC1BL,EAAMwT,EAOV,OANIA,EAAE3W,IAAIvK,KAAKwX,IAAM,EACnB9J,EAAMwT,EAAEhR,KAAKlQ,KAAKwX,GACT0J,EAAE3E,KAAK,GAAK,IACrB7O,EAAMwT,EAAEjR,KAAKjQ,KAAKwX,IAGb9J,EAAI8P,UAAUxd,KAAKA,EAG5B2f,EAAK5b,UAAUyY,KAAO,SAAenb,GAGnC,OADUrB,KAAK4f,KAAKve,EAAE8a,OAAOnc,KAAKwX,GAAG5Y,IAAIoB,KAAKkb,KACnCsC,UAAUxd,KAAKA,CAALA,CAx9GzB,CA09GoC+I,EAAQ/I,Q,2DC19G5C3B,EAAA,gCAAO,MAAM8iB,EAAc,4CAA4C,E,kCCAvE,qMASI7Y,EAAK,IAAIA,GAIb,MAAMpL,EAAS,IAAI,IAAO,KACpBC,EAAoB,CAAC,EACrBikB,EAAW,iBACV,SAASC,EAAe1jB,GAC3B,OAAiB,MAATA,IAAmB2jB,EAAUC,YAAY5jB,IACzB,iBAAZ,GAAyBA,EAAQ,GAAO,GAC5B,iBAAZ,KAA0BA,EAAMqB,MAAM,eAC9C,YAAYrB,IACQ,iBAAZ,GACR,YAAQA,IAGhB,IAAI6jB,KACG,MAAMF,EACT3hB,YAAYC,EAAkBiB,GACtBjB,IAAqBzC,GACrBD,EAAOW,WAAW,uDAAwD,IAAOC,OAAOiC,sBAAuB,CAC3GrC,UAAW,oBAGnBsC,KAAKe,KAAOF,EACZb,KAAKyhB,gBACLrhB,OAAOC,OAAOL,KAAKA,CAEvB0C,SAAS/E,GACL,OAAO+jB,EAAYC,EAAK3hB,MAAM0C,SAAS/E,IAE3CgF,OAAOhF,GACH,OAAO+jB,EAAYC,EAAK3hB,MAAM2C,OAAOhF,IAEzC6Q,MACI,MAAqB,MAAjBxO,KAAKe,KAAK,GACHugB,EAAUjkB,KAAK2C,KAAKe,KAAKzC,UAAU,IAEvC0B,IAAIA,CAEfP,IAAI0B,GACA,OAAOugB,EAAYC,EAAK3hB,MAAMP,IAAIkiB,EAAKxgB,KAE3CM,IAAIN,GACA,OAAOugB,EAAYC,EAAK3hB,MAAMyB,IAAIkgB,EAAKxgB,KAE3CjC,IAAIiC,GAKA,OAJUmgB,EAAUjkB,KAAK8D,GACnBqB,UACFjF,EAAW,mBAAoB,OAE5BmkB,EAAYC,EAAK3hB,MAAMd,IAAIyiB,EAAKxgB,KAE3CvC,IAAIuC,GACA,OAAOugB,EAAYC,EAAK3hB,MAAMpB,IAAI+iB,EAAKxgB,KAE3CrC,IAAIqC,GACA,MAAMxD,EAAQgkB,EAAKxgB,GAInB,OAHIxD,EAAMmR,SACNvR,EAAW,mBAAoB,OAE5BmkB,EAAYC,EAAK3hB,MAAM8a,KAAKnd,IAEvC8N,IAAItK,GACA,MAAMxD,EAAQgkB,EAAKxgB,GAInB,OAHIxD,EAAMmR,SACNvR,EAAW,iBAAkB,OAE1BmkB,EAAYC,EAAK3hB,MAAMyL,IAAI9N,IAEtC2R,IAAInO,GACA,MAAMxD,EAAQgkB,EAAKxgB,GAInB,OAHInB,KAAKgC,cAAgBrE,EAAMmR,UAC3BvR,EAAW,yBAA0B,OAElCmkB,EAAYC,EAAK3hB,MAAMsP,IAAI3R,IAEtCuR,GAAG/N,GACC,MAAMxD,EAAQgkB,EAAKxgB,GAInB,OAHInB,KAAKgC,cAAgBrE,EAAMmR,UAC3BvR,EAAW,yBAA0B,MAElCmkB,EAAYC,EAAK3hB,MAAMkP,GAAGvR,IAErC+R,IAAIvO,GACA,MAAMxD,EAAQgkB,EAAKxgB,GAInB,OAHInB,KAAKgC,cAAgBrE,EAAMmR,UAC3BvR,EAAW,yBAA0B,OAElCmkB,EAAYC,EAAK3hB,MAAM0P,IAAI/R,IAEtC6b,KAAK7b,GAID,OAHIqC,KAAKgC,cAAgBrE,EAAQ,IAC7BJ,EAAW,iBAAkB,QAE1BmkB,EAAYC,EAAK3hB,MAAMga,MAAMrc,IAExCsgB,IAAItgB,GAIA,OAHIqC,KAAKgC,cAAgBrE,EAAQ,IAC7BJ,EAAW,iBAAkB,OAE1BmkB,EAAYC,EAAK3hB,MAAM2Z,KAAKhc,IAEvCikB,IAAIjkB,GAIA,OAHIqC,KAAKgC,cAAgBrE,EAAQ,IAC7BJ,EAAW,iBAAkB,OAE1BmkB,EAAYC,EAAK3hB,MAAM6Z,KAAKlc,IAEvCwf,GAAGhc,GACC,OAAOwgB,EAAK3hB,MAAMmd,GAAGwE,EAAKxgB,IAE9BxC,GAAGwC,GACC,OAAOwgB,EAAK3hB,MAAMrB,GAAGgjB,EAAKxgB,IAE9B8b,IAAI9b,GACA,OAAOwgB,EAAK3hB,MAAMid,IAAI0E,EAAKxgB,IAE/Byb,GAAGzb,GACC,OAAOwgB,EAAK3hB,MAAM4c,GAAG+E,EAAKxgB,IAE9B2b,IAAI3b,GACA,OAAOwgB,EAAK3hB,MAAM8c,IAAI6E,EAAKxgB,IAE/Ba,aACI,MAAyB,MAAjBhC,KAAKe,KAAK,EAAE,CAExByB,SACI,OAAOmf,EAAK3hB,MAAMwC,QAAQA,CAE9BpE,WACI,IACI,OAAOujB,EAAK3hB,MAAM5B,UAAUA,CAEhC,MAAOiF,GACH9F,EAAW,WAAY,WAAYyC,KAAKjB,WAAWA,CAEvD,OAAO,IAAI,CAEf8iB,WACI,IACI,OAAOC,OAAO9hB,KAAKjB,WAAWA,CAElC,MAAOV,IACP,OAAOnB,EAAOW,WAAW,wCAAyC,IAAOC,OAAOiC,sBAAuB,CACnGpC,MAAOqC,KAAKjB,aAGpBA,WAgBI,OAdIkF,UAAUhG,OAAS,IACE,KAAjBgG,UAAU,GACLud,IACDA,KACAtkB,EAAO6kB,KAAK,0EAGM,KAAjB9d,UAAU,GACf/G,EAAOW,WAAW,iFAAkF,IAAOC,OAAOkkB,oBAAqB,CAAC,GAGxI9kB,EAAOW,WAAW,gDAAiD,IAAOC,OAAOkkB,oBAAqB,CAAC,IAGxGL,EAAK3hB,MAAMjB,SAAS,GAAG,CAElC0D,cACI,OAAOzC,KAAKe,IAAIA,CAEpB8L,OAAOpM,GACH,MAAO,CAAEC,KAAM,YAAaG,IAAKb,KAAKyC,eAE1CnC,YAAY3C,GACR,GAAIA,aAAiB2jB,EACjB,OAAO3jB,EAEX,GAAuB,iBAAZ,EACP,OAAIA,EAAMqB,MAAM,oBACL,IAAIsiB,EAAUnkB,EAAmB8kB,EAAMtkB,IAE9CA,EAAMqB,MAAM,cACL,IAAIsiB,EAAUnkB,EAAmB8kB,EAAM,IAAI3Z,EAAG3K,KAElDT,EAAOqB,mBAAmB,2BAA4B,QAASZ,GAE1E,GAAuB,iBAAZ,EAOP,OANIA,EAAQ,GACRJ,EAAW,YAAa,iBAAkBI,IAE1CA,GAASyjB,GAAYzjB,IAAUyjB,IAC/B7jB,EAAW,WAAY,iBAAkBI,GAEtC2jB,EAAUjkB,KAAK6C,OAAOvC,IAEjC,MAAMukB,EAAWvkB,EACjB,GAA0B,iBAAf,EACP,OAAO2jB,EAAUjkB,KAAK6kB,EAASnjB,YAEnC,GAAI,YAAQmjB,GACR,OAAOZ,EAAUjkB,KAAK,YAAQ6kB,IAElC,GAAIA,EAEA,GAAIA,EAASzf,YAAa,CACtB,MAAM5B,EAAMqhB,EAASzf,cACrB,GAAqB,iBAAV,EACP,OAAO6e,EAAUjkB,KAAKwD,OAGzB,CAED,IAAIA,EAAMqhB,EAASnhB,KAKnB,GAHW,MAAPF,GAAiC,cAAlBqhB,EAASxhB,OACxBG,EAAMqhB,EAASrhB,KAEE,iBAAV,IACH,YAAYA,IAAoB,MAAXA,EAAI,IAAc,YAAYA,EAAIvC,UAAU,KACjE,OAAOgjB,EAAUjkB,KAAKwD,GAKtC,OAAO3D,EAAOqB,mBAAmB,0BAA2B,QAASZ,GAEzE2C,mBAAmB3C,GACf,SAAUA,IAASA,EAAM8jB,aAAaA,EAI9C,SAASQ,EAAMtkB,GAEX,GAAuB,iBAAZ,EACP,OAAOskB,EAAMtkB,EAAMoB,SAAS,KAGhC,GAAiB,MAAbpB,EAAM,GAUN,MANiB,OAFjBA,EAAQA,EAAMW,UAAU,IAEd,IACNpB,EAAOqB,mBAAmB,cAAe,QAASZ,GAKxC,UAFdA,EAAQskB,EAAMtkB,IAGHA,EAGJ,IAAMA,EAOjB,GAJ8B,OAA1BA,EAAMW,UAAU,EAAG,KACnBX,EAAQ,KAAOA,GAGL,OAAVA,EACA,MAAO,OAOX,IAJIA,EAAMM,OAAS,IACfN,EAAQ,MAAQA,EAAMW,UAAU,IAG7BX,EAAMM,OAAS,GAA+B,SAA1BN,EAAMW,UAAU,EAAG,IAC1CX,EAAQ,KAAOA,EAAMW,UAAU,GAEnC,OAAOX,EAEX,SAAS+jB,EAAY/jB,GACjB,OAAO2jB,EAAUjkB,KAAK4kB,EAAMtkB,IAEhC,SAASgkB,EAAKhkB,GACV,MAAMkD,EAAMygB,EAAUjkB,KAAKM,GAAO8E,cAClC,MAAe,MAAX5B,EAAI,GACG,IAAKyH,EAAG,IAAMzH,EAAIvC,UAAU,GAAI,IAEpC,IAAIgK,EAAGzH,EAAIvC,UAAU,GAAI,GAAG,CAEvC,SAASf,EAAWE,EAAOC,EAAWC,GAClC,MAAMC,EAAS,CAAEH,MAAOA,EAAOC,UAAWA,GAI1C,OAHa,MAATC,IACAC,EAAOD,MAAQA,GAEZT,EAAOW,WAAWJ,EAAO,IAAOK,OAAOC,cAAeH,GAG1D,SAASukB,EAAYxkB,GACxB,OAAO,IAAK2K,EAAG3K,EAAO,IAAKoB,SAAS,GAAG,CAGpC,SAASqjB,EAAYzkB,GACxB,OAAO,IAAK2K,EAAG3K,EAAO,IAAKoB,SAAS,GAAG,CAAH,E,oQC7SxC,IAAIsjB,EAAwC,SAAUC,EAASC,EAAYC,EAAGC,GAC1E,SAASC,EAAM/kB,GAAS,OAAOA,aAAiB6kB,EAAI7kB,EAAQ,IAAI6kB,YAAYG,GAAWA,EAAQhlB,MAC/F,OAAO,IAAK6kB,IAAMA,EAAII,WAAUA,SAAUD,EAASE,GAC/C,SAASC,EAAUnlB,GAAS,IAAMolB,EAAKN,EAAUlC,KAAK5iB,IAAW,MAAOU,GAAKwkB,EAAOxkB,IACpF,SAAS2kB,EAASrlB,GAAS,IAAMolB,EAAKN,EAAiB,MAAE9kB,IAAW,MAAOU,GAAKwkB,EAAOxkB,IACvF,SAAS0kB,EAAKjhB,GAAUA,EAAOmhB,KAAON,EAAQ7gB,EAAOnE,OAAS+kB,EAAM5gB,EAAOnE,OAAOulB,KAAKJ,EAAWE,GAClGD,GAAMN,EAAYA,EAAUte,MAAMme,EAASC,GAAc,KAAKhC,YAatE,MAAMrjB,EAAS,IAAI,ICpBI,mBDwBjBimB,EAAyB,CAC3BC,SAAQA,EAAOnd,MAAKA,EAAO5I,MAAKA,EAAOgmB,UAASA,EAAOC,UAASA,EAAOC,OAAMA,EAAOC,IAAGA,EAAO7lB,OAAMA,EACpG+C,MAAKA,EAAO+iB,YAAWA,EACvBC,cAAaA,EAAOC,sBAAqBA,EACzCC,YAAWA,EACXC,iBAAgBA,GAEpB,SAASC,EAAYC,EAAUC,GAC3B,OAAO3B,EAAUriB,UAAKA,OAAC,GAAQ,YAC3B,MAAMC,QAAa+jB,EACG,iBAAX,GACP9mB,EAAOqB,mBAAmB,8BAA+B,OAAQ0B,GAGrE,IACI,OAAO,YAAWA,GAEtB,MAAOoD,IACF0gB,GACD7mB,EAAOW,WAAW,sDAAuD,IAAOC,OAAOiC,sBAAuB,CAC1GrC,UAAW,gBAGnB,MAAMumB,QAAgBF,EAASD,YAAY7jB,GAI3C,OAHe,MAAXgkB,GACA/mB,EAAOqB,mBAAmB,kDAAmD,OAAQ0B,GAElFgkB,KAIf,SAASC,EAAiBH,EAAUpmB,EAAOwmB,GACvC,OAAO9B,EAAUriB,UAAKA,OAAC,GAAQ,YAC3B,OAAI8D,MAAMqG,QAAQga,SACDvB,QAAQwB,IAAID,EAAUjf,KAAI,CAACif,EAAW9a,IACxC6a,EAAiBH,EAAYjgB,MAAMqG,QAAQxM,GAAUA,EAAM0L,GAAS1L,EAAMwmB,EAAUlkB,MAAQkkB,MAGpF,YAAnBA,EAAUzjB,WACGojB,EAAYC,EAAUpmB,GAEhB,UAAnBwmB,EAAUzjB,WACGwjB,EAAiBH,EAAUpmB,EAAOwmB,EAAUE,YAElC,UAAvBF,EAAUG,SACLxgB,MAAMqG,QAAQxM,SAMNilB,QAAQwB,IAAIzmB,EAAMuH,KAAKV,GAAM0f,EAAiBH,EAAUvf,EAAG2f,EAAUI,kBALvE3B,QAAQC,OAAO3lB,EAAOsnB,UAAU,0BAA2B,IAAO1mB,OAAOyF,iBAAkB,CAC9FkhB,SAAU,QACV9mB,WAKLA,KAGf,SAAS+mB,EAAoBC,EAAUC,EAAU/gB,GAC7C,OAAOwe,EAAUriB,UAAKA,OAAC,GAAQ,YAE3B,IAAI6kB,EAAY,CAAC,EACbhhB,EAAK5F,SAAW2mB,EAASE,OAAO7mB,OAAS,GAAwC,iBAA3B4F,EAAKA,EAAK5F,OAAS,KACzE4mB,EAAY,YAAYhhB,EAAKkhB,QAGjC7nB,EAAO8nB,mBAAmBnhB,EAAK5F,OAAQ2mB,EAASE,OAAO7mB,OAAQ,sBAE3D0mB,EAASM,OACLJ,EAAUxnB,KAGVwnB,EAAUxnB,KAAO,YAAkB,CAC/B6nB,SAAUpB,EAAYa,EAASM,OAAQJ,EAAUxnB,MACjD4nB,OAAQN,EAASM,OAAOE,eACzBjC,MAAM1iB,GAAU6hB,EAAUriB,UAAKA,OAAC,GAAQ,YAMvC,OALI,YAAWQ,EAAMykB,UAAYzkB,EAAM0kB,UACnChoB,EAAOW,WAAW,8CAA+C,IAAOC,OAAOiC,sBAAuB,CAClGrC,UAAW,mBAGZ8C,EAAM0kB,cAIjBL,EAAUxnB,KAAOsnB,EAASM,OAAOE,aAGhCN,EAAUxnB,OACfwnB,EAAUxnB,KAAOymB,EAAYa,EAASS,SAAUP,EAAUxnB,OAO9D,MAAMgoB,QAAiB,YAAkB,CACrCxhB,KAAMqgB,EAAiBS,EAASM,QAAUN,EAASS,SAAUvhB,EAAM+gB,EAASE,QAC5Eb,QAASU,EAASW,gBAClBT,UAAY,YAAkBA,IAAc,CAAC,IAG3C5e,EAAO0e,EAASY,UAAUC,mBAAmBZ,EAAUS,EAASxhB,MAChE4hB,EAAK,CACPxf,KAAMA,EACNud,GAAI6B,EAASpB,SAGX9M,EAAKkO,EAASR,UA2BpB,GAzBgB,MAAZ1N,EAAGoM,QACHkC,EAAGlC,MAAQ,IAAUlmB,KAAK8Z,EAAGoM,OAAOnlB,YAErB,MAAf+Y,EAAGkM,WACHoC,EAAGpC,SAAW,IAAUhmB,KAAK8Z,EAAGkM,WAEjB,MAAflM,EAAGmM,WACHmC,EAAGnC,SAAW,IAAUjmB,KAAK8Z,EAAGmM,WAEb,MAAnBnM,EAAGuM,eACH+B,EAAG/B,aAAe,IAAUrmB,KAAK8Z,EAAGuM,eAET,MAA3BvM,EAAGwM,uBACH8B,EAAG9B,qBAAuB,IAAUtmB,KAAK8Z,EAAGwM,uBAEjC,MAAXxM,EAAG9Z,OACHooB,EAAGpoB,KAAO8Z,EAAG9Z,MAEF,MAAX8Z,EAAGzW,OACH+kB,EAAG/kB,KAAOyW,EAAGzW,MAEI,MAAjByW,EAAGsM,aACHgC,EAAGhC,WAAa,YAActM,EAAGsM,aAGlB,MAAfgC,EAAGpC,UAAoC,MAAhBuB,EAASc,IAAa,CAM7C,IAAIC,EAAY,KAChB,MAAMze,EAAQ,OAAA7F,EAAA,GAAS4E,GACvB,IAAK,IAAI9C,EAAI,EAAGA,EAAI+D,EAAMjJ,OAAQkF,IAC9BwiB,GAAa,EACTze,EAAM/D,KACNwiB,GAAa,IAGrBF,EAAGpC,SAAW,IAAUhmB,KAAKunB,EAASc,KAAKjmB,IAAIkmB,GAGnD,GAAIxO,EAAGxZ,MAAO,CACV,MAAMioB,EAAU,IAAUvoB,KAAK8Z,EAAGxZ,OAC7BioB,EAAQpjB,UAAaoiB,EAASiB,SAC/B3oB,EAAOW,WAAW,2CAA4C,IAAOC,OAAOiC,sBAAuB,CAC/FrC,UAAW,kBACXC,MAAOknB,EAAUlnB,QAGzB8nB,EAAG9nB,MAAQioB,EAEXzO,EAAGyM,aACH6B,EAAG7B,WAAa,YAAYzM,EAAGyM,aAE/BzM,EAAG0M,kBACH4B,EAAG5B,kBAAoB1M,EAAG0M,wBAGvBgB,EAAUtB,aACVsB,EAAUxB,gBACVwB,EAAUvB,gBACVuB,EAAUxnB,YACVwnB,EAAUlnB,aACVknB,EAAUnkB,YACVmkB,EAAUpB,kBACVoB,EAAUnB,oBACVmB,EAAUlB,4BACVkB,EAAUjB,kBACViB,EAAUhB,gBAGjB,MAAMiC,EAAY1lB,OAAO2lB,KAAKlB,GAAWmB,QAAQvlB,GAA2B,MAAlBokB,EAAUpkB,KAOpE,OANIqlB,EAAU7nB,QACVf,EAAOW,WAAW,mBAAmBioB,EAAU5gB,KAAK6Q,GAAMkQ,KAAKC,UAAUnQ,KAAIoQ,KAAK,KAAQ,IAAOroB,OAAOiC,sBAAuB,CAC3HrC,UAAW,YACXmnB,UAAWiB,IAGZL,KAsBf,SAASW,EAAgBzB,EAAUc,GAC/B,MAAMY,EAAOZ,EAAGY,KAAKC,KAAKb,GAC1BA,EAAGY,KAAQE,GACAF,EAAKE,GAAerD,MAAMsD,IAC7BA,EAAQC,OAASD,EAAQE,KAAKxhB,KAAKyhB,IAC/B,IAAIC,EAAQ,YAASD,GACjBE,EAAS,KACb,IACIA,EAASlC,EAASY,UAAUuB,SAASH,GAEzC,MAAOtoB,IAqBP,OAnBIwoB,IACAD,EAAM/iB,KAAOgjB,EAAOhjB,KACpB+iB,EAAMG,OAAS,CAAC9gB,EAAM+gB,IACXrC,EAASY,UAAU0B,eAAeJ,EAAOK,cAAejhB,EAAM+gB,GAEzEJ,EAAMA,MAAQC,EAAO5mB,KACrB2mB,EAAMO,eAAiBN,EAAOlgB,WAGlCigB,EAAMQ,eAAiB,IAAezC,EAASS,SAC/CwB,EAAMS,SAAW,IACN1C,EAASS,SAASiC,SAASb,EAAQc,WAE9CV,EAAMW,eAAiB,IACZ5C,EAASS,SAASmC,eAAef,EAAQgB,iBAEpDZ,EAAMa,sBAAwB,IACnB7E,QAAQD,QAAQ6D,GAEpBI,KAEJJ,KAInB,SAASkB,EAAU/C,EAAUC,EAAU+C,GACnC,MAAMC,EAAoBjD,EAASM,QAAUN,EAASS,SACtD,OAAO,YAAavhB,GAChB,OAAOwe,EAAUriB,UAAKA,OAAC,GAAQ,YAE3B,IAAI6nB,EACJ,GAAIhkB,EAAK5F,SAAW2mB,EAASE,OAAO7mB,OAAS,GAAwC,iBAA3B4F,EAAKA,EAAK5F,OAAS,GAAkB,CAC3F,MAAM4mB,EAAY,YAAYhhB,EAAKkhB,OACT,MAAtBF,EAAUgD,WACVA,QAAiBhD,EAAUgD,iBAExBhD,EAAUgD,SACjBhkB,EAAKhC,KAAKgjB,GAGoB,MAA9BF,EAASmD,0BACHnD,EAASoD,UAAUF,IAG7B,MAAMpC,QAAWf,EAAoBC,EAAUC,EAAU/gB,GACnD/B,QAAe8lB,EAAiB5jB,KAAKyhB,EAAIoC,GAC/C,IACI,IAAIlqB,EAAQgnB,EAASY,UAAUyC,qBAAqBpD,EAAU9iB,GAI9D,OAHI6lB,GAA8C,IAA5B/C,EAASqD,QAAQhqB,SACnCN,EAAQA,EAAM,IAEXA,EAEX,MAAO0F,GAMH,MALIA,EAAMC,OAAS,IAAOxF,OAAOoqB,iBAC7B7kB,EAAM4gB,QAAUU,EAASV,QACzB5gB,EAAMQ,KAAOA,EACbR,EAAM8kB,YAAc1C,GAElBpiB,OAyBtB,SAAS+kB,EAAazD,EAAUC,EAAU+C,GACtC,OAAI/C,EAASyD,SACFX,EAAU/C,EAAUC,EAAU+C,GAtB7C,SAAmBhD,EAAUC,GACzB,OAAO,YAAa/gB,GAChB,OAAOwe,EAAUriB,UAAKA,OAAC,GAAQ,YACtB2kB,EAASM,QACV/nB,EAAOW,WAAW,0CAA2C,IAAOC,OAAOiC,sBAAuB,CAC9FrC,UAAW,oBAIe,MAA9BinB,EAASmD,0BACHnD,EAASoD,aAEnB,MAAMO,QAAkB5D,EAAoBC,EAAUC,EAAU/gB,GAC1D4hB,QAAWd,EAASM,OAAOsD,gBAAgBD,GAGjD,OADAlC,EAAgBzB,EAAUc,GACnBA,MAQR+C,CAAU7D,EAAUC,GAE/B,SAAS6D,EAAYzC,GACjB,OAAIA,EAAO/B,SAA6B,MAAjB+B,EAAOgB,QAA2C,IAAzBhB,EAAOgB,OAAO/oB,QAGtD+nB,EAAO/B,SAAW,KAAO,KAAO+B,EAAOgB,OAAShB,EAAOgB,OAAO9hB,KAAKwjB,GACnE5kB,MAAMqG,QAAQue,GACPA,EAAMvC,KAAK,KAEfuC,IACRvC,KAAK,KAAO,IAPJ,GAAG,CASlB,MAAM,EACFxmB,YAAYgpB,EAAK3C,GACb,YAAehmB,KAAM,MAAO2oB,GAC5B,YAAe3oB,KAAM,SAAUgmB,GAC/BhmB,KAAK4oB,WAAa,EAAE,CAExBC,YAAYC,EAAUC,GAClB/oB,KAAK4oB,WAAW/mB,KAAK,CAAEinB,SAAUA,EAAUC,KAAMA,IAErD3B,eAAe0B,GACX,IAAI7F,KACJjjB,KAAK4oB,WAAa5oB,KAAK4oB,WAAW5C,QAAQ7gB,MAClC8d,GAAQ9d,EAAK2jB,WAAaA,IAG9B7F,KAAO,KACA,CAGf+F,qBACIhpB,KAAK4oB,WAAa,EAAE,CAExBK,YACI,OAAOjpB,KAAK4oB,WAAW1jB,KAAK/B,GAAMA,EAAE2lB,UAASA,CAEjDI,gBACI,OAAOlpB,KAAK4oB,WAAW3qB,MAAMA,CAEjCkrB,IAAItlB,GACA,MAAMqlB,EAAgBlpB,KAAKkpB,gBAU3B,OATAlpB,KAAK4oB,WAAa5oB,KAAK4oB,WAAW5C,QAAQ7gB,IACtC,MAAMikB,EAAWvlB,EAAKD,QAMtB,OAJAylB,YAAW,KACPlkB,EAAK2jB,SAAS3kB,MAAMnE,KAAMopB,KAC3B,IAEMjkB,EAAS,QAEf+jB,EAEXI,aAAa1C,IAGb2C,QAAQ3C,GACJ,MAAO,CAACA,IAGhB,MAAM4C,UAA0B,EAC5B7pB,cACI8pB,MAAM,QAAS,KAAK,EAQ5B,MAAM,UAA6B,EAC/B9pB,YAAYskB,EAASyF,EAAmB9E,EAAUoC,GAC9C,MAAMhB,EAAS,CACX/B,QAASA,GAEb,IAAIyE,EAAQgB,EAAkBC,cAAc/E,GACxCoC,GACI0B,IAAU1B,EAAO,IACjB9pB,EAAOqB,mBAAmB,iBAAkB,SAAUyoB,GAE1DhB,EAAOgB,OAASA,EAAOpjB,SAGvBoiB,EAAOgB,OAAS,CAAC0B,GAErBe,MAAMhB,EAAYzC,GAASA,GAC3B,YAAehmB,KAAM,UAAWikB,GAChC,YAAejkB,KAAM,YAAa0pB,GAClC,YAAe1pB,KAAM,WAAY4kB,GAErC0E,aAAa1C,GACT6C,MAAMH,aAAa1C,GACnBA,EAAMA,MAAQ5mB,KAAK4kB,SAAS3kB,KAC5B2mB,EAAMO,eAAiBnnB,KAAK4kB,SAAS9jB,SACrC8lB,EAAMG,OAAS,CAAC9gB,EAAM+gB,IACXhnB,KAAKulB,UAAU0B,eAAejnB,KAAK4kB,SAAU3e,EAAM+gB,GAE9D,IACIJ,EAAM/iB,KAAO7D,KAAKulB,UAAU0B,eAAejnB,KAAK4kB,SAAUgC,EAAM3gB,KAAM2gB,EAAMI,OAAOA,CAEvF,MAAO3jB,GACHujB,EAAM/iB,KAAO,KACb+iB,EAAMgD,YAAcvmB,GAG5BkmB,QAAQ3C,GACJ,MAAM9oB,EAAS,YAAkB8oB,EAAM/iB,MACvC,GAAI/F,EAAOG,OACP,MAAMH,EAAO,GAAGuF,MAEpB,MAAMQ,GAAQ+iB,EAAM/iB,MAAQ,IAAID,QAEhC,OADAC,EAAKhC,KAAK+kB,GACH/iB,GAQf,MAAM,UAA6B,EAC/BlE,YAAYskB,EAASyF,GACjBD,MAAM,IAAK,CAAExF,QAASA,IACtB,YAAejkB,KAAM,UAAWikB,GAChC,YAAejkB,KAAM,YAAa0pB,GAEtCJ,aAAa1C,GACT6C,MAAMH,aAAa1C,GACnB,IACI,MAAMC,EAAS7mB,KAAKulB,UAAUuB,SAASF,GACvCA,EAAMA,MAAQC,EAAO5mB,KACrB2mB,EAAMO,eAAiBN,EAAOlgB,UAC9BigB,EAAMG,OAAS,CAAC9gB,EAAM+gB,IACXhnB,KAAKulB,UAAU0B,eAAeJ,EAAOK,cAAejhB,EAAM+gB,GAErEJ,EAAM/iB,KAAOgjB,EAAOhjB,IAAIA,CAE5B,MAAOR,MAKR,MAAM,EACT1D,YAAYkqB,EAAeH,EAAmB9B,GAG1C,YAAe5nB,KAAM,YAAa,uBAAsB,eAAtB,CAAsC0pB,IAChD,MAApB9B,GACA,YAAe5nB,KAAM,WAAY,MACjC,YAAeA,KAAM,SAAU,OAE1B,IAAO8pB,SAASlC,IACrB,YAAe5nB,KAAM,WAAY4nB,EAAiBxC,UAAY,MAC9D,YAAeplB,KAAM,SAAU4nB,IAE1B,IAASmC,WAAWnC,IACzB,YAAe5nB,KAAM,WAAY4nB,GACjC,YAAe5nB,KAAM,SAAU,OAG/B9C,EAAOqB,mBAAmB,6BAA8B,mBAAoBqpB,GAEhF,YAAe5nB,KAAM,aAAc,CAAC,GACpC,YAAeA,KAAM,cAAe,CAAC,GACrC,YAAeA,KAAM,YAAa,CAAC,GACnC,YAAeA,KAAM,sBAAuB,CAAC,GAC7C,YAAeA,KAAM,UAAW,CAAC,GACjC,CACI,MAAMgqB,EAAgB,CAAC,EACvB5pB,OAAO2lB,KAAK/lB,KAAKulB,UAAUkB,QAAQpgB,SAAS8gB,IACxC,MAAMP,EAAQ5mB,KAAKulB,UAAUkB,OAAOU,GACpC,YAAennB,KAAKiqB,QAAS9C,GAAgB,IAAItjB,MAEzCogB,QAASjkB,KAAKikB,QACd+C,OAAQhnB,KAAKulB,UAAU2E,mBAAmBtD,EAAO/iB,OAGpDmmB,EAAcpD,EAAM3mB,QACrB+pB,EAAcpD,EAAM3mB,MAAQ,IAEhC+pB,EAAcpD,EAAM3mB,MAAM4B,KAAKslB,MAEnC/mB,OAAO2lB,KAAKiE,GAAe3jB,SAASpG,IAChC,MAAMgqB,EAAUD,EAAc/pB,GACP,IAAnBgqB,EAAQhsB,OACR,YAAe+B,KAAKiqB,QAAShqB,EAAMD,KAAKiqB,QAAQA,EAAQ,KAGxD/sB,EAAO6kB,KAAK,2BAA2B9hB,MAASgqB,EAAQ9D,KAAK,SAAQ,GAAR,CAUzE,GANA,YAAenmB,KAAM,iBAAkB,CAAC,GACxC,YAAeA,KAAM,gBAAiB,CAAC,GAClB,MAAjB6pB,GACA3sB,EAAOqB,mBAAmB,uCAAwC,gBAAiBsrB,GAEvF,YAAe7pB,KAAM,UAAW6pB,GAC5B7pB,KAAKolB,SACL,YAAeplB,KAAM,kBAAmB8jB,EAAY9jB,KAAKolB,SAAUyE,SAGnE,IACI,YAAe7pB,KAAM,kBAAmB4iB,QAAQD,QAAQ,YAAWkH,KAEvE,MAAOxmB,GAEHnG,EAAOW,WAAW,2DAA4D,IAAOC,OAAOiC,sBAAuB,CAC/GrC,UAAW,iBAKvBsC,KAAKslB,gBAAgB6E,OAAO9rB,QAC5B,MAAM+rB,EAAc,CAAC,EACfC,EAAmB,CAAC,EAC1BjqB,OAAO2lB,KAAK/lB,KAAKulB,UAAU+E,WAAWjkB,SAASM,IAC3C,MAAMie,EAAW5kB,KAAKulB,UAAU+E,UAAU3jB,GAG1C,GAAI0jB,EAAiB1jB,GACjBzJ,EAAO6kB,KAAK,2BAA2BkE,KAAKC,UAAUvf,QAD1D,CAIA0jB,EAAiB1jB,MAGjB,CACI,MAAM1G,EAAO2kB,EAAS3kB,KACjBmqB,EAAY,IAAInqB,KACjBmqB,EAAY,IAAInqB,GAAU,IAE9BmqB,EAAY,IAAInqB,GAAQ4B,KAAK8E,GAEV,MAAnB3G,KAAK2G,IACL,YAAe3G,KAAM2G,EAAWyhB,EAAapoB,KAAM4kB,OAKtB,MAA7B5kB,KAAKsqB,UAAU3jB,IACf,YAAe3G,KAAKsqB,UAAW3jB,EAAWyhB,EAAapoB,KAAM4kB,OAE/B,MAA9B5kB,KAAKuqB,WAAW5jB,IAChB,YAAe3G,KAAKuqB,WAAY5jB,EAAW+gB,EAAU1nB,KAAM4kB,OAEpB,MAAvC5kB,KAAK0kB,oBAAoB/d,IACzB,YAAe3G,KAAK0kB,oBAAqB/d,EA/WzD,SAAuBge,EAAUC,GAC7B,OAAO,YAAa/gB,GAChB,OAAO6gB,EAAoBC,EAAUC,EAAU/gB,IA6Wa2mB,CAAcxqB,KAAM4kB,IAEzC,MAA/B5kB,KAAKyqB,YAAY9jB,IACjB,YAAe3G,KAAKyqB,YAAa9jB,EA7WjD,SAAuBge,EAAUC,GAC7B,MAAMgD,EAAoBjD,EAASM,QAAUN,EAASS,SACtD,OAAO,YAAavhB,GAChB,OAAOwe,EAAUriB,UAAKA,OAAC,GAAQ,YACtB4nB,GACD1qB,EAAOW,WAAW,wCAAyC,IAAOC,OAAOiC,sBAAuB,CAC5FrC,UAAW,gBAGnB,MAAM+nB,QAAWf,EAAoBC,EAAUC,EAAU/gB,GACzD,aAAa+jB,EAAiB6C,YAAYhF,OAmWMiF,CAAc1qB,KAAM4kB,QAGxExkB,OAAO2lB,KAAKqE,GAAa/jB,SAASpG,IAE9B,MAAM0qB,EAAaP,EAAYnqB,GAC/B,GAAI0qB,EAAW1sB,OAAS,EACpB,OAGJgC,EAAOA,EAAK3B,UAAU,GACtB,MAAMqI,EAAYgkB,EAAW,GAE7B,IACsB,MAAd3qB,KAAKC,IACL,YAAeD,KAAMC,EAAMD,KAAK2G,IAGxC,MAAOtI,IACqB,MAAxB2B,KAAKsqB,UAAUrqB,IACf,YAAeD,KAAKsqB,UAAWrqB,EAAMD,KAAKsqB,UAAU3jB,IAE3B,MAAzB3G,KAAKuqB,WAAWtqB,IAChB,YAAeD,KAAKuqB,WAAYtqB,EAAMD,KAAKuqB,WAAW5jB,IAEpB,MAAlC3G,KAAK0kB,oBAAoBzkB,IACzB,YAAeD,KAAK0kB,oBAAqBzkB,EAAMD,KAAK0kB,oBAAoB/d,IAE9C,MAA1B3G,KAAKyqB,YAAYxqB,IACjB,YAAeD,KAAKyqB,YAAaxqB,EAAMD,KAAKyqB,YAAY9jB,OAIpErG,0BAA0B6nB,GACtB,OAAO,YAAmBA,GAE9B7nB,oBAAoBopB,GAChB,OAAI,IAAUkB,YAAYlB,GACfA,EAEJ,IAAI,IAAUA,GAGzBmB,WACI,OAAO7qB,KAAK+nB,WAAWA,CAE3BA,UAAUF,GAuBN,OAtBK7nB,KAAK8qB,mBAEF9qB,KAAK8nB,kBACL9nB,KAAK8qB,iBAAmB9qB,KAAK8nB,kBAAkBzB,OAAOnD,MAAK,IAChDljB,OAOXA,KAAK8qB,iBAAmB9qB,KAAKolB,SAAS2F,QAAQ/qB,KAAKikB,QAAS4D,GAAU3E,MAAM5f,IAC3D,OAATA,GACApG,EAAOW,WAAW,wBAAyB,IAAOC,OAAOiC,sBAAuB,CAC5EirB,gBAAiBhrB,KAAKikB,QACtBvmB,UAAW,gBAGZsC,SAIZA,KAAK8qB,gBAAgBA,CAMhCG,SAASpG,GACA7kB,KAAKilB,QACN/nB,EAAOW,WAAW,0CAA2C,IAAOC,OAAOiC,sBAAuB,CAAErC,UAAW,8BAEnH,MAAM+nB,EAAK,YAAYZ,GAAa,CAAC,GAQrC,MAPA,CAAC,OAAQ,MAAMxe,SAAQA,SAAU5F,GACd,MAAXglB,EAAGhlB,IAGPvD,EAAOW,WAAW,mBAAqB4C,EAAK,IAAO3C,OAAOiC,sBAAuB,CAAErC,UAAW+C,OAElGglB,EAAGjC,GAAKxjB,KAAKslB,gBACNtlB,KAAK6qB,WAAW3H,MAAK,IACjBljB,KAAKilB,OAAOsD,gBAAgB9C,KAI3CyF,QAAQtD,GAC8B,iBAAvB,IACPA,EAAmB,IAAI,IAAWA,EAAkB5nB,KAAKolB,WAE7D,MAAMT,EAAW,IAAK3kB,KAAgB,YAAEA,KAAKikB,QAASjkB,KAAKulB,UAAWqC,GAItE,OAHI5nB,KAAK8nB,mBACL,YAAenD,EAAU,oBAAqB3kB,KAAK8nB,mBAEhDnD,EAGXwG,OAAOtB,GACH,OAAO,IAAK7pB,KAAgB,YAAE6pB,EAAe7pB,KAAKulB,UAAWvlB,KAAKilB,QAAUjlB,KAAKolB,SAASA,CAE9F9kB,iBAAiB3C,GACb,OAAO,IAAQytB,UAAUztB,GAE7B0tB,uBAAuBC,GAEnB,OAAItrB,KAAKurB,eAAeD,EAAa3C,KAC1B3oB,KAAKurB,eAAeD,EAAa3C,KAErC2C,EAEXE,iBAAiBC,GACb,GAA2B,iBAAhB,EAA0B,CAGjC,GAAkB,UAAdA,EACA,OAAOzrB,KAAKqrB,uBAAuB,IAAI7B,GAG3C,GAAkB,UAAdiC,EACA,OAAOzrB,KAAKqrB,uBAAuB,IAAI,EAAa,QAAS,OAGjE,GAAkB,MAAdI,EACA,OAAOzrB,KAAKqrB,uBAAuB,IAAI,EAAqBrrB,KAAKikB,QAASjkB,KAAKulB,YAGnF,MAAMX,EAAW5kB,KAAKulB,UAAUmG,SAASD,GACzC,OAAOzrB,KAAKqrB,uBAAuB,IAAI,EAAqBrrB,KAAKikB,QAASjkB,KAAKulB,UAAWX,IAG9F,GAAI6G,EAAUzE,QAAUyE,EAAUzE,OAAO/oB,OAAS,EAAG,CAEjD,IACI,MAAMyqB,EAAQ+C,EAAUzE,OAAO,GAC/B,GAAuB,iBAAZ,EACP,MAAM,IAAI9jB,MAAM,iBAEpB,MAAM0hB,EAAW5kB,KAAKulB,UAAUmG,SAAShD,GACzC,OAAO1oB,KAAKqrB,uBAAuB,IAAI,EAAqBrrB,KAAKikB,QAASjkB,KAAKulB,UAAWX,EAAU6G,EAAUzE,QAAQA,CAE1H,MAAO3jB,IAEP,MAAM2iB,EAAS,CACX/B,QAASjkB,KAAKikB,QACd+C,OAAQyE,EAAUzE,QAEtB,OAAOhnB,KAAKqrB,uBAAuB,IAAI,EAAa5C,EAAYzC,GAASA,IAE7E,OAAOhmB,KAAKqrB,uBAAuB,IAAI,EAAqBrrB,KAAKikB,QAASjkB,KAAKulB,WAAWA,CAE9FoG,oBAAoBL,GAChB,GAAqC,IAAjCA,EAAapC,gBAAuB,QAC7BlpB,KAAKurB,eAAeD,EAAa3C,KAExC,MAAMiD,EAAO5rB,KAAK6rB,cAAcP,EAAa3C,KACzCiD,GAAQN,EAAatF,SACrBhmB,KAAKolB,SAASna,IAAIqgB,EAAatF,OAAQ4F,UAChC5rB,KAAK6rB,cAAcP,EAAa3C,OAMnDmD,WAAWR,EAAc3E,EAAKmC,GAC1B,MAAMlC,EAAQ,YAASD,GAavB,OAZAC,EAAMQ,eAAiB,KACd0B,IAGLwC,EAAalE,eAAe0B,GAC5B9oB,KAAK2rB,oBAAoBL,KAE7B1E,EAAMS,SAAW,IAAernB,KAAKolB,SAASiC,SAASV,EAAIW,WAC3DV,EAAMW,eAAiB,IAAevnB,KAAKolB,SAASmC,eAAeZ,EAAIa,iBACvEZ,EAAMa,sBAAwB,IAAeznB,KAAKolB,SAASqC,sBAAsBd,EAAIa,iBAErF8D,EAAahC,aAAa1C,GACnBA,EAEXmF,kBAAkBT,EAAcxC,EAAUC,GAQtC,GAPK/oB,KAAKolB,UACNloB,EAAOW,WAAW,wDAAyD,IAAOC,OAAOiC,sBAAuB,CAAErC,UAAW,SAEjI4tB,EAAazC,YAAYC,EAAUC,GAEnC/oB,KAAKurB,eAAeD,EAAa3C,KAAO2C,GAEnCtrB,KAAK6rB,cAAcP,EAAa3C,KAAM,CACvC,MAAMqD,EAAerF,IACjB,IAAIC,EAAQ5mB,KAAK8rB,WAAWR,EAAc3E,EAAKmC,GAE/C,GAAyB,MAArBlC,EAAMgD,YACN,IACI,MAAM/lB,EAAOynB,EAAa/B,QAAQ3C,GAClC5mB,KAAK4rB,KAAKN,EAAatF,UAAWniB,GAEtC,MAAOR,GACHujB,EAAMgD,YAAcvmB,EAAMA,KAAKA,CAIZ,MAAvBioB,EAAatF,QACbhmB,KAAK4rB,KAAK,QAAShF,GAGE,MAArBA,EAAMgD,aACN5pB,KAAK4rB,KAAK,QAAShF,EAAMgD,YAAahD,IAG9C5mB,KAAK6rB,cAAcP,EAAa3C,KAAOqD,EAEZ,MAAvBV,EAAatF,QACbhmB,KAAKolB,SAAS6G,GAAGX,EAAatF,OAAQgG,IAIlDE,YAAYtF,EAAOuF,EAAsBC,GACrC,MAAMd,EAAetrB,KAAKwrB,iBAAiB5E,GACrCZ,EAAS,YAAYsF,EAAatF,QAWxC,MAVsC,iBAA3B,GAAuC,YAAYmG,EAAsB,KACjE,MAAXC,GACAlvB,EAAOqB,mBAAmB,wCAAyC,UAAW6tB,GAElFpG,EAAOsB,UAAY6E,IAGnBnG,EAAOqG,UAAsC,MAAxBF,EAAgCA,EAAuB,EAC5EnG,EAAOoG,QAAuB,MAAXA,EAAmBA,EAAU,UAE7CpsB,KAAKolB,SAASkH,QAAQtG,GAAQ9C,MAAMwD,GAChCA,EAAKxhB,KAAKyhB,GAAQ3mB,KAAK8rB,WAAWR,EAAc3E,EAAK,UAGpEsF,GAAGrF,EAAOkC,GAEN,OADA9oB,KAAK+rB,kBAAkB/rB,KAAKwrB,iBAAiB5E,GAAQkC,MAC9C9oB,IAAIA,CAEf+oB,KAAKnC,EAAOkC,GAER,OADA9oB,KAAK+rB,kBAAkB/rB,KAAKwrB,iBAAiB5E,GAAQkC,MAC9C9oB,IAAIA,CAEf4rB,KAAKH,KAAc5nB,GACf,IAAK7D,KAAKolB,SACN,OAAM,EAEV,MAAMkG,EAAetrB,KAAKwrB,iBAAiBC,GACrC3pB,EAAUwpB,EAAanC,IAAItlB,GAAQ,EAGzC,OADA7D,KAAK2rB,oBAAoBL,GAClBxpB,EAEXonB,cAAcuC,GACV,OAAKzrB,KAAKolB,SAGO,MAAbqG,EACOrrB,OAAO2lB,KAAK/lB,KAAKurB,gBAAgBnmB,QAAO,CAACC,EAAO5E,IAC5C4E,EAAQrF,KAAKurB,eAAe9qB,GAAKyoB,iBACzC,GAEAlpB,KAAKwrB,iBAAiBC,GAAWvC,gBAP7B,CAAC,CAShBD,UAAUwC,GACN,IAAKzrB,KAAKolB,SACN,MAAO,GAEX,GAAiB,MAAbqG,EAAmB,CACnB,MAAM3pB,EAAS,GACf,IAAK,IAAI6mB,KAAO3oB,KAAKurB,eACjBvrB,KAAKurB,eAAe5C,GAAKM,YAAY5iB,SAASyiB,IAC1ChnB,EAAOD,KAAKinB,MAGpB,OAAOhnB,EAEX,OAAO9B,KAAKwrB,iBAAiBC,GAAWxC,WAAWA,CAEvDD,mBAAmByC,GACf,IAAKzrB,KAAKolB,SACN,OAAOplB,KAEX,GAAiB,MAAbyrB,EAAmB,CACnB,IAAK,MAAM9C,KAAO3oB,KAAKurB,eAAgB,CACnC,MAAMD,EAAetrB,KAAKurB,eAAe5C,GACzC2C,EAAatC,qBACbhpB,KAAK2rB,oBAAoBL,GAE7B,OAAOtrB,IAAIA,CAGf,MAAMsrB,EAAetrB,KAAKwrB,iBAAiBC,GAG3C,OAFAH,EAAatC,qBACbhpB,KAAK2rB,oBAAoBL,GAClBtrB,IAAIA,CAEfiL,IAAIwgB,EAAW3C,GACX,IAAK9oB,KAAKolB,SACN,OAAOplB,KAEX,MAAMsrB,EAAetrB,KAAKwrB,iBAAiBC,GAG3C,OAFAH,EAAalE,eAAe0B,GAC5B9oB,KAAK2rB,oBAAoBL,GAClBtrB,IAAIA,CAEfonB,eAAeqE,EAAW3C,GACtB,OAAO9oB,KAAKiL,IAAIwgB,EAAW3C,IAG5B,MAAMyD,UAAiB,GAEvB,MAAM,EACT5sB,YAAY+pB,EAAmB8C,EAAUvH,GACrC,IAAIwH,EAAc,KAEdA,EADsB,iBAAf,EACOD,EAET,YAAQA,GACC,YAAQA,GAEjBA,GAAyC,iBAArBA,EAAe,OAE1BA,EAASjnB,OAIT,IAGkB,OAAhCknB,EAAYnuB,UAAU,EAAG,KACzBmuB,EAAc,KAAOA,KAGpB,YAAYA,IAAiBA,EAAYxuB,OAAS,IACnDf,EAAOqB,mBAAmB,mBAAoB,WAAYiuB,GAG1DvH,IAAW,IAAO6E,SAAS7E,IAC3B/nB,EAAOqB,mBAAmB,iBAAkB,SAAU0mB,GAE1D,YAAejlB,KAAM,WAAYysB,GACjC,YAAezsB,KAAM,YAAa,uBAAsB,eAAtB,CAAsC0pB,IACxE,YAAe1pB,KAAM,SAAUilB,GAAU,KAAK,CAGlDyH,wBAAwB7oB,GACpB,IAAI4hB,EAAK,CAAC,EAEV,GAAI5hB,EAAK5F,SAAW+B,KAAKulB,UAAUoH,OAAO7H,OAAO7mB,OAAS,GAAwC,iBAA3B4F,EAAKA,EAAK5F,OAAS,GAAkB,CACxGwnB,EAAK,YAAY5hB,EAAKkhB,OACtB,IAAK,MAAMtkB,KAAOglB,EACd,IAAKtC,EAAuB1iB,GACxB,MAAM,IAAIyC,MAAM,gCAAkCzC,GAW9D,GANA,CAAC,OAAQ,OAAQ,MAAM4F,SAAS5F,IACb,MAAXglB,EAAGhlB,IAGPvD,EAAOW,WAAW,mBAAqB4C,EAAK,IAAO3C,OAAOiC,sBAAuB,CAAErC,UAAW+C,OAE9FglB,EAAG9nB,MAAO,CACI,IAAUN,KAAKooB,EAAG9nB,OACrB6E,UAAaxC,KAAKulB,UAAUoH,OAAO9G,SAC1C3oB,EAAOW,WAAW,gDAAiD,IAAOC,OAAOiC,sBAAuB,CACpGrC,UAAW,kBACXC,MAAO8nB,EAAG9nB,QAWtB,OANAT,EAAO8nB,mBAAmBnhB,EAAK5F,OAAQ+B,KAAKulB,UAAUoH,OAAO7H,OAAO7mB,OAAQ,4BAE5EwnB,EAAGxf,KAAO,YAAQ,YAAO,CACrBjG,KAAKwsB,SACLxsB,KAAKulB,UAAUqH,aAAa/oB,MAEzB4hB,EAEXkH,UAAU9oB,GACN,OAAOwe,EAAUriB,UAAKA,OAAC,GAAQ,YAC3B,IAAI6kB,EAAY,CAAC,EAEbhhB,EAAK5F,SAAW+B,KAAKulB,UAAUoH,OAAO7H,OAAO7mB,OAAS,IACtD4mB,EAAYhhB,EAAKkhB,OAGrB7nB,EAAO8nB,mBAAmBnhB,EAAK5F,OAAQ+B,KAAKulB,UAAUoH,OAAO7H,OAAO7mB,OAAQ,4BAE5E,MAAML,QAAesmB,EAAiBlkB,KAAKilB,OAAQphB,EAAM7D,KAAKulB,UAAUoH,OAAO7H,QAC/ElnB,EAAOiE,KAAKgjB,GAEZ,MAAMgI,EAAa7sB,KAAK0sB,wBAAwB9uB,GAE1C6nB,QAAWzlB,KAAKilB,OAAOsD,gBAAgBsE,GACvC5I,EAAU,YAAUjkB,KAAKL,YAAa,qBAA5B,CAAkD8lB,GAC5Dd,EAAW,YAAU3kB,KAAKL,YAAa,cAA5B,CAA2CskB,EAASjkB,KAAKulB,UAAWvlB,KAAKilB,QAI1F,OAFAmB,EAAgBzB,EAAUc,GAC1B,YAAed,EAAU,oBAAqBc,GACvCd,KAGfwG,OAAOlH,GACH,OAAQjkB,KAAgB,YAAE8sB,YAAY7I,EAASjkB,KAAKulB,UAAWvlB,KAAKilB,OAAOA,CAE/EiG,QAAQjG,GACJ,OAAO,IAAKjlB,KAAgB,YAAEA,KAAKulB,UAAWvlB,KAAKwsB,SAAUvH,GAEjE3kB,oBAAoBysB,EAAgB9H,GACV,MAAlB8H,GACA7vB,EAAOW,WAAW,0BAA2B,IAAOC,OAAOkvB,iBAAkB,CAAEvI,SAAU,mBAE7D,iBAArB,IACPsI,EAAiB9G,KAAKgH,MAAMF,IAEhC,MAAMG,EAAMH,EAAeG,IAC3B,IAAIV,EAAW,KAOf,OANIO,EAAeP,SACfA,EAAWO,EAAeP,SAErBO,EAAeI,KAAOJ,EAAeI,IAAIX,WAC9CA,EAAWO,EAAeI,IAAIX,UAE3B,IAAIxsB,KAAKktB,EAAKV,EAAUvH,GAEnC3kB,oBAAoBopB,GAChB,OAAO6C,EAASa,aAAa1D,GAEjCppB,0BAA0BmlB,GACtB,OAAO,YAAmBA,GAE9BnlB,mBAAmB2jB,EAASyF,EAAmBzE,GAC3C,OAAO,IAAIsH,EAAStI,EAASyF,EAAmBzE","file":"js/chunk-vendors~5cbdb1e7.2e54f802.js","sourcesContent":["\"use strict\";\nimport { arrayify, hexZeroPad, isBytes } from \"@ethersproject/bytes\";\nimport { Logger } from \"@ethersproject/logger\";\nimport { version } from \"./_version\";\nconst logger = new Logger(version);\nimport { BigNumber, isBigNumberish } from \"./bignumber\";\nconst _constructorGuard = {};\nconst Zero = BigNumber.from(0);\nconst NegativeOne = BigNumber.from(-1);\nfunction throwFault(message, fault, operation, value) {\n    const params = { fault: fault, operation: operation };\n    if (value !== undefined) {\n        params.value = value;\n    }\n    return logger.throwError(message, Logger.errors.NUMERIC_FAULT, params);\n}\n// Constant to pull zeros from for multipliers\nlet zeros = \"0\";\nwhile (zeros.length < 256) {\n    zeros += zeros;\n}\n// Returns a string \"1\" followed by decimal \"0\"s\nfunction getMultiplier(decimals) {\n    if (typeof (decimals) !== \"number\") {\n        try {\n            decimals = BigNumber.from(decimals).toNumber();\n        }\n        catch (e) { }\n    }\n    if (typeof (decimals) === \"number\" && decimals >= 0 && decimals <= 256 && !(decimals % 1)) {\n        return (\"1\" + zeros.substring(0, decimals));\n    }\n    return logger.throwArgumentError(\"invalid decimal size\", \"decimals\", decimals);\n}\nexport function formatFixed(value, decimals) {\n    if (decimals == null) {\n        decimals = 0;\n    }\n    const multiplier = getMultiplier(decimals);\n    // Make sure wei is a big number (convert as necessary)\n    value = BigNumber.from(value);\n    const negative = value.lt(Zero);\n    if (negative) {\n        value = value.mul(NegativeOne);\n    }\n    let fraction = value.mod(multiplier).toString();\n    while (fraction.length < multiplier.length - 1) {\n        fraction = \"0\" + fraction;\n    }\n    // Strip training 0\n    fraction = fraction.match(/^([0-9]*[1-9]|0)(0*)/)[1];\n    const whole = value.div(multiplier).toString();\n    if (multiplier.length === 1) {\n        value = whole;\n    }\n    else {\n        value = whole + \".\" + fraction;\n    }\n    if (negative) {\n        value = \"-\" + value;\n    }\n    return value;\n}\nexport function parseFixed(value, decimals) {\n    if (decimals == null) {\n        decimals = 0;\n    }\n    const multiplier = getMultiplier(decimals);\n    if (typeof (value) !== \"string\" || !value.match(/^-?[0-9.]+$/)) {\n        logger.throwArgumentError(\"invalid decimal value\", \"value\", value);\n    }\n    // Is it negative?\n    const negative = (value.substring(0, 1) === \"-\");\n    if (negative) {\n        value = value.substring(1);\n    }\n    if (value === \".\") {\n        logger.throwArgumentError(\"missing value\", \"value\", value);\n    }\n    // Split it into a whole and fractional part\n    const comps = value.split(\".\");\n    if (comps.length > 2) {\n        logger.throwArgumentError(\"too many decimal points\", \"value\", value);\n    }\n    let whole = comps[0], fraction = comps[1];\n    if (!whole) {\n        whole = \"0\";\n    }\n    if (!fraction) {\n        fraction = \"0\";\n    }\n    // Trim trailing zeros\n    while (fraction[fraction.length - 1] === \"0\") {\n        fraction = fraction.substring(0, fraction.length - 1);\n    }\n    // Check the fraction doesn't exceed our decimals size\n    if (fraction.length > multiplier.length - 1) {\n        throwFault(\"fractional component exceeds decimals\", \"underflow\", \"parseFixed\");\n    }\n    // If decimals is 0, we have an empty string for fraction\n    if (fraction === \"\") {\n        fraction = \"0\";\n    }\n    // Fully pad the string with zeros to get to wei\n    while (fraction.length < multiplier.length - 1) {\n        fraction += \"0\";\n    }\n    const wholeValue = BigNumber.from(whole);\n    const fractionValue = BigNumber.from(fraction);\n    let wei = (wholeValue.mul(multiplier)).add(fractionValue);\n    if (negative) {\n        wei = wei.mul(NegativeOne);\n    }\n    return wei;\n}\nexport class FixedFormat {\n    constructor(constructorGuard, signed, width, decimals) {\n        if (constructorGuard !== _constructorGuard) {\n            logger.throwError(\"cannot use FixedFormat constructor; use FixedFormat.from\", Logger.errors.UNSUPPORTED_OPERATION, {\n                operation: \"new FixedFormat\"\n            });\n        }\n        this.signed = signed;\n        this.width = width;\n        this.decimals = decimals;\n        this.name = (signed ? \"\" : \"u\") + \"fixed\" + String(width) + \"x\" + String(decimals);\n        this._multiplier = getMultiplier(decimals);\n        Object.freeze(this);\n    }\n    static from(value) {\n        if (value instanceof FixedFormat) {\n            return value;\n        }\n        if (typeof (value) === \"number\") {\n            value = `fixed128x${value}`;\n        }\n        let signed = true;\n        let width = 128;\n        let decimals = 18;\n        if (typeof (value) === \"string\") {\n            if (value === \"fixed\") {\n                // defaults...\n            }\n            else if (value === \"ufixed\") {\n                signed = false;\n            }\n            else {\n                const match = value.match(/^(u?)fixed([0-9]+)x([0-9]+)$/);\n                if (!match) {\n                    logger.throwArgumentError(\"invalid fixed format\", \"format\", value);\n                }\n                signed = (match[1] !== \"u\");\n                width = parseInt(match[2]);\n                decimals = parseInt(match[3]);\n            }\n        }\n        else if (value) {\n            const check = (key, type, defaultValue) => {\n                if (value[key] == null) {\n                    return defaultValue;\n                }\n                if (typeof (value[key]) !== type) {\n                    logger.throwArgumentError(\"invalid fixed format (\" + key + \" not \" + type + \")\", \"format.\" + key, value[key]);\n                }\n                return value[key];\n            };\n            signed = check(\"signed\", \"boolean\", signed);\n            width = check(\"width\", \"number\", width);\n            decimals = check(\"decimals\", \"number\", decimals);\n        }\n        if (width % 8) {\n            logger.throwArgumentError(\"invalid fixed format width (not byte aligned)\", \"format.width\", width);\n        }\n        if (decimals > 80) {\n            logger.throwArgumentError(\"invalid fixed format (decimals too large)\", \"format.decimals\", decimals);\n        }\n        return new FixedFormat(_constructorGuard, signed, width, decimals);\n    }\n}\nexport class FixedNumber {\n    constructor(constructorGuard, hex, value, format) {\n        if (constructorGuard !== _constructorGuard) {\n            logger.throwError(\"cannot use FixedNumber constructor; use FixedNumber.from\", Logger.errors.UNSUPPORTED_OPERATION, {\n                operation: \"new FixedFormat\"\n            });\n        }\n        this.format = format;\n        this._hex = hex;\n        this._value = value;\n        this._isFixedNumber = true;\n        Object.freeze(this);\n    }\n    _checkFormat(other) {\n        if (this.format.name !== other.format.name) {\n            logger.throwArgumentError(\"incompatible format; use fixedNumber.toFormat\", \"other\", other);\n        }\n    }\n    addUnsafe(other) {\n        this._checkFormat(other);\n        const a = parseFixed(this._value, this.format.decimals);\n        const b = parseFixed(other._value, other.format.decimals);\n        return FixedNumber.fromValue(a.add(b), this.format.decimals, this.format);\n    }\n    subUnsafe(other) {\n        this._checkFormat(other);\n        const a = parseFixed(this._value, this.format.decimals);\n        const b = parseFixed(other._value, other.format.decimals);\n        return FixedNumber.fromValue(a.sub(b), this.format.decimals, this.format);\n    }\n    mulUnsafe(other) {\n        this._checkFormat(other);\n        const a = parseFixed(this._value, this.format.decimals);\n        const b = parseFixed(other._value, other.format.decimals);\n        return FixedNumber.fromValue(a.mul(b).div(this.format._multiplier), this.format.decimals, this.format);\n    }\n    divUnsafe(other) {\n        this._checkFormat(other);\n        const a = parseFixed(this._value, this.format.decimals);\n        const b = parseFixed(other._value, other.format.decimals);\n        return FixedNumber.fromValue(a.mul(this.format._multiplier).div(b), this.format.decimals, this.format);\n    }\n    floor() {\n        const comps = this.toString().split(\".\");\n        if (comps.length === 1) {\n            comps.push(\"0\");\n        }\n        let result = FixedNumber.from(comps[0], this.format);\n        const hasFraction = !comps[1].match(/^(0*)$/);\n        if (this.isNegative() && hasFraction) {\n            result = result.subUnsafe(ONE.toFormat(result.format));\n        }\n        return result;\n    }\n    ceiling() {\n        const comps = this.toString().split(\".\");\n        if (comps.length === 1) {\n            comps.push(\"0\");\n        }\n        let result = FixedNumber.from(comps[0], this.format);\n        const hasFraction = !comps[1].match(/^(0*)$/);\n        if (!this.isNegative() && hasFraction) {\n            result = result.addUnsafe(ONE.toFormat(result.format));\n        }\n        return result;\n    }\n    // @TODO: Support other rounding algorithms\n    round(decimals) {\n        if (decimals == null) {\n            decimals = 0;\n        }\n        // If we are already in range, we're done\n        const comps = this.toString().split(\".\");\n        if (comps.length === 1) {\n            comps.push(\"0\");\n        }\n        if (decimals < 0 || decimals > 80 || (decimals % 1)) {\n            logger.throwArgumentError(\"invalid decimal count\", \"decimals\", decimals);\n        }\n        if (comps[1].length <= decimals) {\n            return this;\n        }\n        const factor = FixedNumber.from(\"1\" + zeros.substring(0, decimals), this.format);\n        const bump = BUMP.toFormat(this.format);\n        return this.mulUnsafe(factor).addUnsafe(bump).floor().divUnsafe(factor);\n    }\n    isZero() {\n        return (this._value === \"0.0\" || this._value === \"0\");\n    }\n    isNegative() {\n        return (this._value[0] === \"-\");\n    }\n    toString() { return this._value; }\n    toHexString(width) {\n        if (width == null) {\n            return this._hex;\n        }\n        if (width % 8) {\n            logger.throwArgumentError(\"invalid byte width\", \"width\", width);\n        }\n        const hex = BigNumber.from(this._hex).fromTwos(this.format.width).toTwos(width).toHexString();\n        return hexZeroPad(hex, width / 8);\n    }\n    toUnsafeFloat() { return parseFloat(this.toString()); }\n    toFormat(format) {\n        return FixedNumber.fromString(this._value, format);\n    }\n    static fromValue(value, decimals, format) {\n        // If decimals looks more like a format, and there is no format, shift the parameters\n        if (format == null && decimals != null && !isBigNumberish(decimals)) {\n            format = decimals;\n            decimals = null;\n        }\n        if (decimals == null) {\n            decimals = 0;\n        }\n        if (format == null) {\n            format = \"fixed\";\n        }\n        return FixedNumber.fromString(formatFixed(value, decimals), FixedFormat.from(format));\n    }\n    static fromString(value, format) {\n        if (format == null) {\n            format = \"fixed\";\n        }\n        const fixedFormat = FixedFormat.from(format);\n        const numeric = parseFixed(value, fixedFormat.decimals);\n        if (!fixedFormat.signed && numeric.lt(Zero)) {\n            throwFault(\"unsigned value cannot be negative\", \"overflow\", \"value\", value);\n        }\n        let hex = null;\n        if (fixedFormat.signed) {\n            hex = numeric.toTwos(fixedFormat.width).toHexString();\n        }\n        else {\n            hex = numeric.toHexString();\n            hex = hexZeroPad(hex, fixedFormat.width / 8);\n        }\n        const decimal = formatFixed(numeric, fixedFormat.decimals);\n        return new FixedNumber(_constructorGuard, hex, decimal, fixedFormat);\n    }\n    static fromBytes(value, format) {\n        if (format == null) {\n            format = \"fixed\";\n        }\n        const fixedFormat = FixedFormat.from(format);\n        if (arrayify(value).length > fixedFormat.width / 8) {\n            throw new Error(\"overflow\");\n        }\n        let numeric = BigNumber.from(value);\n        if (fixedFormat.signed) {\n            numeric = numeric.fromTwos(fixedFormat.width);\n        }\n        const hex = numeric.toTwos((fixedFormat.signed ? 0 : 1) + fixedFormat.width).toHexString();\n        const decimal = formatFixed(numeric, fixedFormat.decimals);\n        return new FixedNumber(_constructorGuard, hex, decimal, fixedFormat);\n    }\n    static from(value, format) {\n        if (typeof (value) === \"string\") {\n            return FixedNumber.fromString(value, format);\n        }\n        if (isBytes(value)) {\n            return FixedNumber.fromBytes(value, format);\n        }\n        try {\n            return FixedNumber.fromValue(value, 0, format);\n        }\n        catch (error) {\n            // Allow NUMERIC_FAULT to bubble up\n            if (error.code !== Logger.errors.INVALID_ARGUMENT) {\n                throw error;\n            }\n        }\n        return logger.throwArgumentError(\"invalid FixedNumber value\", \"value\", value);\n    }\n    static isFixedNumber(value) {\n        return !!(value && value._isFixedNumber);\n    }\n}\nconst ONE = FixedNumber.from(1);\nconst BUMP = FixedNumber.from(\"0.5\");\n//# sourceMappingURL=fixednumber.js.map","export const HashZero = \"0x0000000000000000000000000000000000000000000000000000000000000000\";\n//# sourceMappingURL=hashes.js.map","export const version = \"bytes/5.7.0\";\n//# sourceMappingURL=_version.js.map","\"use strict\";\nimport { Logger } from \"@ethersproject/logger\";\nimport { version } from \"./_version\";\nconst logger = new Logger(version);\n///////////////////////////////\nfunction isHexable(value) {\n    return !!(value.toHexString);\n}\nfunction addSlice(array) {\n    if (array.slice) {\n        return array;\n    }\n    array.slice = function () {\n        const args = Array.prototype.slice.call(arguments);\n        return addSlice(new Uint8Array(Array.prototype.slice.apply(array, args)));\n    };\n    return array;\n}\nexport function isBytesLike(value) {\n    return ((isHexString(value) && !(value.length % 2)) || isBytes(value));\n}\nfunction isInteger(value) {\n    return (typeof (value) === \"number\" && value == value && (value % 1) === 0);\n}\nexport function isBytes(value) {\n    if (value == null) {\n        return false;\n    }\n    if (value.constructor === Uint8Array) {\n        return true;\n    }\n    if (typeof (value) === \"string\") {\n        return false;\n    }\n    if (!isInteger(value.length) || value.length < 0) {\n        return false;\n    }\n    for (let i = 0; i < value.length; i++) {\n        const v = value[i];\n        if (!isInteger(v) || v < 0 || v >= 256) {\n            return false;\n        }\n    }\n    return true;\n}\nexport function arrayify(value, options) {\n    if (!options) {\n        options = {};\n    }\n    if (typeof (value) === \"number\") {\n        logger.checkSafeUint53(value, \"invalid arrayify value\");\n        const result = [];\n        while (value) {\n            result.unshift(value & 0xff);\n            value = parseInt(String(value / 256));\n        }\n        if (result.length === 0) {\n            result.push(0);\n        }\n        return addSlice(new Uint8Array(result));\n    }\n    if (options.allowMissingPrefix && typeof (value) === \"string\" && value.substring(0, 2) !== \"0x\") {\n        value = \"0x\" + value;\n    }\n    if (isHexable(value)) {\n        value = value.toHexString();\n    }\n    if (isHexString(value)) {\n        let hex = value.substring(2);\n        if (hex.length % 2) {\n            if (options.hexPad === \"left\") {\n                hex = \"0\" + hex;\n            }\n            else if (options.hexPad === \"right\") {\n                hex += \"0\";\n            }\n            else {\n                logger.throwArgumentError(\"hex data is odd-length\", \"value\", value);\n            }\n        }\n        const result = [];\n        for (let i = 0; i < hex.length; i += 2) {\n            result.push(parseInt(hex.substring(i, i + 2), 16));\n        }\n        return addSlice(new Uint8Array(result));\n    }\n    if (isBytes(value)) {\n        return addSlice(new Uint8Array(value));\n    }\n    return logger.throwArgumentError(\"invalid arrayify value\", \"value\", value);\n}\nexport function concat(items) {\n    const objects = items.map(item => arrayify(item));\n    const length = objects.reduce((accum, item) => (accum + item.length), 0);\n    const result = new Uint8Array(length);\n    objects.reduce((offset, object) => {\n        result.set(object, offset);\n        return offset + object.length;\n    }, 0);\n    return addSlice(result);\n}\nexport function stripZeros(value) {\n    let result = arrayify(value);\n    if (result.length === 0) {\n        return result;\n    }\n    // Find the first non-zero entry\n    let start = 0;\n    while (start < result.length && result[start] === 0) {\n        start++;\n    }\n    // If we started with zeros, strip them\n    if (start) {\n        result = result.slice(start);\n    }\n    return result;\n}\nexport function zeroPad(value, length) {\n    value = arrayify(value);\n    if (value.length > length) {\n        logger.throwArgumentError(\"value out of range\", \"value\", arguments[0]);\n    }\n    const result = new Uint8Array(length);\n    result.set(value, length - value.length);\n    return addSlice(result);\n}\nexport function isHexString(value, length) {\n    if (typeof (value) !== \"string\" || !value.match(/^0x[0-9A-Fa-f]*$/)) {\n        return false;\n    }\n    if (length && value.length !== 2 + 2 * length) {\n        return false;\n    }\n    return true;\n}\nconst HexCharacters = \"0123456789abcdef\";\nexport function hexlify(value, options) {\n    if (!options) {\n        options = {};\n    }\n    if (typeof (value) === \"number\") {\n        logger.checkSafeUint53(value, \"invalid hexlify value\");\n        let hex = \"\";\n        while (value) {\n            hex = HexCharacters[value & 0xf] + hex;\n            value = Math.floor(value / 16);\n        }\n        if (hex.length) {\n            if (hex.length % 2) {\n                hex = \"0\" + hex;\n            }\n            return \"0x\" + hex;\n        }\n        return \"0x00\";\n    }\n    if (typeof (value) === \"bigint\") {\n        value = value.toString(16);\n        if (value.length % 2) {\n            return (\"0x0\" + value);\n        }\n        return \"0x\" + value;\n    }\n    if (options.allowMissingPrefix && typeof (value) === \"string\" && value.substring(0, 2) !== \"0x\") {\n        value = \"0x\" + value;\n    }\n    if (isHexable(value)) {\n        return value.toHexString();\n    }\n    if (isHexString(value)) {\n        if (value.length % 2) {\n            if (options.hexPad === \"left\") {\n                value = \"0x0\" + value.substring(2);\n            }\n            else if (options.hexPad === \"right\") {\n                value += \"0\";\n            }\n            else {\n                logger.throwArgumentError(\"hex data is odd-length\", \"value\", value);\n            }\n        }\n        return value.toLowerCase();\n    }\n    if (isBytes(value)) {\n        let result = \"0x\";\n        for (let i = 0; i < value.length; i++) {\n            let v = value[i];\n            result += HexCharacters[(v & 0xf0) >> 4] + HexCharacters[v & 0x0f];\n        }\n        return result;\n    }\n    return logger.throwArgumentError(\"invalid hexlify value\", \"value\", value);\n}\n/*\nfunction unoddify(value: BytesLike | Hexable | number): BytesLike | Hexable | number {\n    if (typeof(value) === \"string\" && value.length % 2 && value.substring(0, 2) === \"0x\") {\n        return \"0x0\" + value.substring(2);\n    }\n    return value;\n}\n*/\nexport function hexDataLength(data) {\n    if (typeof (data) !== \"string\") {\n        data = hexlify(data);\n    }\n    else if (!isHexString(data) || (data.length % 2)) {\n        return null;\n    }\n    return (data.length - 2) / 2;\n}\nexport function hexDataSlice(data, offset, endOffset) {\n    if (typeof (data) !== \"string\") {\n        data = hexlify(data);\n    }\n    else if (!isHexString(data) || (data.length % 2)) {\n        logger.throwArgumentError(\"invalid hexData\", \"value\", data);\n    }\n    offset = 2 + 2 * offset;\n    if (endOffset != null) {\n        return \"0x\" + data.substring(offset, 2 + 2 * endOffset);\n    }\n    return \"0x\" + data.substring(offset);\n}\nexport function hexConcat(items) {\n    let result = \"0x\";\n    items.forEach((item) => {\n        result += hexlify(item).substring(2);\n    });\n    return result;\n}\nexport function hexValue(value) {\n    const trimmed = hexStripZeros(hexlify(value, { hexPad: \"left\" }));\n    if (trimmed === \"0x\") {\n        return \"0x0\";\n    }\n    return trimmed;\n}\nexport function hexStripZeros(value) {\n    if (typeof (value) !== \"string\") {\n        value = hexlify(value);\n    }\n    if (!isHexString(value)) {\n        logger.throwArgumentError(\"invalid hex string\", \"value\", value);\n    }\n    value = value.substring(2);\n    let offset = 0;\n    while (offset < value.length && value[offset] === \"0\") {\n        offset++;\n    }\n    return \"0x\" + value.substring(offset);\n}\nexport function hexZeroPad(value, length) {\n    if (typeof (value) !== \"string\") {\n        value = hexlify(value);\n    }\n    else if (!isHexString(value)) {\n        logger.throwArgumentError(\"invalid hex string\", \"value\", value);\n    }\n    if (value.length > 2 * length + 2) {\n        logger.throwArgumentError(\"value out of range\", \"value\", arguments[1]);\n    }\n    while (value.length < 2 * length + 2) {\n        value = \"0x0\" + value.substring(2);\n    }\n    return value;\n}\nexport function splitSignature(signature) {\n    const result = {\n        r: \"0x\",\n        s: \"0x\",\n        _vs: \"0x\",\n        recoveryParam: 0,\n        v: 0,\n        yParityAndS: \"0x\",\n        compact: \"0x\"\n    };\n    if (isBytesLike(signature)) {\n        let bytes = arrayify(signature);\n        // Get the r, s and v\n        if (bytes.length === 64) {\n            // EIP-2098; pull the v from the top bit of s and clear it\n            result.v = 27 + (bytes[32] >> 7);\n            bytes[32] &= 0x7f;\n            result.r = hexlify(bytes.slice(0, 32));\n            result.s = hexlify(bytes.slice(32, 64));\n        }\n        else if (bytes.length === 65) {\n            result.r = hexlify(bytes.slice(0, 32));\n            result.s = hexlify(bytes.slice(32, 64));\n            result.v = bytes[64];\n        }\n        else {\n            logger.throwArgumentError(\"invalid signature string\", \"signature\", signature);\n        }\n        // Allow a recid to be used as the v\n        if (result.v < 27) {\n            if (result.v === 0 || result.v === 1) {\n                result.v += 27;\n            }\n            else {\n                logger.throwArgumentError(\"signature invalid v byte\", \"signature\", signature);\n            }\n        }\n        // Compute recoveryParam from v\n        result.recoveryParam = 1 - (result.v % 2);\n        // Compute _vs from recoveryParam and s\n        if (result.recoveryParam) {\n            bytes[32] |= 0x80;\n        }\n        result._vs = hexlify(bytes.slice(32, 64));\n    }\n    else {\n        result.r = signature.r;\n        result.s = signature.s;\n        result.v = signature.v;\n        result.recoveryParam = signature.recoveryParam;\n        result._vs = signature._vs;\n        // If the _vs is available, use it to populate missing s, v and recoveryParam\n        // and verify non-missing s, v and recoveryParam\n        if (result._vs != null) {\n            const vs = zeroPad(arrayify(result._vs), 32);\n            result._vs = hexlify(vs);\n            // Set or check the recid\n            const recoveryParam = ((vs[0] >= 128) ? 1 : 0);\n            if (result.recoveryParam == null) {\n                result.recoveryParam = recoveryParam;\n            }\n            else if (result.recoveryParam !== recoveryParam) {\n                logger.throwArgumentError(\"signature recoveryParam mismatch _vs\", \"signature\", signature);\n            }\n            // Set or check the s\n            vs[0] &= 0x7f;\n            const s = hexlify(vs);\n            if (result.s == null) {\n                result.s = s;\n            }\n            else if (result.s !== s) {\n                logger.throwArgumentError(\"signature v mismatch _vs\", \"signature\", signature);\n            }\n        }\n        // Use recid and v to populate each other\n        if (result.recoveryParam == null) {\n            if (result.v == null) {\n                logger.throwArgumentError(\"signature missing v and recoveryParam\", \"signature\", signature);\n            }\n            else if (result.v === 0 || result.v === 1) {\n                result.recoveryParam = result.v;\n            }\n            else {\n                result.recoveryParam = 1 - (result.v % 2);\n            }\n        }\n        else {\n            if (result.v == null) {\n                result.v = 27 + result.recoveryParam;\n            }\n            else {\n                const recId = (result.v === 0 || result.v === 1) ? result.v : (1 - (result.v % 2));\n                if (result.recoveryParam !== recId) {\n                    logger.throwArgumentError(\"signature recoveryParam mismatch v\", \"signature\", signature);\n                }\n            }\n        }\n        if (result.r == null || !isHexString(result.r)) {\n            logger.throwArgumentError(\"signature missing or invalid r\", \"signature\", signature);\n        }\n        else {\n            result.r = hexZeroPad(result.r, 32);\n        }\n        if (result.s == null || !isHexString(result.s)) {\n            logger.throwArgumentError(\"signature missing or invalid s\", \"signature\", signature);\n        }\n        else {\n            result.s = hexZeroPad(result.s, 32);\n        }\n        const vs = arrayify(result.s);\n        if (vs[0] >= 128) {\n            logger.throwArgumentError(\"signature s out of range\", \"signature\", signature);\n        }\n        if (result.recoveryParam) {\n            vs[0] |= 0x80;\n        }\n        const _vs = hexlify(vs);\n        if (result._vs) {\n            if (!isHexString(result._vs)) {\n                logger.throwArgumentError(\"signature invalid _vs\", \"signature\", signature);\n            }\n            result._vs = hexZeroPad(result._vs, 32);\n        }\n        // Set or check the _vs\n        if (result._vs == null) {\n            result._vs = _vs;\n        }\n        else if (result._vs !== _vs) {\n            logger.throwArgumentError(\"signature _vs mismatch v and s\", \"signature\", signature);\n        }\n    }\n    result.yParityAndS = result._vs;\n    result.compact = result.r + result.yParityAndS.substring(2);\n    return result;\n}\nexport function joinSignature(signature) {\n    signature = splitSignature(signature);\n    return hexlify(concat([\n        signature.r,\n        signature.s,\n        (signature.recoveryParam ? \"0x1c\" : \"0x1b\")\n    ]));\n}\n//# sourceMappingURL=index.js.map","import { BigNumber } from \"@ethersproject/bignumber\";\nconst NegativeOne = ( /*#__PURE__*/BigNumber.from(-1));\nconst Zero = ( /*#__PURE__*/BigNumber.from(0));\nconst One = ( /*#__PURE__*/BigNumber.from(1));\nconst Two = ( /*#__PURE__*/BigNumber.from(2));\nconst WeiPerEther = ( /*#__PURE__*/BigNumber.from(\"1000000000000000000\"));\nconst MaxUint256 = ( /*#__PURE__*/BigNumber.from(\"0xffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff\"));\nconst MinInt256 = ( /*#__PURE__*/BigNumber.from(\"-0x8000000000000000000000000000000000000000000000000000000000000000\"));\nconst MaxInt256 = ( /*#__PURE__*/BigNumber.from(\"0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff\"));\nexport { NegativeOne, Zero, One, Two, WeiPerEther, MaxUint256, MinInt256, MaxInt256, };\n//# sourceMappingURL=bignumbers.js.map","export const version = \"bignumber/5.7.0\";\n//# sourceMappingURL=_version.js.map","// NFKC (composed)             // (decomposed)\nexport const EtherSymbol = \"\\u039e\"; // \"\\uD835\\uDF63\";\n//# sourceMappingURL=strings.js.map","(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    if (typeof window !== 'undefined' && typeof window.Buffer !== 'undefined') {\n      Buffer = window.Buffer;\n    } else {\n      Buffer = require('buffer').Buffer;\n    }\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      this.negative = 1;\n    }\n\n    if (start < number.length) {\n      if (base === 16) {\n        this._parseHex(number, start, endian);\n      } else {\n        this._parseBase(number, base, start);\n        if (endian === 'le') {\n          this._initArray(this.toArray(), base, endian);\n        }\n      }\n    }\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 parseHex4Bits (string, index) {\n    var c = string.charCodeAt(index);\n    // '0' - '9'\n    if (c >= 48 && c <= 57) {\n      return c - 48;\n    // 'A' - 'F'\n    } else if (c >= 65 && c <= 70) {\n      return c - 55;\n    // 'a' - 'f'\n    } else if (c >= 97 && c <= 102) {\n      return c - 87;\n    } else {\n      assert(false, 'Invalid character in ' + string);\n    }\n  }\n\n  function parseHexByte (string, lowerBound, index) {\n    var r = parseHex4Bits(string, index);\n    if (index - 1 >= lowerBound) {\n      r |= parseHex4Bits(string, index - 1) << 4;\n    }\n    return r;\n  }\n\n  BN.prototype._parseHex = function _parseHex (number, start, endian) {\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    // 24-bits chunks\n    var off = 0;\n    var j = 0;\n\n    var w;\n    if (endian === 'be') {\n      for (i = number.length - 1; i >= start; i -= 2) {\n        w = parseHexByte(number, start, i) << off;\n        this.words[j] |= w & 0x3ffffff;\n        if (off >= 18) {\n          off -= 18;\n          j += 1;\n          this.words[j] |= w >>> 26;\n        } else {\n          off += 8;\n        }\n      }\n    } else {\n      var parseLength = number.length - start;\n      for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2) {\n        w = parseHexByte(number, start, i) << off;\n        this.words[j] |= w & 0x3ffffff;\n        if (off >= 18) {\n          off -= 18;\n          j += 1;\n          this.words[j] |= w >>> 26;\n        } else {\n          off += 8;\n        }\n      }\n    }\n\n    this._strip();\n  };\n\n  function parseBase (str, start, end, mul) {\n    var r = 0;\n    var b = 0;\n    var len = Math.min(str.length, end);\n    for (var i = start; i < len; i++) {\n      var c = str.charCodeAt(i) - 48;\n\n      r *= mul;\n\n      // 'a'\n      if (c >= 49) {\n        b = c - 49 + 0xa;\n\n      // 'A'\n      } else if (c >= 17) {\n        b = c - 17 + 0xa;\n\n      // '0' - '9'\n      } else {\n        b = c;\n      }\n      assert(c >= 0 && b < mul, 'Invalid character');\n      r += b;\n    }\n    return r;\n  }\n\n  BN.prototype._parseBase = function _parseBase (number, base, start) {\n    // Initialize as zero\n    this.words = [0];\n    this.length = 1;\n\n    // Find length of limb in base\n    for (var limbLen = 0, limbPow = 1; limbPow <= 0x3ffffff; limbPow *= base) {\n      limbLen++;\n    }\n    limbLen--;\n    limbPow = (limbPow / base) | 0;\n\n    var total = number.length - start;\n    var mod = total % limbLen;\n    var end = Math.min(total, total - mod) + start;\n\n    var word = 0;\n    for (var i = start; i < end; i += limbLen) {\n      word = parseBase(number, i, i + limbLen, base);\n\n      this.imuln(limbPow);\n      if (this.words[0] + word < 0x4000000) {\n        this.words[0] += word;\n      } else {\n        this._iaddn(word);\n      }\n    }\n\n    if (mod !== 0) {\n      var pow = 1;\n      word = parseBase(number, i, number.length, base);\n\n      for (i = 0; i < mod; i++) {\n        pow *= base;\n      }\n\n      this.imuln(pow);\n      if (this.words[0] + word < 0x4000000) {\n        this.words[0] += word;\n      } else {\n        this._iaddn(word);\n      }\n    }\n\n    this._strip();\n  };\n\n  BN.prototype.copy = function copy (dest) {\n    dest.words = new Array(this.length);\n    for (var i = 0; i < this.length; i++) {\n      dest.words[i] = this.words[i];\n    }\n    dest.length = this.length;\n    dest.negative = this.negative;\n    dest.red = this.red;\n  };\n\n  function move (dest, src) {\n    dest.words = src.words;\n    dest.length = src.length;\n    dest.negative = src.negative;\n    dest.red = src.red;\n  }\n\n  BN.prototype._move = function _move (dest) {\n    move(dest, this);\n  };\n\n  BN.prototype.clone = function clone () {\n    var r = new BN(null);\n    this.copy(r);\n    return r;\n  };\n\n  BN.prototype._expand = function _expand (size) {\n    while (this.length < size) {\n      this.words[this.length++] = 0;\n    }\n    return this;\n  };\n\n  // Remove leading `0` from `this`\n  BN.prototype._strip = function strip () {\n    while (this.length > 1 && this.words[this.length - 1] === 0) {\n      this.length--;\n    }\n    return this._normSign();\n  };\n\n  BN.prototype._normSign = function _normSign () {\n    // -0 = 0\n    if (this.length === 1 && this.words[0] === 0) {\n      this.negative = 0;\n    }\n    return this;\n  };\n\n  // Check Symbol.for because not everywhere where Symbol defined\n  // See https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Symbol#Browser_compatibility\n  if (typeof Symbol !== 'undefined' && typeof Symbol.for === 'function') {\n    try {\n      BN.prototype[Symbol.for('nodejs.util.inspect.custom')] = inspect;\n    } catch (e) {\n      BN.prototype.inspect = inspect;\n    }\n  } else {\n    BN.prototype.inspect = inspect;\n  }\n\n  function inspect () {\n    return (this.red ? '<BN-R: ' : '<BN: ') + this.toString(16) + '>';\n  }\n\n  /*\n\n  var zeros = [];\n  var groupSizes = [];\n  var groupBases = [];\n\n  var s = '';\n  var i = -1;\n  while (++i < BN.wordSize) {\n    zeros[i] = s;\n    s += '0';\n  }\n  groupSizes[0] = 0;\n  groupSizes[1] = 0;\n  groupBases[0] = 0;\n  groupBases[1] = 0;\n  var base = 2 - 1;\n  while (++base < 36 + 1) {\n    var groupSize = 0;\n    var groupBase = 1;\n    while (groupBase < (1 << BN.wordSize) / base) {\n      groupBase *= base;\n      groupSize += 1;\n    }\n    groupSizes[base] = groupSize;\n    groupBases[base] = groupBase;\n  }\n\n  */\n\n  var zeros = [\n    '',\n    '0',\n    '00',\n    '000',\n    '0000',\n    '00000',\n    '000000',\n    '0000000',\n    '00000000',\n    '000000000',\n    '0000000000',\n    '00000000000',\n    '000000000000',\n    '0000000000000',\n    '00000000000000',\n    '000000000000000',\n    '0000000000000000',\n    '00000000000000000',\n    '000000000000000000',\n    '0000000000000000000',\n    '00000000000000000000',\n    '000000000000000000000',\n    '0000000000000000000000',\n    '00000000000000000000000',\n    '000000000000000000000000',\n    '0000000000000000000000000'\n  ];\n\n  var groupSizes = [\n    0, 0,\n    25, 16, 12, 11, 10, 9, 8,\n    8, 7, 7, 7, 7, 6, 6,\n    6, 6, 6, 6, 6, 5, 5,\n    5, 5, 5, 5, 5, 5, 5,\n    5, 5, 5, 5, 5, 5, 5\n  ];\n\n  var groupBases = [\n    0, 0,\n    33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216,\n    43046721, 10000000, 19487171, 35831808, 62748517, 7529536, 11390625,\n    16777216, 24137569, 34012224, 47045881, 64000000, 4084101, 5153632,\n    6436343, 7962624, 9765625, 11881376, 14348907, 17210368, 20511149,\n    24300000, 28629151, 33554432, 39135393, 45435424, 52521875, 60466176\n  ];\n\n  BN.prototype.toString = function toString (base, padding) {\n    base = base || 10;\n    padding = padding | 0 || 1;\n\n    var out;\n    if (base === 16 || base === 'hex') {\n      out = '';\n      var off = 0;\n      var carry = 0;\n      for (var i = 0; i < this.length; i++) {\n        var w = this.words[i];\n        var word = (((w << off) | carry) & 0xffffff).toString(16);\n        carry = (w >>> (24 - off)) & 0xffffff;\n        off += 2;\n        if (off >= 26) {\n          off -= 26;\n          i--;\n        }\n        if (carry !== 0 || i !== this.length - 1) {\n          out = zeros[6 - word.length] + word + out;\n        } else {\n          out = word + out;\n        }\n      }\n      if (carry !== 0) {\n        out = carry.toString(16) + out;\n      }\n      while (out.length % padding !== 0) {\n        out = '0' + out;\n      }\n      if (this.negative !== 0) {\n        out = '-' + out;\n      }\n      return out;\n    }\n\n    if (base === (base | 0) && base >= 2 && base <= 36) {\n      // var groupSize = Math.floor(BN.wordSize * Math.LN2 / Math.log(base));\n      var groupSize = groupSizes[base];\n      // var groupBase = Math.pow(base, groupSize);\n      var groupBase = groupBases[base];\n      out = '';\n      var c = this.clone();\n      c.negative = 0;\n      while (!c.isZero()) {\n        var r = c.modrn(groupBase).toString(base);\n        c = c.idivn(groupBase);\n\n        if (!c.isZero()) {\n          out = zeros[groupSize - r.length] + r + out;\n        } else {\n          out = r + out;\n        }\n      }\n      if (this.isZero()) {\n        out = '0' + out;\n      }\n      while (out.length % padding !== 0) {\n        out = '0' + out;\n      }\n      if (this.negative !== 0) {\n        out = '-' + out;\n      }\n      return out;\n    }\n\n    assert(false, 'Base should be between 2 and 36');\n  };\n\n  BN.prototype.toNumber = function toNumber () {\n    var ret = this.words[0];\n    if (this.length === 2) {\n      ret += this.words[1] * 0x4000000;\n    } else if (this.length === 3 && this.words[2] === 0x01) {\n      // NOTE: at this stage it is known that the top bit is set\n      ret += 0x10000000000000 + (this.words[1] * 0x4000000);\n    } else if (this.length > 2) {\n      assert(false, 'Number can only safely store up to 53 bits');\n    }\n    return (this.negative !== 0) ? -ret : ret;\n  };\n\n  BN.prototype.toJSON = function toJSON () {\n    return this.toString(16, 2);\n  };\n\n  if (Buffer) {\n    BN.prototype.toBuffer = function toBuffer (endian, length) {\n      return this.toArrayLike(Buffer, endian, length);\n    };\n  }\n\n  BN.prototype.toArray = function toArray (endian, length) {\n    return this.toArrayLike(Array, endian, length);\n  };\n\n  var allocate = function allocate (ArrayType, size) {\n    if (ArrayType.allocUnsafe) {\n      return ArrayType.allocUnsafe(size);\n    }\n    return new ArrayType(size);\n  };\n\n  BN.prototype.toArrayLike = function toArrayLike (ArrayType, endian, length) {\n    this._strip();\n\n    var byteLength = this.byteLength();\n    var reqLength = length || Math.max(1, byteLength);\n    assert(byteLength <= reqLength, 'byte array longer than desired length');\n    assert(reqLength > 0, 'Requested array length <= 0');\n\n    var res = allocate(ArrayType, reqLength);\n    var postfix = endian === 'le' ? 'LE' : 'BE';\n    this['_toArrayLike' + postfix](res, byteLength);\n    return res;\n  };\n\n  BN.prototype._toArrayLikeLE = function _toArrayLikeLE (res, byteLength) {\n    var position = 0;\n    var carry = 0;\n\n    for (var i = 0, shift = 0; i < this.length; i++) {\n      var word = (this.words[i] << shift) | carry;\n\n      res[position++] = word & 0xff;\n      if (position < res.length) {\n        res[position++] = (word >> 8) & 0xff;\n      }\n      if (position < res.length) {\n        res[position++] = (word >> 16) & 0xff;\n      }\n\n      if (shift === 6) {\n        if (position < res.length) {\n          res[position++] = (word >> 24) & 0xff;\n        }\n        carry = 0;\n        shift = 0;\n      } else {\n        carry = word >>> 24;\n        shift += 2;\n      }\n    }\n\n    if (position < res.length) {\n      res[position++] = carry;\n\n      while (position < res.length) {\n        res[position++] = 0;\n      }\n    }\n  };\n\n  BN.prototype._toArrayLikeBE = function _toArrayLikeBE (res, byteLength) {\n    var position = res.length - 1;\n    var carry = 0;\n\n    for (var i = 0, shift = 0; i < this.length; i++) {\n      var word = (this.words[i] << shift) | carry;\n\n      res[position--] = word & 0xff;\n      if (position >= 0) {\n        res[position--] = (word >> 8) & 0xff;\n      }\n      if (position >= 0) {\n        res[position--] = (word >> 16) & 0xff;\n      }\n\n      if (shift === 6) {\n        if (position >= 0) {\n          res[position--] = (word >> 24) & 0xff;\n        }\n        carry = 0;\n        shift = 0;\n      } else {\n        carry = word >>> 24;\n        shift += 2;\n      }\n    }\n\n    if (position >= 0) {\n      res[position--] = carry;\n\n      while (position >= 0) {\n        res[position--] = 0;\n      }\n    }\n  };\n\n  if (Math.clz32) {\n    BN.prototype._countBits = function _countBits (w) {\n      return 32 - Math.clz32(w);\n    };\n  } else {\n    BN.prototype._countBits = function _countBits (w) {\n      var t = w;\n      var r = 0;\n      if (t >= 0x1000) {\n        r += 13;\n        t >>>= 13;\n      }\n      if (t >= 0x40) {\n        r += 7;\n        t >>>= 7;\n      }\n      if (t >= 0x8) {\n        r += 4;\n        t >>>= 4;\n      }\n      if (t >= 0x02) {\n        r += 2;\n        t >>>= 2;\n      }\n      return r + t;\n    };\n  }\n\n  BN.prototype._zeroBits = function _zeroBits (w) {\n    // Short-cut\n    if (w === 0) return 26;\n\n    var t = w;\n    var r = 0;\n    if ((t & 0x1fff) === 0) {\n      r += 13;\n      t >>>= 13;\n    }\n    if ((t & 0x7f) === 0) {\n      r += 7;\n      t >>>= 7;\n    }\n    if ((t & 0xf) === 0) {\n      r += 4;\n      t >>>= 4;\n    }\n    if ((t & 0x3) === 0) {\n      r += 2;\n      t >>>= 2;\n    }\n    if ((t & 0x1) === 0) {\n      r++;\n    }\n    return r;\n  };\n\n  // Return number of used bits in a BN\n  BN.prototype.bitLength = function bitLength () {\n    var w = this.words[this.length - 1];\n    var hi = this._countBits(w);\n    return (this.length - 1) * 26 + hi;\n  };\n\n  function toBitArray (num) {\n    var w = new Array(num.bitLength());\n\n    for (var bit = 0; bit < w.length; bit++) {\n      var off = (bit / 26) | 0;\n      var wbit = bit % 26;\n\n      w[bit] = (num.words[off] >>> wbit) & 0x01;\n    }\n\n    return w;\n  }\n\n  // Number of trailing zero bits\n  BN.prototype.zeroBits = function zeroBits () {\n    if (this.isZero()) return 0;\n\n    var r = 0;\n    for (var i = 0; i < this.length; i++) {\n      var b = this._zeroBits(this.words[i]);\n      r += b;\n      if (b !== 26) break;\n    }\n    return r;\n  };\n\n  BN.prototype.byteLength = function byteLength () {\n    return Math.ceil(this.bitLength() / 8);\n  };\n\n  BN.prototype.toTwos = function toTwos (width) {\n    if (this.negative !== 0) {\n      return this.abs().inotn(width).iaddn(1);\n    }\n    return this.clone();\n  };\n\n  BN.prototype.fromTwos = function fromTwos (width) {\n    if (this.testn(width - 1)) {\n      return this.notn(width).iaddn(1).ineg();\n    }\n    return this.clone();\n  };\n\n  BN.prototype.isNeg = function isNeg () {\n    return this.negative !== 0;\n  };\n\n  // Return negative clone of `this`\n  BN.prototype.neg = function neg () {\n    return this.clone().ineg();\n  };\n\n  BN.prototype.ineg = function ineg () {\n    if (!this.isZero()) {\n      this.negative ^= 1;\n    }\n\n    return this;\n  };\n\n  // Or `num` with `this` in-place\n  BN.prototype.iuor = function iuor (num) {\n    while (this.length < num.length) {\n      this.words[this.length++] = 0;\n    }\n\n    for (var i = 0; i < num.length; i++) {\n      this.words[i] = this.words[i] | num.words[i];\n    }\n\n    return this._strip();\n  };\n\n  BN.prototype.ior = function ior (num) {\n    assert((this.negative | num.negative) === 0);\n    return this.iuor(num);\n  };\n\n  // Or `num` with `this`\n  BN.prototype.or = function or (num) {\n    if (this.length > num.length) return this.clone().ior(num);\n    return num.clone().ior(this);\n  };\n\n  BN.prototype.uor = function uor (num) {\n    if (this.length > num.length) return this.clone().iuor(num);\n    return num.clone().iuor(this);\n  };\n\n  // And `num` with `this` in-place\n  BN.prototype.iuand = function iuand (num) {\n    // b = min-length(num, this)\n    var b;\n    if (this.length > num.length) {\n      b = num;\n    } else {\n      b = this;\n    }\n\n    for (var i = 0; i < b.length; i++) {\n      this.words[i] = this.words[i] & num.words[i];\n    }\n\n    this.length = b.length;\n\n    return this._strip();\n  };\n\n  BN.prototype.iand = function iand (num) {\n    assert((this.negative | num.negative) === 0);\n    return this.iuand(num);\n  };\n\n  // And `num` with `this`\n  BN.prototype.and = function and (num) {\n    if (this.length > num.length) return this.clone().iand(num);\n    return num.clone().iand(this);\n  };\n\n  BN.prototype.uand = function uand (num) {\n    if (this.length > num.length) return this.clone().iuand(num);\n    return num.clone().iuand(this);\n  };\n\n  // Xor `num` with `this` in-place\n  BN.prototype.iuxor = function iuxor (num) {\n    // a.length > b.length\n    var a;\n    var b;\n    if (this.length > num.length) {\n      a = this;\n      b = num;\n    } else {\n      a = num;\n      b = this;\n    }\n\n    for (var i = 0; i < b.length; i++) {\n      this.words[i] = a.words[i] ^ b.words[i];\n    }\n\n    if (this !== a) {\n      for (; i < a.length; i++) {\n        this.words[i] = a.words[i];\n      }\n    }\n\n    this.length = a.length;\n\n    return this._strip();\n  };\n\n  BN.prototype.ixor = function ixor (num) {\n    assert((this.negative | num.negative) === 0);\n    return this.iuxor(num);\n  };\n\n  // Xor `num` with `this`\n  BN.prototype.xor = function xor (num) {\n    if (this.length > num.length) return this.clone().ixor(num);\n    return num.clone().ixor(this);\n  };\n\n  BN.prototype.uxor = function uxor (num) {\n    if (this.length > num.length) return this.clone().iuxor(num);\n    return num.clone().iuxor(this);\n  };\n\n  // Not ``this`` with ``width`` bitwidth\n  BN.prototype.inotn = function inotn (width) {\n    assert(typeof width === 'number' && width >= 0);\n\n    var bytesNeeded = Math.ceil(width / 26) | 0;\n    var bitsLeft = width % 26;\n\n    // Extend the buffer with leading zeroes\n    this._expand(bytesNeeded);\n\n    if (bitsLeft > 0) {\n      bytesNeeded--;\n    }\n\n    // Handle complete words\n    for (var i = 0; i < bytesNeeded; i++) {\n      this.words[i] = ~this.words[i] & 0x3ffffff;\n    }\n\n    // Handle the residue\n    if (bitsLeft > 0) {\n      this.words[i] = ~this.words[i] & (0x3ffffff >> (26 - bitsLeft));\n    }\n\n    // And remove leading zeroes\n    return this._strip();\n  };\n\n  BN.prototype.notn = function notn (width) {\n    return this.clone().inotn(width);\n  };\n\n  // Set `bit` of `this`\n  BN.prototype.setn = function setn (bit, val) {\n    assert(typeof bit === 'number' && bit >= 0);\n\n    var off = (bit / 26) | 0;\n    var wbit = bit % 26;\n\n    this._expand(off + 1);\n\n    if (val) {\n      this.words[off] = this.words[off] | (1 << wbit);\n    } else {\n      this.words[off] = this.words[off] & ~(1 << wbit);\n    }\n\n    return this._strip();\n  };\n\n  // Add `num` to `this` in-place\n  BN.prototype.iadd = function iadd (num) {\n    var r;\n\n    // negative + positive\n    if (this.negative !== 0 && num.negative === 0) {\n      this.negative = 0;\n      r = this.isub(num);\n      this.negative ^= 1;\n      return this._normSign();\n\n    // positive + negative\n    } else if (this.negative === 0 && num.negative !== 0) {\n      num.negative = 0;\n      r = this.isub(num);\n      num.negative = 1;\n      return r._normSign();\n    }\n\n    // a.length > b.length\n    var a, b;\n    if (this.length > num.length) {\n      a = this;\n      b = num;\n    } else {\n      a = num;\n      b = this;\n    }\n\n    var carry = 0;\n    for (var i = 0; i < b.length; i++) {\n      r = (a.words[i] | 0) + (b.words[i] | 0) + carry;\n      this.words[i] = r & 0x3ffffff;\n      carry = r >>> 26;\n    }\n    for (; carry !== 0 && i < a.length; i++) {\n      r = (a.words[i] | 0) + carry;\n      this.words[i] = r & 0x3ffffff;\n      carry = r >>> 26;\n    }\n\n    this.length = a.length;\n    if (carry !== 0) {\n      this.words[this.length] = carry;\n      this.length++;\n    // Copy the rest of the words\n    } else if (a !== this) {\n      for (; i < a.length; i++) {\n        this.words[i] = a.words[i];\n      }\n    }\n\n    return this;\n  };\n\n  // Add `num` to `this`\n  BN.prototype.add = function add (num) {\n    var res;\n    if (num.negative !== 0 && this.negative === 0) {\n      num.negative = 0;\n      res = this.sub(num);\n      num.negative ^= 1;\n      return res;\n    } else if (num.negative === 0 && this.negative !== 0) {\n      this.negative = 0;\n      res = num.sub(this);\n      this.negative = 1;\n      return res;\n    }\n\n    if (this.length > num.length) return this.clone().iadd(num);\n\n    return num.clone().iadd(this);\n  };\n\n  // Subtract `num` from `this` in-place\n  BN.prototype.isub = function isub (num) {\n    // this - (-num) = this + num\n    if (num.negative !== 0) {\n      num.negative = 0;\n      var r = this.iadd(num);\n      num.negative = 1;\n      return r._normSign();\n\n    // -this - num = -(this + num)\n    } else if (this.negative !== 0) {\n      this.negative = 0;\n      this.iadd(num);\n      this.negative = 1;\n      return this._normSign();\n    }\n\n    // At this point both numbers are positive\n    var cmp = this.cmp(num);\n\n    // Optimization - zeroify\n    if (cmp === 0) {\n      this.negative = 0;\n      this.length = 1;\n      this.words[0] = 0;\n      return this;\n    }\n\n    // a > b\n    var a, b;\n    if (cmp > 0) {\n      a = this;\n      b = num;\n    } else {\n      a = num;\n      b = this;\n    }\n\n    var carry = 0;\n    for (var i = 0; i < b.length; i++) {\n      r = (a.words[i] | 0) - (b.words[i] | 0) + carry;\n      carry = r >> 26;\n      this.words[i] = r & 0x3ffffff;\n    }\n    for (; carry !== 0 && i < a.length; i++) {\n      r = (a.words[i] | 0) + carry;\n      carry = r >> 26;\n      this.words[i] = r & 0x3ffffff;\n    }\n\n    // Copy rest of the words\n    if (carry === 0 && i < a.length && a !== this) {\n      for (; i < a.length; i++) {\n        this.words[i] = a.words[i];\n      }\n    }\n\n    this.length = Math.max(this.length, i);\n\n    if (a !== this) {\n      this.negative = 1;\n    }\n\n    return this._strip();\n  };\n\n  // Subtract `num` from `this`\n  BN.prototype.sub = function sub (num) {\n    return this.clone().isub(num);\n  };\n\n  function smallMulTo (self, num, out) {\n    out.negative = num.negative ^ self.negative;\n    var len = (self.length + num.length) | 0;\n    out.length = len;\n    len = (len - 1) | 0;\n\n    // Peel one iteration (compiler can't do it, because of code complexity)\n    var a = self.words[0] | 0;\n    var b = num.words[0] | 0;\n    var r = a * b;\n\n    var lo = r & 0x3ffffff;\n    var carry = (r / 0x4000000) | 0;\n    out.words[0] = lo;\n\n    for (var k = 1; k < len; k++) {\n      // Sum all words with the same `i + j = k` and accumulate `ncarry`,\n      // note that ncarry could be >= 0x3ffffff\n      var ncarry = carry >>> 26;\n      var rword = carry & 0x3ffffff;\n      var maxJ = Math.min(k, num.length - 1);\n      for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) {\n        var i = (k - j) | 0;\n        a = self.words[i] | 0;\n        b = num.words[j] | 0;\n        r = a * b + rword;\n        ncarry += (r / 0x4000000) | 0;\n        rword = r & 0x3ffffff;\n      }\n      out.words[k] = rword | 0;\n      carry = ncarry | 0;\n    }\n    if (carry !== 0) {\n      out.words[k] = carry | 0;\n    } else {\n      out.length--;\n    }\n\n    return out._strip();\n  }\n\n  // TODO(indutny): it may be reasonable to omit it for users who don't need\n  // to work with 256-bit numbers, otherwise it gives 20% improvement for 256-bit\n  // multiplication (like elliptic secp256k1).\n  var comb10MulTo = function comb10MulTo (self, num, out) {\n    var a = self.words;\n    var b = num.words;\n    var o = out.words;\n    var c = 0;\n    var lo;\n    var mid;\n    var hi;\n    var a0 = a[0] | 0;\n    var al0 = a0 & 0x1fff;\n    var ah0 = a0 >>> 13;\n    var a1 = a[1] | 0;\n    var al1 = a1 & 0x1fff;\n    var ah1 = a1 >>> 13;\n    var a2 = a[2] | 0;\n    var al2 = a2 & 0x1fff;\n    var ah2 = a2 >>> 13;\n    var a3 = a[3] | 0;\n    var al3 = a3 & 0x1fff;\n    var ah3 = a3 >>> 13;\n    var a4 = a[4] | 0;\n    var al4 = a4 & 0x1fff;\n    var ah4 = a4 >>> 13;\n    var a5 = a[5] | 0;\n    var al5 = a5 & 0x1fff;\n    var ah5 = a5 >>> 13;\n    var a6 = a[6] | 0;\n    var al6 = a6 & 0x1fff;\n    var ah6 = a6 >>> 13;\n    var a7 = a[7] | 0;\n    var al7 = a7 & 0x1fff;\n    var ah7 = a7 >>> 13;\n    var a8 = a[8] | 0;\n    var al8 = a8 & 0x1fff;\n    var ah8 = a8 >>> 13;\n    var a9 = a[9] | 0;\n    var al9 = a9 & 0x1fff;\n    var ah9 = a9 >>> 13;\n    var b0 = b[0] | 0;\n    var bl0 = b0 & 0x1fff;\n    var bh0 = b0 >>> 13;\n    var b1 = b[1] | 0;\n    var bl1 = b1 & 0x1fff;\n    var bh1 = b1 >>> 13;\n    var b2 = b[2] | 0;\n    var bl2 = b2 & 0x1fff;\n    var bh2 = b2 >>> 13;\n    var b3 = b[3] | 0;\n    var bl3 = b3 & 0x1fff;\n    var bh3 = b3 >>> 13;\n    var b4 = b[4] | 0;\n    var bl4 = b4 & 0x1fff;\n    var bh4 = b4 >>> 13;\n    var b5 = b[5] | 0;\n    var bl5 = b5 & 0x1fff;\n    var bh5 = b5 >>> 13;\n    var b6 = b[6] | 0;\n    var bl6 = b6 & 0x1fff;\n    var bh6 = b6 >>> 13;\n    var b7 = b[7] | 0;\n    var bl7 = b7 & 0x1fff;\n    var bh7 = b7 >>> 13;\n    var b8 = b[8] | 0;\n    var bl8 = b8 & 0x1fff;\n    var bh8 = b8 >>> 13;\n    var b9 = b[9] | 0;\n    var bl9 = b9 & 0x1fff;\n    var bh9 = b9 >>> 13;\n\n    out.negative = self.negative ^ num.negative;\n    out.length = 19;\n    /* k = 0 */\n    lo = Math.imul(al0, bl0);\n    mid = Math.imul(al0, bh0);\n    mid = (mid + Math.imul(ah0, bl0)) | 0;\n    hi = Math.imul(ah0, bh0);\n    var w0 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0;\n    w0 &= 0x3ffffff;\n    /* k = 1 */\n    lo = Math.imul(al1, bl0);\n    mid = Math.imul(al1, bh0);\n    mid = (mid + Math.imul(ah1, bl0)) | 0;\n    hi = Math.imul(ah1, bh0);\n    lo = (lo + Math.imul(al0, bl1)) | 0;\n    mid = (mid + Math.imul(al0, bh1)) | 0;\n    mid = (mid + Math.imul(ah0, bl1)) | 0;\n    hi = (hi + Math.imul(ah0, bh1)) | 0;\n    var w1 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0;\n    w1 &= 0x3ffffff;\n    /* k = 2 */\n    lo = Math.imul(al2, bl0);\n    mid = Math.imul(al2, bh0);\n    mid = (mid + Math.imul(ah2, bl0)) | 0;\n    hi = Math.imul(ah2, bh0);\n    lo = (lo + Math.imul(al1, bl1)) | 0;\n    mid = (mid + Math.imul(al1, bh1)) | 0;\n    mid = (mid + Math.imul(ah1, bl1)) | 0;\n    hi = (hi + Math.imul(ah1, bh1)) | 0;\n    lo = (lo + Math.imul(al0, bl2)) | 0;\n    mid = (mid + Math.imul(al0, bh2)) | 0;\n    mid = (mid + Math.imul(ah0, bl2)) | 0;\n    hi = (hi + Math.imul(ah0, bh2)) | 0;\n    var w2 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0;\n    w2 &= 0x3ffffff;\n    /* k = 3 */\n    lo = Math.imul(al3, bl0);\n    mid = Math.imul(al3, bh0);\n    mid = (mid + Math.imul(ah3, bl0)) | 0;\n    hi = Math.imul(ah3, bh0);\n    lo = (lo + Math.imul(al2, bl1)) | 0;\n    mid = (mid + Math.imul(al2, bh1)) | 0;\n    mid = (mid + Math.imul(ah2, bl1)) | 0;\n    hi = (hi + Math.imul(ah2, bh1)) | 0;\n    lo = (lo + Math.imul(al1, bl2)) | 0;\n    mid = (mid + Math.imul(al1, bh2)) | 0;\n    mid = (mid + Math.imul(ah1, bl2)) | 0;\n    hi = (hi + Math.imul(ah1, bh2)) | 0;\n    lo = (lo + Math.imul(al0, bl3)) | 0;\n    mid = (mid + Math.imul(al0, bh3)) | 0;\n    mid = (mid + Math.imul(ah0, bl3)) | 0;\n    hi = (hi + Math.imul(ah0, bh3)) | 0;\n    var w3 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0;\n    w3 &= 0x3ffffff;\n    /* k = 4 */\n    lo = Math.imul(al4, bl0);\n    mid = Math.imul(al4, bh0);\n    mid = (mid + Math.imul(ah4, bl0)) | 0;\n    hi = Math.imul(ah4, bh0);\n    lo = (lo + Math.imul(al3, bl1)) | 0;\n    mid = (mid + Math.imul(al3, bh1)) | 0;\n    mid = (mid + Math.imul(ah3, bl1)) | 0;\n    hi = (hi + Math.imul(ah3, bh1)) | 0;\n    lo = (lo + Math.imul(al2, bl2)) | 0;\n    mid = (mid + Math.imul(al2, bh2)) | 0;\n    mid = (mid + Math.imul(ah2, bl2)) | 0;\n    hi = (hi + Math.imul(ah2, bh2)) | 0;\n    lo = (lo + Math.imul(al1, bl3)) | 0;\n    mid = (mid + Math.imul(al1, bh3)) | 0;\n    mid = (mid + Math.imul(ah1, bl3)) | 0;\n    hi = (hi + Math.imul(ah1, bh3)) | 0;\n    lo = (lo + Math.imul(al0, bl4)) | 0;\n    mid = (mid + Math.imul(al0, bh4)) | 0;\n    mid = (mid + Math.imul(ah0, bl4)) | 0;\n    hi = (hi + Math.imul(ah0, bh4)) | 0;\n    var w4 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0;\n    w4 &= 0x3ffffff;\n    /* k = 5 */\n    lo = Math.imul(al5, bl0);\n    mid = Math.imul(al5, bh0);\n    mid = (mid + Math.imul(ah5, bl0)) | 0;\n    hi = Math.imul(ah5, bh0);\n    lo = (lo + Math.imul(al4, bl1)) | 0;\n    mid = (mid + Math.imul(al4, bh1)) | 0;\n    mid = (mid + Math.imul(ah4, bl1)) | 0;\n    hi = (hi + Math.imul(ah4, bh1)) | 0;\n    lo = (lo + Math.imul(al3, bl2)) | 0;\n    mid = (mid + Math.imul(al3, bh2)) | 0;\n    mid = (mid + Math.imul(ah3, bl2)) | 0;\n    hi = (hi + Math.imul(ah3, bh2)) | 0;\n    lo = (lo + Math.imul(al2, bl3)) | 0;\n    mid = (mid + Math.imul(al2, bh3)) | 0;\n    mid = (mid + Math.imul(ah2, bl3)) | 0;\n    hi = (hi + Math.imul(ah2, bh3)) | 0;\n    lo = (lo + Math.imul(al1, bl4)) | 0;\n    mid = (mid + Math.imul(al1, bh4)) | 0;\n    mid = (mid + Math.imul(ah1, bl4)) | 0;\n    hi = (hi + Math.imul(ah1, bh4)) | 0;\n    lo = (lo + Math.imul(al0, bl5)) | 0;\n    mid = (mid + Math.imul(al0, bh5)) | 0;\n    mid = (mid + Math.imul(ah0, bl5)) | 0;\n    hi = (hi + Math.imul(ah0, bh5)) | 0;\n    var w5 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0;\n    w5 &= 0x3ffffff;\n    /* k = 6 */\n    lo = Math.imul(al6, bl0);\n    mid = Math.imul(al6, bh0);\n    mid = (mid + Math.imul(ah6, bl0)) | 0;\n    hi = Math.imul(ah6, bh0);\n    lo = (lo + Math.imul(al5, bl1)) | 0;\n    mid = (mid + Math.imul(al5, bh1)) | 0;\n    mid = (mid + Math.imul(ah5, bl1)) | 0;\n    hi = (hi + Math.imul(ah5, bh1)) | 0;\n    lo = (lo + Math.imul(al4, bl2)) | 0;\n    mid = (mid + Math.imul(al4, bh2)) | 0;\n    mid = (mid + Math.imul(ah4, bl2)) | 0;\n    hi = (hi + Math.imul(ah4, bh2)) | 0;\n    lo = (lo + Math.imul(al3, bl3)) | 0;\n    mid = (mid + Math.imul(al3, bh3)) | 0;\n    mid = (mid + Math.imul(ah3, bl3)) | 0;\n    hi = (hi + Math.imul(ah3, bh3)) | 0;\n    lo = (lo + Math.imul(al2, bl4)) | 0;\n    mid = (mid + Math.imul(al2, bh4)) | 0;\n    mid = (mid + Math.imul(ah2, bl4)) | 0;\n    hi = (hi + Math.imul(ah2, bh4)) | 0;\n    lo = (lo + Math.imul(al1, bl5)) | 0;\n    mid = (mid + Math.imul(al1, bh5)) | 0;\n    mid = (mid + Math.imul(ah1, bl5)) | 0;\n    hi = (hi + Math.imul(ah1, bh5)) | 0;\n    lo = (lo + Math.imul(al0, bl6)) | 0;\n    mid = (mid + Math.imul(al0, bh6)) | 0;\n    mid = (mid + Math.imul(ah0, bl6)) | 0;\n    hi = (hi + Math.imul(ah0, bh6)) | 0;\n    var w6 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0;\n    w6 &= 0x3ffffff;\n    /* k = 7 */\n    lo = Math.imul(al7, bl0);\n    mid = Math.imul(al7, bh0);\n    mid = (mid + Math.imul(ah7, bl0)) | 0;\n    hi = Math.imul(ah7, bh0);\n    lo = (lo + Math.imul(al6, bl1)) | 0;\n    mid = (mid + Math.imul(al6, bh1)) | 0;\n    mid = (mid + Math.imul(ah6, bl1)) | 0;\n    hi = (hi + Math.imul(ah6, bh1)) | 0;\n    lo = (lo + Math.imul(al5, bl2)) | 0;\n    mid = (mid + Math.imul(al5, bh2)) | 0;\n    mid = (mid + Math.imul(ah5, bl2)) | 0;\n    hi = (hi + Math.imul(ah5, bh2)) | 0;\n    lo = (lo + Math.imul(al4, bl3)) | 0;\n    mid = (mid + Math.imul(al4, bh3)) | 0;\n    mid = (mid + Math.imul(ah4, bl3)) | 0;\n    hi = (hi + Math.imul(ah4, bh3)) | 0;\n    lo = (lo + Math.imul(al3, bl4)) | 0;\n    mid = (mid + Math.imul(al3, bh4)) | 0;\n    mid = (mid + Math.imul(ah3, bl4)) | 0;\n    hi = (hi + Math.imul(ah3, bh4)) | 0;\n    lo = (lo + Math.imul(al2, bl5)) | 0;\n    mid = (mid + Math.imul(al2, bh5)) | 0;\n    mid = (mid + Math.imul(ah2, bl5)) | 0;\n    hi = (hi + Math.imul(ah2, bh5)) | 0;\n    lo = (lo + Math.imul(al1, bl6)) | 0;\n    mid = (mid + Math.imul(al1, bh6)) | 0;\n    mid = (mid + Math.imul(ah1, bl6)) | 0;\n    hi = (hi + Math.imul(ah1, bh6)) | 0;\n    lo = (lo + Math.imul(al0, bl7)) | 0;\n    mid = (mid + Math.imul(al0, bh7)) | 0;\n    mid = (mid + Math.imul(ah0, bl7)) | 0;\n    hi = (hi + Math.imul(ah0, bh7)) | 0;\n    var w7 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0;\n    w7 &= 0x3ffffff;\n    /* k = 8 */\n    lo = Math.imul(al8, bl0);\n    mid = Math.imul(al8, bh0);\n    mid = (mid + Math.imul(ah8, bl0)) | 0;\n    hi = Math.imul(ah8, bh0);\n    lo = (lo + Math.imul(al7, bl1)) | 0;\n    mid = (mid + Math.imul(al7, bh1)) | 0;\n    mid = (mid + Math.imul(ah7, bl1)) | 0;\n    hi = (hi + Math.imul(ah7, bh1)) | 0;\n    lo = (lo + Math.imul(al6, bl2)) | 0;\n    mid = (mid + Math.imul(al6, bh2)) | 0;\n    mid = (mid + Math.imul(ah6, bl2)) | 0;\n    hi = (hi + Math.imul(ah6, bh2)) | 0;\n    lo = (lo + Math.imul(al5, bl3)) | 0;\n    mid = (mid + Math.imul(al5, bh3)) | 0;\n    mid = (mid + Math.imul(ah5, bl3)) | 0;\n    hi = (hi + Math.imul(ah5, bh3)) | 0;\n    lo = (lo + Math.imul(al4, bl4)) | 0;\n    mid = (mid + Math.imul(al4, bh4)) | 0;\n    mid = (mid + Math.imul(ah4, bl4)) | 0;\n    hi = (hi + Math.imul(ah4, bh4)) | 0;\n    lo = (lo + Math.imul(al3, bl5)) | 0;\n    mid = (mid + Math.imul(al3, bh5)) | 0;\n    mid = (mid + Math.imul(ah3, bl5)) | 0;\n    hi = (hi + Math.imul(ah3, bh5)) | 0;\n    lo = (lo + Math.imul(al2, bl6)) | 0;\n    mid = (mid + Math.imul(al2, bh6)) | 0;\n    mid = (mid + Math.imul(ah2, bl6)) | 0;\n    hi = (hi + Math.imul(ah2, bh6)) | 0;\n    lo = (lo + Math.imul(al1, bl7)) | 0;\n    mid = (mid + Math.imul(al1, bh7)) | 0;\n    mid = (mid + Math.imul(ah1, bl7)) | 0;\n    hi = (hi + Math.imul(ah1, bh7)) | 0;\n    lo = (lo + Math.imul(al0, bl8)) | 0;\n    mid = (mid + Math.imul(al0, bh8)) | 0;\n    mid = (mid + Math.imul(ah0, bl8)) | 0;\n    hi = (hi + Math.imul(ah0, bh8)) | 0;\n    var w8 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0;\n    w8 &= 0x3ffffff;\n    /* k = 9 */\n    lo = Math.imul(al9, bl0);\n    mid = Math.imul(al9, bh0);\n    mid = (mid + Math.imul(ah9, bl0)) | 0;\n    hi = Math.imul(ah9, bh0);\n    lo = (lo + Math.imul(al8, bl1)) | 0;\n    mid = (mid + Math.imul(al8, bh1)) | 0;\n    mid = (mid + Math.imul(ah8, bl1)) | 0;\n    hi = (hi + Math.imul(ah8, bh1)) | 0;\n    lo = (lo + Math.imul(al7, bl2)) | 0;\n    mid = (mid + Math.imul(al7, bh2)) | 0;\n    mid = (mid + Math.imul(ah7, bl2)) | 0;\n    hi = (hi + Math.imul(ah7, bh2)) | 0;\n    lo = (lo + Math.imul(al6, bl3)) | 0;\n    mid = (mid + Math.imul(al6, bh3)) | 0;\n    mid = (mid + Math.imul(ah6, bl3)) | 0;\n    hi = (hi + Math.imul(ah6, bh3)) | 0;\n    lo = (lo + Math.imul(al5, bl4)) | 0;\n    mid = (mid + Math.imul(al5, bh4)) | 0;\n    mid = (mid + Math.imul(ah5, bl4)) | 0;\n    hi = (hi + Math.imul(ah5, bh4)) | 0;\n    lo = (lo + Math.imul(al4, bl5)) | 0;\n    mid = (mid + Math.imul(al4, bh5)) | 0;\n    mid = (mid + Math.imul(ah4, bl5)) | 0;\n    hi = (hi + Math.imul(ah4, bh5)) | 0;\n    lo = (lo + Math.imul(al3, bl6)) | 0;\n    mid = (mid + Math.imul(al3, bh6)) | 0;\n    mid = (mid + Math.imul(ah3, bl6)) | 0;\n    hi = (hi + Math.imul(ah3, bh6)) | 0;\n    lo = (lo + Math.imul(al2, bl7)) | 0;\n    mid = (mid + Math.imul(al2, bh7)) | 0;\n    mid = (mid + Math.imul(ah2, bl7)) | 0;\n    hi = (hi + Math.imul(ah2, bh7)) | 0;\n    lo = (lo + Math.imul(al1, bl8)) | 0;\n    mid = (mid + Math.imul(al1, bh8)) | 0;\n    mid = (mid + Math.imul(ah1, bl8)) | 0;\n    hi = (hi + Math.imul(ah1, bh8)) | 0;\n    lo = (lo + Math.imul(al0, bl9)) | 0;\n    mid = (mid + Math.imul(al0, bh9)) | 0;\n    mid = (mid + Math.imul(ah0, bl9)) | 0;\n    hi = (hi + Math.imul(ah0, bh9)) | 0;\n    var w9 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0;\n    w9 &= 0x3ffffff;\n    /* k = 10 */\n    lo = Math.imul(al9, bl1);\n    mid = Math.imul(al9, bh1);\n    mid = (mid + Math.imul(ah9, bl1)) | 0;\n    hi = Math.imul(ah9, bh1);\n    lo = (lo + Math.imul(al8, bl2)) | 0;\n    mid = (mid + Math.imul(al8, bh2)) | 0;\n    mid = (mid + Math.imul(ah8, bl2)) | 0;\n    hi = (hi + Math.imul(ah8, bh2)) | 0;\n    lo = (lo + Math.imul(al7, bl3)) | 0;\n    mid = (mid + Math.imul(al7, bh3)) | 0;\n    mid = (mid + Math.imul(ah7, bl3)) | 0;\n    hi = (hi + Math.imul(ah7, bh3)) | 0;\n    lo = (lo + Math.imul(al6, bl4)) | 0;\n    mid = (mid + Math.imul(al6, bh4)) | 0;\n    mid = (mid + Math.imul(ah6, bl4)) | 0;\n    hi = (hi + Math.imul(ah6, bh4)) | 0;\n    lo = (lo + Math.imul(al5, bl5)) | 0;\n    mid = (mid + Math.imul(al5, bh5)) | 0;\n    mid = (mid + Math.imul(ah5, bl5)) | 0;\n    hi = (hi + Math.imul(ah5, bh5)) | 0;\n    lo = (lo + Math.imul(al4, bl6)) | 0;\n    mid = (mid + Math.imul(al4, bh6)) | 0;\n    mid = (mid + Math.imul(ah4, bl6)) | 0;\n    hi = (hi + Math.imul(ah4, bh6)) | 0;\n    lo = (lo + Math.imul(al3, bl7)) | 0;\n    mid = (mid + Math.imul(al3, bh7)) | 0;\n    mid = (mid + Math.imul(ah3, bl7)) | 0;\n    hi = (hi + Math.imul(ah3, bh7)) | 0;\n    lo = (lo + Math.imul(al2, bl8)) | 0;\n    mid = (mid + Math.imul(al2, bh8)) | 0;\n    mid = (mid + Math.imul(ah2, bl8)) | 0;\n    hi = (hi + Math.imul(ah2, bh8)) | 0;\n    lo = (lo + Math.imul(al1, bl9)) | 0;\n    mid = (mid + Math.imul(al1, bh9)) | 0;\n    mid = (mid + Math.imul(ah1, bl9)) | 0;\n    hi = (hi + Math.imul(ah1, bh9)) | 0;\n    var w10 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0;\n    w10 &= 0x3ffffff;\n    /* k = 11 */\n    lo = Math.imul(al9, bl2);\n    mid = Math.imul(al9, bh2);\n    mid = (mid + Math.imul(ah9, bl2)) | 0;\n    hi = Math.imul(ah9, bh2);\n    lo = (lo + Math.imul(al8, bl3)) | 0;\n    mid = (mid + Math.imul(al8, bh3)) | 0;\n    mid = (mid + Math.imul(ah8, bl3)) | 0;\n    hi = (hi + Math.imul(ah8, bh3)) | 0;\n    lo = (lo + Math.imul(al7, bl4)) | 0;\n    mid = (mid + Math.imul(al7, bh4)) | 0;\n    mid = (mid + Math.imul(ah7, bl4)) | 0;\n    hi = (hi + Math.imul(ah7, bh4)) | 0;\n    lo = (lo + Math.imul(al6, bl5)) | 0;\n    mid = (mid + Math.imul(al6, bh5)) | 0;\n    mid = (mid + Math.imul(ah6, bl5)) | 0;\n    hi = (hi + Math.imul(ah6, bh5)) | 0;\n    lo = (lo + Math.imul(al5, bl6)) | 0;\n    mid = (mid + Math.imul(al5, bh6)) | 0;\n    mid = (mid + Math.imul(ah5, bl6)) | 0;\n    hi = (hi + Math.imul(ah5, bh6)) | 0;\n    lo = (lo + Math.imul(al4, bl7)) | 0;\n    mid = (mid + Math.imul(al4, bh7)) | 0;\n    mid = (mid + Math.imul(ah4, bl7)) | 0;\n    hi = (hi + Math.imul(ah4, bh7)) | 0;\n    lo = (lo + Math.imul(al3, bl8)) | 0;\n    mid = (mid + Math.imul(al3, bh8)) | 0;\n    mid = (mid + Math.imul(ah3, bl8)) | 0;\n    hi = (hi + Math.imul(ah3, bh8)) | 0;\n    lo = (lo + Math.imul(al2, bl9)) | 0;\n    mid = (mid + Math.imul(al2, bh9)) | 0;\n    mid = (mid + Math.imul(ah2, bl9)) | 0;\n    hi = (hi + Math.imul(ah2, bh9)) | 0;\n    var w11 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0;\n    w11 &= 0x3ffffff;\n    /* k = 12 */\n    lo = Math.imul(al9, bl3);\n    mid = Math.imul(al9, bh3);\n    mid = (mid + Math.imul(ah9, bl3)) | 0;\n    hi = Math.imul(ah9, bh3);\n    lo = (lo + Math.imul(al8, bl4)) | 0;\n    mid = (mid + Math.imul(al8, bh4)) | 0;\n    mid = (mid + Math.imul(ah8, bl4)) | 0;\n    hi = (hi + Math.imul(ah8, bh4)) | 0;\n    lo = (lo + Math.imul(al7, bl5)) | 0;\n    mid = (mid + Math.imul(al7, bh5)) | 0;\n    mid = (mid + Math.imul(ah7, bl5)) | 0;\n    hi = (hi + Math.imul(ah7, bh5)) | 0;\n    lo = (lo + Math.imul(al6, bl6)) | 0;\n    mid = (mid + Math.imul(al6, bh6)) | 0;\n    mid = (mid + Math.imul(ah6, bl6)) | 0;\n    hi = (hi + Math.imul(ah6, bh6)) | 0;\n    lo = (lo + Math.imul(al5, bl7)) | 0;\n    mid = (mid + Math.imul(al5, bh7)) | 0;\n    mid = (mid + Math.imul(ah5, bl7)) | 0;\n    hi = (hi + Math.imul(ah5, bh7)) | 0;\n    lo = (lo + Math.imul(al4, bl8)) | 0;\n    mid = (mid + Math.imul(al4, bh8)) | 0;\n    mid = (mid + Math.imul(ah4, bl8)) | 0;\n    hi = (hi + Math.imul(ah4, bh8)) | 0;\n    lo = (lo + Math.imul(al3, bl9)) | 0;\n    mid = (mid + Math.imul(al3, bh9)) | 0;\n    mid = (mid + Math.imul(ah3, bl9)) | 0;\n    hi = (hi + Math.imul(ah3, bh9)) | 0;\n    var w12 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0;\n    w12 &= 0x3ffffff;\n    /* k = 13 */\n    lo = Math.imul(al9, bl4);\n    mid = Math.imul(al9, bh4);\n    mid = (mid + Math.imul(ah9, bl4)) | 0;\n    hi = Math.imul(ah9, bh4);\n    lo = (lo + Math.imul(al8, bl5)) | 0;\n    mid = (mid + Math.imul(al8, bh5)) | 0;\n    mid = (mid + Math.imul(ah8, bl5)) | 0;\n    hi = (hi + Math.imul(ah8, bh5)) | 0;\n    lo = (lo + Math.imul(al7, bl6)) | 0;\n    mid = (mid + Math.imul(al7, bh6)) | 0;\n    mid = (mid + Math.imul(ah7, bl6)) | 0;\n    hi = (hi + Math.imul(ah7, bh6)) | 0;\n    lo = (lo + Math.imul(al6, bl7)) | 0;\n    mid = (mid + Math.imul(al6, bh7)) | 0;\n    mid = (mid + Math.imul(ah6, bl7)) | 0;\n    hi = (hi + Math.imul(ah6, bh7)) | 0;\n    lo = (lo + Math.imul(al5, bl8)) | 0;\n    mid = (mid + Math.imul(al5, bh8)) | 0;\n    mid = (mid + Math.imul(ah5, bl8)) | 0;\n    hi = (hi + Math.imul(ah5, bh8)) | 0;\n    lo = (lo + Math.imul(al4, bl9)) | 0;\n    mid = (mid + Math.imul(al4, bh9)) | 0;\n    mid = (mid + Math.imul(ah4, bl9)) | 0;\n    hi = (hi + Math.imul(ah4, bh9)) | 0;\n    var w13 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0;\n    w13 &= 0x3ffffff;\n    /* k = 14 */\n    lo = Math.imul(al9, bl5);\n    mid = Math.imul(al9, bh5);\n    mid = (mid + Math.imul(ah9, bl5)) | 0;\n    hi = Math.imul(ah9, bh5);\n    lo = (lo + Math.imul(al8, bl6)) | 0;\n    mid = (mid + Math.imul(al8, bh6)) | 0;\n    mid = (mid + Math.imul(ah8, bl6)) | 0;\n    hi = (hi + Math.imul(ah8, bh6)) | 0;\n    lo = (lo + Math.imul(al7, bl7)) | 0;\n    mid = (mid + Math.imul(al7, bh7)) | 0;\n    mid = (mid + Math.imul(ah7, bl7)) | 0;\n    hi = (hi + Math.imul(ah7, bh7)) | 0;\n    lo = (lo + Math.imul(al6, bl8)) | 0;\n    mid = (mid + Math.imul(al6, bh8)) | 0;\n    mid = (mid + Math.imul(ah6, bl8)) | 0;\n    hi = (hi + Math.imul(ah6, bh8)) | 0;\n    lo = (lo + Math.imul(al5, bl9)) | 0;\n    mid = (mid + Math.imul(al5, bh9)) | 0;\n    mid = (mid + Math.imul(ah5, bl9)) | 0;\n    hi = (hi + Math.imul(ah5, bh9)) | 0;\n    var w14 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0;\n    w14 &= 0x3ffffff;\n    /* k = 15 */\n    lo = Math.imul(al9, bl6);\n    mid = Math.imul(al9, bh6);\n    mid = (mid + Math.imul(ah9, bl6)) | 0;\n    hi = Math.imul(ah9, bh6);\n    lo = (lo + Math.imul(al8, bl7)) | 0;\n    mid = (mid + Math.imul(al8, bh7)) | 0;\n    mid = (mid + Math.imul(ah8, bl7)) | 0;\n    hi = (hi + Math.imul(ah8, bh7)) | 0;\n    lo = (lo + Math.imul(al7, bl8)) | 0;\n    mid = (mid + Math.imul(al7, bh8)) | 0;\n    mid = (mid + Math.imul(ah7, bl8)) | 0;\n    hi = (hi + Math.imul(ah7, bh8)) | 0;\n    lo = (lo + Math.imul(al6, bl9)) | 0;\n    mid = (mid + Math.imul(al6, bh9)) | 0;\n    mid = (mid + Math.imul(ah6, bl9)) | 0;\n    hi = (hi + Math.imul(ah6, bh9)) | 0;\n    var w15 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0;\n    w15 &= 0x3ffffff;\n    /* k = 16 */\n    lo = Math.imul(al9, bl7);\n    mid = Math.imul(al9, bh7);\n    mid = (mid + Math.imul(ah9, bl7)) | 0;\n    hi = Math.imul(ah9, bh7);\n    lo = (lo + Math.imul(al8, bl8)) | 0;\n    mid = (mid + Math.imul(al8, bh8)) | 0;\n    mid = (mid + Math.imul(ah8, bl8)) | 0;\n    hi = (hi + Math.imul(ah8, bh8)) | 0;\n    lo = (lo + Math.imul(al7, bl9)) | 0;\n    mid = (mid + Math.imul(al7, bh9)) | 0;\n    mid = (mid + Math.imul(ah7, bl9)) | 0;\n    hi = (hi + Math.imul(ah7, bh9)) | 0;\n    var w16 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0;\n    w16 &= 0x3ffffff;\n    /* k = 17 */\n    lo = Math.imul(al9, bl8);\n    mid = Math.imul(al9, bh8);\n    mid = (mid + Math.imul(ah9, bl8)) | 0;\n    hi = Math.imul(ah9, bh8);\n    lo = (lo + Math.imul(al8, bl9)) | 0;\n    mid = (mid + Math.imul(al8, bh9)) | 0;\n    mid = (mid + Math.imul(ah8, bl9)) | 0;\n    hi = (hi + Math.imul(ah8, bh9)) | 0;\n    var w17 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0;\n    w17 &= 0x3ffffff;\n    /* k = 18 */\n    lo = Math.imul(al9, bl9);\n    mid = Math.imul(al9, bh9);\n    mid = (mid + Math.imul(ah9, bl9)) | 0;\n    hi = Math.imul(ah9, bh9);\n    var w18 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0;\n    w18 &= 0x3ffffff;\n    o[0] = w0;\n    o[1] = w1;\n    o[2] = w2;\n    o[3] = w3;\n    o[4] = w4;\n    o[5] = w5;\n    o[6] = w6;\n    o[7] = w7;\n    o[8] = w8;\n    o[9] = w9;\n    o[10] = w10;\n    o[11] = w11;\n    o[12] = w12;\n    o[13] = w13;\n    o[14] = w14;\n    o[15] = w15;\n    o[16] = w16;\n    o[17] = w17;\n    o[18] = w18;\n    if (c !== 0) {\n      o[19] = c;\n      out.length++;\n    }\n    return out;\n  };\n\n  // Polyfill comb\n  if (!Math.imul) {\n    comb10MulTo = smallMulTo;\n  }\n\n  function bigMulTo (self, num, out) {\n    out.negative = num.negative ^ self.negative;\n    out.length = self.length + num.length;\n\n    var carry = 0;\n    var hncarry = 0;\n    for (var k = 0; k < out.length - 1; k++) {\n      // Sum all words with the same `i + j = k` and accumulate `ncarry`,\n      // note that ncarry could be >= 0x3ffffff\n      var ncarry = hncarry;\n      hncarry = 0;\n      var rword = carry & 0x3ffffff;\n      var maxJ = Math.min(k, num.length - 1);\n      for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) {\n        var i = k - j;\n        var a = self.words[i] | 0;\n        var b = num.words[j] | 0;\n        var r = a * b;\n\n        var lo = r & 0x3ffffff;\n        ncarry = (ncarry + ((r / 0x4000000) | 0)) | 0;\n        lo = (lo + rword) | 0;\n        rword = lo & 0x3ffffff;\n        ncarry = (ncarry + (lo >>> 26)) | 0;\n\n        hncarry += ncarry >>> 26;\n        ncarry &= 0x3ffffff;\n      }\n      out.words[k] = rword;\n      carry = ncarry;\n      ncarry = hncarry;\n    }\n    if (carry !== 0) {\n      out.words[k] = carry;\n    } else {\n      out.length--;\n    }\n\n    return out._strip();\n  }\n\n  function jumboMulTo (self, num, out) {\n    // Temporary disable, see https://github.com/indutny/bn.js/issues/211\n    // var fftm = new FFTM();\n    // return fftm.mulp(self, num, out);\n    return bigMulTo(self, num, out);\n  }\n\n  BN.prototype.mulTo = function mulTo (num, out) {\n    var res;\n    var len = this.length + num.length;\n    if (this.length === 10 && num.length === 10) {\n      res = comb10MulTo(this, num, out);\n    } else if (len < 63) {\n      res = smallMulTo(this, num, out);\n    } else if (len < 1024) {\n      res = bigMulTo(this, num, out);\n    } else {\n      res = jumboMulTo(this, num, out);\n    }\n\n    return res;\n  };\n\n  // Cooley-Tukey algorithm for FFT\n  // slightly revisited to rely on looping instead of recursion\n\n  function FFTM (x, y) {\n    this.x = x;\n    this.y = y;\n  }\n\n  FFTM.prototype.makeRBT = function makeRBT (N) {\n    var t = new Array(N);\n    var l = BN.prototype._countBits(N) - 1;\n    for (var i = 0; i < N; i++) {\n      t[i] = this.revBin(i, l, N);\n    }\n\n    return t;\n  };\n\n  // Returns binary-reversed representation of `x`\n  FFTM.prototype.revBin = function revBin (x, l, N) {\n    if (x === 0 || x === N - 1) return x;\n\n    var rb = 0;\n    for (var i = 0; i < l; i++) {\n      rb |= (x & 1) << (l - i - 1);\n      x >>= 1;\n    }\n\n    return rb;\n  };\n\n  // Performs \"tweedling\" phase, therefore 'emulating'\n  // behaviour of the recursive algorithm\n  FFTM.prototype.permute = function permute (rbt, rws, iws, rtws, itws, N) {\n    for (var i = 0; i < N; i++) {\n      rtws[i] = rws[rbt[i]];\n      itws[i] = iws[rbt[i]];\n    }\n  };\n\n  FFTM.prototype.transform = function transform (rws, iws, rtws, itws, N, rbt) {\n    this.permute(rbt, rws, iws, rtws, itws, N);\n\n    for (var s = 1; s < N; s <<= 1) {\n      var l = s << 1;\n\n      var rtwdf = Math.cos(2 * Math.PI / l);\n      var itwdf = Math.sin(2 * Math.PI / l);\n\n      for (var p = 0; p < N; p += l) {\n        var rtwdf_ = rtwdf;\n        var itwdf_ = itwdf;\n\n        for (var j = 0; j < s; j++) {\n          var re = rtws[p + j];\n          var ie = itws[p + j];\n\n          var ro = rtws[p + j + s];\n          var io = itws[p + j + s];\n\n          var rx = rtwdf_ * ro - itwdf_ * io;\n\n          io = rtwdf_ * io + itwdf_ * ro;\n          ro = rx;\n\n          rtws[p + j] = re + ro;\n          itws[p + j] = ie + io;\n\n          rtws[p + j + s] = re - ro;\n          itws[p + j + s] = ie - io;\n\n          /* jshint maxdepth : false */\n          if (j !== l) {\n            rx = rtwdf * rtwdf_ - itwdf * itwdf_;\n\n            itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_;\n            rtwdf_ = rx;\n          }\n        }\n      }\n    }\n  };\n\n  FFTM.prototype.guessLen13b = function guessLen13b (n, m) {\n    var N = Math.max(m, n) | 1;\n    var odd = N & 1;\n    var i = 0;\n    for (N = N / 2 | 0; N; N = N >>> 1) {\n      i++;\n    }\n\n    return 1 << i + 1 + odd;\n  };\n\n  FFTM.prototype.conjugate = function conjugate (rws, iws, N) {\n    if (N <= 1) return;\n\n    for (var i = 0; i < N / 2; i++) {\n      var t = rws[i];\n\n      rws[i] = rws[N - i - 1];\n      rws[N - i - 1] = t;\n\n      t = iws[i];\n\n      iws[i] = -iws[N - i - 1];\n      iws[N - i - 1] = -t;\n    }\n  };\n\n  FFTM.prototype.normalize13b = function normalize13b (ws, N) {\n    var carry = 0;\n    for (var i = 0; i < N / 2; i++) {\n      var w = Math.round(ws[2 * i + 1] / N) * 0x2000 +\n        Math.round(ws[2 * i] / N) +\n        carry;\n\n      ws[i] = w & 0x3ffffff;\n\n      if (w < 0x4000000) {\n        carry = 0;\n      } else {\n        carry = w / 0x4000000 | 0;\n      }\n    }\n\n    return ws;\n  };\n\n  FFTM.prototype.convert13b = function convert13b (ws, len, rws, N) {\n    var carry = 0;\n    for (var i = 0; i < len; i++) {\n      carry = carry + (ws[i] | 0);\n\n      rws[2 * i] = carry & 0x1fff; carry = carry >>> 13;\n      rws[2 * i + 1] = carry & 0x1fff; carry = carry >>> 13;\n    }\n\n    // Pad with zeroes\n    for (i = 2 * len; i < N; ++i) {\n      rws[i] = 0;\n    }\n\n    assert(carry === 0);\n    assert((carry & ~0x1fff) === 0);\n  };\n\n  FFTM.prototype.stub = function stub (N) {\n    var ph = new Array(N);\n    for (var i = 0; i < N; i++) {\n      ph[i] = 0;\n    }\n\n    return ph;\n  };\n\n  FFTM.prototype.mulp = function mulp (x, y, out) {\n    var N = 2 * this.guessLen13b(x.length, y.length);\n\n    var rbt = this.makeRBT(N);\n\n    var _ = this.stub(N);\n\n    var rws = new Array(N);\n    var rwst = new Array(N);\n    var iwst = new Array(N);\n\n    var nrws = new Array(N);\n    var nrwst = new Array(N);\n    var niwst = new Array(N);\n\n    var rmws = out.words;\n    rmws.length = N;\n\n    this.convert13b(x.words, x.length, rws, N);\n    this.convert13b(y.words, y.length, nrws, N);\n\n    this.transform(rws, _, rwst, iwst, N, rbt);\n    this.transform(nrws, _, nrwst, niwst, N, rbt);\n\n    for (var i = 0; i < N; i++) {\n      var rx = rwst[i] * nrwst[i] - iwst[i] * niwst[i];\n      iwst[i] = rwst[i] * niwst[i] + iwst[i] * nrwst[i];\n      rwst[i] = rx;\n    }\n\n    this.conjugate(rwst, iwst, N);\n    this.transform(rwst, iwst, rmws, _, N, rbt);\n    this.conjugate(rmws, _, N);\n    this.normalize13b(rmws, N);\n\n    out.negative = x.negative ^ y.negative;\n    out.length = x.length + y.length;\n    return out._strip();\n  };\n\n  // Multiply `this` by `num`\n  BN.prototype.mul = function mul (num) {\n    var out = new BN(null);\n    out.words = new Array(this.length + num.length);\n    return this.mulTo(num, out);\n  };\n\n  // Multiply employing FFT\n  BN.prototype.mulf = function mulf (num) {\n    var out = new BN(null);\n    out.words = new Array(this.length + num.length);\n    return jumboMulTo(this, num, out);\n  };\n\n  // In-place Multiplication\n  BN.prototype.imul = function imul (num) {\n    return this.clone().mulTo(num, this);\n  };\n\n  BN.prototype.imuln = function imuln (num) {\n    var isNegNum = num < 0;\n    if (isNegNum) num = -num;\n\n    assert(typeof num === 'number');\n    assert(num < 0x4000000);\n\n    // Carry\n    var carry = 0;\n    for (var i = 0; i < this.length; i++) {\n      var w = (this.words[i] | 0) * num;\n      var lo = (w & 0x3ffffff) + (carry & 0x3ffffff);\n      carry >>= 26;\n      carry += (w / 0x4000000) | 0;\n      // NOTE: lo is 27bit maximum\n      carry += lo >>> 26;\n      this.words[i] = lo & 0x3ffffff;\n    }\n\n    if (carry !== 0) {\n      this.words[i] = carry;\n      this.length++;\n    }\n\n    return isNegNum ? this.ineg() : this;\n  };\n\n  BN.prototype.muln = function muln (num) {\n    return this.clone().imuln(num);\n  };\n\n  // `this` * `this`\n  BN.prototype.sqr = function sqr () {\n    return this.mul(this);\n  };\n\n  // `this` * `this` in-place\n  BN.prototype.isqr = function isqr () {\n    return this.imul(this.clone());\n  };\n\n  // Math.pow(`this`, `num`)\n  BN.prototype.pow = function pow (num) {\n    var w = toBitArray(num);\n    if (w.length === 0) return new BN(1);\n\n    // Skip leading zeroes\n    var res = this;\n    for (var i = 0; i < w.length; i++, res = res.sqr()) {\n      if (w[i] !== 0) break;\n    }\n\n    if (++i < w.length) {\n      for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) {\n        if (w[i] === 0) continue;\n\n        res = res.mul(q);\n      }\n    }\n\n    return res;\n  };\n\n  // Shift-left in-place\n  BN.prototype.iushln = function iushln (bits) {\n    assert(typeof bits === 'number' && bits >= 0);\n    var r = bits % 26;\n    var s = (bits - r) / 26;\n    var carryMask = (0x3ffffff >>> (26 - r)) << (26 - r);\n    var i;\n\n    if (r !== 0) {\n      var carry = 0;\n\n      for (i = 0; i < this.length; i++) {\n        var newCarry = this.words[i] & carryMask;\n        var c = ((this.words[i] | 0) - newCarry) << r;\n        this.words[i] = c | carry;\n        carry = newCarry >>> (26 - r);\n      }\n\n      if (carry) {\n        this.words[i] = carry;\n        this.length++;\n      }\n    }\n\n    if (s !== 0) {\n      for (i = this.length - 1; i >= 0; i--) {\n        this.words[i + s] = this.words[i];\n      }\n\n      for (i = 0; i < s; i++) {\n        this.words[i] = 0;\n      }\n\n      this.length += s;\n    }\n\n    return this._strip();\n  };\n\n  BN.prototype.ishln = function ishln (bits) {\n    // TODO(indutny): implement me\n    assert(this.negative === 0);\n    return this.iushln(bits);\n  };\n\n  // Shift-right in-place\n  // NOTE: `hint` is a lowest bit before trailing zeroes\n  // NOTE: if `extended` is present - it will be filled with destroyed bits\n  BN.prototype.iushrn = function iushrn (bits, hint, extended) {\n    assert(typeof bits === 'number' && bits >= 0);\n    var h;\n    if (hint) {\n      h = (hint - (hint % 26)) / 26;\n    } else {\n      h = 0;\n    }\n\n    var r = bits % 26;\n    var s = Math.min((bits - r) / 26, this.length);\n    var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r);\n    var maskedWords = extended;\n\n    h -= s;\n    h = Math.max(0, h);\n\n    // Extended mode, copy masked part\n    if (maskedWords) {\n      for (var i = 0; i < s; i++) {\n        maskedWords.words[i] = this.words[i];\n      }\n      maskedWords.length = s;\n    }\n\n    if (s === 0) {\n      // No-op, we should not move anything at all\n    } else if (this.length > s) {\n      this.length -= s;\n      for (i = 0; i < this.length; i++) {\n        this.words[i] = this.words[i + s];\n      }\n    } else {\n      this.words[0] = 0;\n      this.length = 1;\n    }\n\n    var carry = 0;\n    for (i = this.length - 1; i >= 0 && (carry !== 0 || i >= h); i--) {\n      var word = this.words[i] | 0;\n      this.words[i] = (carry << (26 - r)) | (word >>> r);\n      carry = word & mask;\n    }\n\n    // Push carried bits as a mask\n    if (maskedWords && carry !== 0) {\n      maskedWords.words[maskedWords.length++] = carry;\n    }\n\n    if (this.length === 0) {\n      this.words[0] = 0;\n      this.length = 1;\n    }\n\n    return this._strip();\n  };\n\n  BN.prototype.ishrn = function ishrn (bits, hint, extended) {\n    // TODO(indutny): implement me\n    assert(this.negative === 0);\n    return this.iushrn(bits, hint, extended);\n  };\n\n  // Shift-left\n  BN.prototype.shln = function shln (bits) {\n    return this.clone().ishln(bits);\n  };\n\n  BN.prototype.ushln = function ushln (bits) {\n    return this.clone().iushln(bits);\n  };\n\n  // Shift-right\n  BN.prototype.shrn = function shrn (bits) {\n    return this.clone().ishrn(bits);\n  };\n\n  BN.prototype.ushrn = function ushrn (bits) {\n    return this.clone().iushrn(bits);\n  };\n\n  // Test if n bit is set\n  BN.prototype.testn = function testn (bit) {\n    assert(typeof bit === 'number' && bit >= 0);\n    var r = bit % 26;\n    var s = (bit - r) / 26;\n    var q = 1 << r;\n\n    // Fast case: bit is much higher than all existing words\n    if (this.length <= s) return false;\n\n    // Check bit and return\n    var w = this.words[s];\n\n    return !!(w & q);\n  };\n\n  // Return only lowers bits of number (in-place)\n  BN.prototype.imaskn = function imaskn (bits) {\n    assert(typeof bits === 'number' && bits >= 0);\n    var r = bits % 26;\n    var s = (bits - r) / 26;\n\n    assert(this.negative === 0, 'imaskn works only with positive numbers');\n\n    if (this.length <= s) {\n      return this;\n    }\n\n    if (r !== 0) {\n      s++;\n    }\n    this.length = Math.min(s, this.length);\n\n    if (r !== 0) {\n      var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r);\n      this.words[this.length - 1] &= mask;\n    }\n\n    return this._strip();\n  };\n\n  // Return only lowers bits of number\n  BN.prototype.maskn = function maskn (bits) {\n    return this.clone().imaskn(bits);\n  };\n\n  // Add plain number `num` to `this`\n  BN.prototype.iaddn = function iaddn (num) {\n    assert(typeof num === 'number');\n    assert(num < 0x4000000);\n    if (num < 0) return this.isubn(-num);\n\n    // Possible sign change\n    if (this.negative !== 0) {\n      if (this.length === 1 && (this.words[0] | 0) <= num) {\n        this.words[0] = num - (this.words[0] | 0);\n        this.negative = 0;\n        return this;\n      }\n\n      this.negative = 0;\n      this.isubn(num);\n      this.negative = 1;\n      return this;\n    }\n\n    // Add without checks\n    return this._iaddn(num);\n  };\n\n  BN.prototype._iaddn = function _iaddn (num) {\n    this.words[0] += num;\n\n    // Carry\n    for (var i = 0; i < this.length && this.words[i] >= 0x4000000; i++) {\n      this.words[i] -= 0x4000000;\n      if (i === this.length - 1) {\n        this.words[i + 1] = 1;\n      } else {\n        this.words[i + 1]++;\n      }\n    }\n    this.length = Math.max(this.length, i + 1);\n\n    return this;\n  };\n\n  // Subtract plain number `num` from `this`\n  BN.prototype.isubn = function isubn (num) {\n    assert(typeof num === 'number');\n    assert(num < 0x4000000);\n    if (num < 0) return this.iaddn(-num);\n\n    if (this.negative !== 0) {\n      this.negative = 0;\n      this.iaddn(num);\n      this.negative = 1;\n      return this;\n    }\n\n    this.words[0] -= num;\n\n    if (this.length === 1 && this.words[0] < 0) {\n      this.words[0] = -this.words[0];\n      this.negative = 1;\n    } else {\n      // Carry\n      for (var i = 0; i < this.length && this.words[i] < 0; i++) {\n        this.words[i] += 0x4000000;\n        this.words[i + 1] -= 1;\n      }\n    }\n\n    return this._strip();\n  };\n\n  BN.prototype.addn = function addn (num) {\n    return this.clone().iaddn(num);\n  };\n\n  BN.prototype.subn = function subn (num) {\n    return this.clone().isubn(num);\n  };\n\n  BN.prototype.iabs = function iabs () {\n    this.negative = 0;\n\n    return this;\n  };\n\n  BN.prototype.abs = function abs () {\n    return this.clone().iabs();\n  };\n\n  BN.prototype._ishlnsubmul = function _ishlnsubmul (num, mul, shift) {\n    var len = num.length + shift;\n    var i;\n\n    this._expand(len);\n\n    var w;\n    var carry = 0;\n    for (i = 0; i < num.length; i++) {\n      w = (this.words[i + shift] | 0) + carry;\n      var right = (num.words[i] | 0) * mul;\n      w -= right & 0x3ffffff;\n      carry = (w >> 26) - ((right / 0x4000000) | 0);\n      this.words[i + shift] = w & 0x3ffffff;\n    }\n    for (; i < this.length - shift; i++) {\n      w = (this.words[i + shift] | 0) + carry;\n      carry = w >> 26;\n      this.words[i + shift] = w & 0x3ffffff;\n    }\n\n    if (carry === 0) return this._strip();\n\n    // Subtraction overflow\n    assert(carry === -1);\n    carry = 0;\n    for (i = 0; i < this.length; i++) {\n      w = -(this.words[i] | 0) + carry;\n      carry = w >> 26;\n      this.words[i] = w & 0x3ffffff;\n    }\n    this.negative = 1;\n\n    return this._strip();\n  };\n\n  BN.prototype._wordDiv = function _wordDiv (num, mode) {\n    var shift = this.length - num.length;\n\n    var a = this.clone();\n    var b = num;\n\n    // Normalize\n    var bhi = b.words[b.length - 1] | 0;\n    var bhiBits = this._countBits(bhi);\n    shift = 26 - bhiBits;\n    if (shift !== 0) {\n      b = b.ushln(shift);\n      a.iushln(shift);\n      bhi = b.words[b.length - 1] | 0;\n    }\n\n    // Initialize quotient\n    var m = a.length - b.length;\n    var q;\n\n    if (mode !== 'mod') {\n      q = new BN(null);\n      q.length = m + 1;\n      q.words = new Array(q.length);\n      for (var i = 0; i < q.length; i++) {\n        q.words[i] = 0;\n      }\n    }\n\n    var diff = a.clone()._ishlnsubmul(b, 1, m);\n    if (diff.negative === 0) {\n      a = diff;\n      if (q) {\n        q.words[m] = 1;\n      }\n    }\n\n    for (var j = m - 1; j >= 0; j--) {\n      var qj = (a.words[b.length + j] | 0) * 0x4000000 +\n        (a.words[b.length + j - 1] | 0);\n\n      // NOTE: (qj / bhi) is (0x3ffffff * 0x4000000 + 0x3ffffff) / 0x2000000 max\n      // (0x7ffffff)\n      qj = Math.min((qj / bhi) | 0, 0x3ffffff);\n\n      a._ishlnsubmul(b, qj, j);\n      while (a.negative !== 0) {\n        qj--;\n        a.negative = 0;\n        a._ishlnsubmul(b, 1, j);\n        if (!a.isZero()) {\n          a.negative ^= 1;\n        }\n      }\n      if (q) {\n        q.words[j] = qj;\n      }\n    }\n    if (q) {\n      q._strip();\n    }\n    a._strip();\n\n    // Denormalize\n    if (mode !== 'div' && shift !== 0) {\n      a.iushrn(shift);\n    }\n\n    return {\n      div: q || null,\n      mod: a\n    };\n  };\n\n  // NOTE: 1) `mode` can be set to `mod` to request mod only,\n  //       to `div` to request div only, or be absent to\n  //       request both div & mod\n  //       2) `positive` is true if unsigned mod is requested\n  BN.prototype.divmod = function divmod (num, mode, positive) {\n    assert(!num.isZero());\n\n    if (this.isZero()) {\n      return {\n        div: new BN(0),\n        mod: new BN(0)\n      };\n    }\n\n    var div, mod, res;\n    if (this.negative !== 0 && num.negative === 0) {\n      res = this.neg().divmod(num, mode);\n\n      if (mode !== 'mod') {\n        div = res.div.neg();\n      }\n\n      if (mode !== 'div') {\n        mod = res.mod.neg();\n        if (positive && mod.negative !== 0) {\n          mod.iadd(num);\n        }\n      }\n\n      return {\n        div: div,\n        mod: mod\n      };\n    }\n\n    if (this.negative === 0 && num.negative !== 0) {\n      res = this.divmod(num.neg(), mode);\n\n      if (mode !== 'mod') {\n        div = res.div.neg();\n      }\n\n      return {\n        div: div,\n        mod: res.mod\n      };\n    }\n\n    if ((this.negative & num.negative) !== 0) {\n      res = this.neg().divmod(num.neg(), mode);\n\n      if (mode !== 'div') {\n        mod = res.mod.neg();\n        if (positive && mod.negative !== 0) {\n          mod.isub(num);\n        }\n      }\n\n      return {\n        div: res.div,\n        mod: mod\n      };\n    }\n\n    // Both numbers are positive at this point\n\n    // Strip both numbers to approximate shift value\n    if (num.length > this.length || this.cmp(num) < 0) {\n      return {\n        div: new BN(0),\n        mod: this\n      };\n    }\n\n    // Very short reduction\n    if (num.length === 1) {\n      if (mode === 'div') {\n        return {\n          div: this.divn(num.words[0]),\n          mod: null\n        };\n      }\n\n      if (mode === 'mod') {\n        return {\n          div: null,\n          mod: new BN(this.modrn(num.words[0]))\n        };\n      }\n\n      return {\n        div: this.divn(num.words[0]),\n        mod: new BN(this.modrn(num.words[0]))\n      };\n    }\n\n    return this._wordDiv(num, mode);\n  };\n\n  // Find `this` / `num`\n  BN.prototype.div = function div (num) {\n    return this.divmod(num, 'div', false).div;\n  };\n\n  // Find `this` % `num`\n  BN.prototype.mod = function mod (num) {\n    return this.divmod(num, 'mod', false).mod;\n  };\n\n  BN.prototype.umod = function umod (num) {\n    return this.divmod(num, 'mod', true).mod;\n  };\n\n  // Find Round(`this` / `num`)\n  BN.prototype.divRound = function divRound (num) {\n    var dm = this.divmod(num);\n\n    // Fast case - exact division\n    if (dm.mod.isZero()) return dm.div;\n\n    var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod;\n\n    var half = num.ushrn(1);\n    var r2 = num.andln(1);\n    var cmp = mod.cmp(half);\n\n    // Round down\n    if (cmp < 0 || (r2 === 1 && cmp === 0)) return dm.div;\n\n    // Round up\n    return dm.div.negative !== 0 ? dm.div.isubn(1) : dm.div.iaddn(1);\n  };\n\n  BN.prototype.modrn = function modrn (num) {\n    var isNegNum = num < 0;\n    if (isNegNum) num = -num;\n\n    assert(num <= 0x3ffffff);\n    var p = (1 << 26) % num;\n\n    var acc = 0;\n    for (var i = this.length - 1; i >= 0; i--) {\n      acc = (p * acc + (this.words[i] | 0)) % num;\n    }\n\n    return isNegNum ? -acc : acc;\n  };\n\n  // WARNING: DEPRECATED\n  BN.prototype.modn = function modn (num) {\n    return this.modrn(num);\n  };\n\n  // In-place division by number\n  BN.prototype.idivn = function idivn (num) {\n    var isNegNum = num < 0;\n    if (isNegNum) num = -num;\n\n    assert(num <= 0x3ffffff);\n\n    var carry = 0;\n    for (var i = this.length - 1; i >= 0; i--) {\n      var w = (this.words[i] | 0) + carry * 0x4000000;\n      this.words[i] = (w / num) | 0;\n      carry = w % num;\n    }\n\n    this._strip();\n    return isNegNum ? this.ineg() : this;\n  };\n\n  BN.prototype.divn = function divn (num) {\n    return this.clone().idivn(num);\n  };\n\n  BN.prototype.egcd = function egcd (p) {\n    assert(p.negative === 0);\n    assert(!p.isZero());\n\n    var x = this;\n    var y = p.clone();\n\n    if (x.negative !== 0) {\n      x = x.umod(p);\n    } else {\n      x = x.clone();\n    }\n\n    // A * x + B * y = x\n    var A = new BN(1);\n    var B = new BN(0);\n\n    // C * x + D * y = y\n    var C = new BN(0);\n    var D = new BN(1);\n\n    var g = 0;\n\n    while (x.isEven() && y.isEven()) {\n      x.iushrn(1);\n      y.iushrn(1);\n      ++g;\n    }\n\n    var yp = y.clone();\n    var xp = x.clone();\n\n    while (!x.isZero()) {\n      for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n      if (i > 0) {\n        x.iushrn(i);\n        while (i-- > 0) {\n          if (A.isOdd() || B.isOdd()) {\n            A.iadd(yp);\n            B.isub(xp);\n          }\n\n          A.iushrn(1);\n          B.iushrn(1);\n        }\n      }\n\n      for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n      if (j > 0) {\n        y.iushrn(j);\n        while (j-- > 0) {\n          if (C.isOdd() || D.isOdd()) {\n            C.iadd(yp);\n            D.isub(xp);\n          }\n\n          C.iushrn(1);\n          D.iushrn(1);\n        }\n      }\n\n      if (x.cmp(y) >= 0) {\n        x.isub(y);\n        A.isub(C);\n        B.isub(D);\n      } else {\n        y.isub(x);\n        C.isub(A);\n        D.isub(B);\n      }\n    }\n\n    return {\n      a: C,\n      b: D,\n      gcd: y.iushln(g)\n    };\n  };\n\n  // This is reduced incarnation of the binary EEA\n  // above, designated to invert members of the\n  // _prime_ fields F(p) at a maximal speed\n  BN.prototype._invmp = function _invmp (p) {\n    assert(p.negative === 0);\n    assert(!p.isZero());\n\n    var a = this;\n    var b = p.clone();\n\n    if (a.negative !== 0) {\n      a = a.umod(p);\n    } else {\n      a = a.clone();\n    }\n\n    var x1 = new BN(1);\n    var x2 = new BN(0);\n\n    var delta = b.clone();\n\n    while (a.cmpn(1) > 0 && b.cmpn(1) > 0) {\n      for (var i = 0, im = 1; (a.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n      if (i > 0) {\n        a.iushrn(i);\n        while (i-- > 0) {\n          if (x1.isOdd()) {\n            x1.iadd(delta);\n          }\n\n          x1.iushrn(1);\n        }\n      }\n\n      for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n      if (j > 0) {\n        b.iushrn(j);\n        while (j-- > 0) {\n          if (x2.isOdd()) {\n            x2.iadd(delta);\n          }\n\n          x2.iushrn(1);\n        }\n      }\n\n      if (a.cmp(b) >= 0) {\n        a.isub(b);\n        x1.isub(x2);\n      } else {\n        b.isub(a);\n        x2.isub(x1);\n      }\n    }\n\n    var res;\n    if (a.cmpn(1) === 0) {\n      res = x1;\n    } else {\n      res = x2;\n    }\n\n    if (res.cmpn(0) < 0) {\n      res.iadd(p);\n    }\n\n    return res;\n  };\n\n  BN.prototype.gcd = function gcd (num) {\n    if (this.isZero()) return num.abs();\n    if (num.isZero()) return this.abs();\n\n    var a = this.clone();\n    var b = num.clone();\n    a.negative = 0;\n    b.negative = 0;\n\n    // Remove common factor of two\n    for (var shift = 0; a.isEven() && b.isEven(); shift++) {\n      a.iushrn(1);\n      b.iushrn(1);\n    }\n\n    do {\n      while (a.isEven()) {\n        a.iushrn(1);\n      }\n      while (b.isEven()) {\n        b.iushrn(1);\n      }\n\n      var r = a.cmp(b);\n      if (r < 0) {\n        // Swap `a` and `b` to make `a` always bigger than `b`\n        var t = a;\n        a = b;\n        b = t;\n      } else if (r === 0 || b.cmpn(1) === 0) {\n        break;\n      }\n\n      a.isub(b);\n    } while (true);\n\n    return b.iushln(shift);\n  };\n\n  // Invert number in the field F(num)\n  BN.prototype.invm = function invm (num) {\n    return this.egcd(num).a.umod(num);\n  };\n\n  BN.prototype.isEven = function isEven () {\n    return (this.words[0] & 1) === 0;\n  };\n\n  BN.prototype.isOdd = function isOdd () {\n    return (this.words[0] & 1) === 1;\n  };\n\n  // And first word and num\n  BN.prototype.andln = function andln (num) {\n    return this.words[0] & num;\n  };\n\n  // Increment at the bit position in-line\n  BN.prototype.bincn = function bincn (bit) {\n    assert(typeof bit === 'number');\n    var r = bit % 26;\n    var s = (bit - r) / 26;\n    var q = 1 << r;\n\n    // Fast case: bit is much higher than all existing words\n    if (this.length <= s) {\n      this._expand(s + 1);\n      this.words[s] |= q;\n      return this;\n    }\n\n    // Add bit and propagate, if needed\n    var carry = q;\n    for (var i = s; carry !== 0 && i < this.length; i++) {\n      var w = this.words[i] | 0;\n      w += carry;\n      carry = w >>> 26;\n      w &= 0x3ffffff;\n      this.words[i] = w;\n    }\n    if (carry !== 0) {\n      this.words[i] = carry;\n      this.length++;\n    }\n    return this;\n  };\n\n  BN.prototype.isZero = function isZero () {\n    return this.length === 1 && this.words[0] === 0;\n  };\n\n  BN.prototype.cmpn = function cmpn (num) {\n    var negative = num < 0;\n\n    if (this.negative !== 0 && !negative) return -1;\n    if (this.negative === 0 && negative) return 1;\n\n    this._strip();\n\n    var res;\n    if (this.length > 1) {\n      res = 1;\n    } else {\n      if (negative) {\n        num = -num;\n      }\n\n      assert(num <= 0x3ffffff, 'Number is too big');\n\n      var w = this.words[0] | 0;\n      res = w === num ? 0 : w < num ? -1 : 1;\n    }\n    if (this.negative !== 0) return -res | 0;\n    return res;\n  };\n\n  // Compare two numbers and return:\n  // 1 - if `this` > `num`\n  // 0 - if `this` == `num`\n  // -1 - if `this` < `num`\n  BN.prototype.cmp = function cmp (num) {\n    if (this.negative !== 0 && num.negative === 0) return -1;\n    if (this.negative === 0 && num.negative !== 0) return 1;\n\n    var res = this.ucmp(num);\n    if (this.negative !== 0) return -res | 0;\n    return res;\n  };\n\n  // Unsigned comparison\n  BN.prototype.ucmp = function ucmp (num) {\n    // At this point both numbers have the same sign\n    if (this.length > num.length) return 1;\n    if (this.length < num.length) return -1;\n\n    var res = 0;\n    for (var i = this.length - 1; i >= 0; i--) {\n      var a = this.words[i] | 0;\n      var b = num.words[i] | 0;\n\n      if (a === b) continue;\n      if (a < b) {\n        res = -1;\n      } else if (a > b) {\n        res = 1;\n      }\n      break;\n    }\n    return res;\n  };\n\n  BN.prototype.gtn = function gtn (num) {\n    return this.cmpn(num) === 1;\n  };\n\n  BN.prototype.gt = function gt (num) {\n    return this.cmp(num) === 1;\n  };\n\n  BN.prototype.gten = function gten (num) {\n    return this.cmpn(num) >= 0;\n  };\n\n  BN.prototype.gte = function gte (num) {\n    return this.cmp(num) >= 0;\n  };\n\n  BN.prototype.ltn = function ltn (num) {\n    return this.cmpn(num) === -1;\n  };\n\n  BN.prototype.lt = function lt (num) {\n    return this.cmp(num) === -1;\n  };\n\n  BN.prototype.lten = function lten (num) {\n    return this.cmpn(num) <= 0;\n  };\n\n  BN.prototype.lte = function lte (num) {\n    return this.cmp(num) <= 0;\n  };\n\n  BN.prototype.eqn = function eqn (num) {\n    return this.cmpn(num) === 0;\n  };\n\n  BN.prototype.eq = function eq (num) {\n    return this.cmp(num) === 0;\n  };\n\n  //\n  // A reduce context, could be using montgomery or something better, depending\n  // on the `m` itself.\n  //\n  BN.red = function red (num) {\n    return new Red(num);\n  };\n\n  BN.prototype.toRed = function toRed (ctx) {\n    assert(!this.red, 'Already a number in reduction context');\n    assert(this.negative === 0, 'red works only with positives');\n    return ctx.convertTo(this)._forceRed(ctx);\n  };\n\n  BN.prototype.fromRed = function fromRed () {\n    assert(this.red, 'fromRed works only with numbers in reduction context');\n    return this.red.convertFrom(this);\n  };\n\n  BN.prototype._forceRed = function _forceRed (ctx) {\n    this.red = ctx;\n    return this;\n  };\n\n  BN.prototype.forceRed = function forceRed (ctx) {\n    assert(!this.red, 'Already a number in reduction context');\n    return this._forceRed(ctx);\n  };\n\n  BN.prototype.redAdd = function redAdd (num) {\n    assert(this.red, 'redAdd works only with red numbers');\n    return this.red.add(this, num);\n  };\n\n  BN.prototype.redIAdd = function redIAdd (num) {\n    assert(this.red, 'redIAdd works only with red numbers');\n    return this.red.iadd(this, num);\n  };\n\n  BN.prototype.redSub = function redSub (num) {\n    assert(this.red, 'redSub works only with red numbers');\n    return this.red.sub(this, num);\n  };\n\n  BN.prototype.redISub = function redISub (num) {\n    assert(this.red, 'redISub works only with red numbers');\n    return this.red.isub(this, num);\n  };\n\n  BN.prototype.redShl = function redShl (num) {\n    assert(this.red, 'redShl works only with red numbers');\n    return this.red.shl(this, num);\n  };\n\n  BN.prototype.redMul = function redMul (num) {\n    assert(this.red, 'redMul works only with red numbers');\n    this.red._verify2(this, num);\n    return this.red.mul(this, num);\n  };\n\n  BN.prototype.redIMul = function redIMul (num) {\n    assert(this.red, 'redMul works only with red numbers');\n    this.red._verify2(this, num);\n    return this.red.imul(this, num);\n  };\n\n  BN.prototype.redSqr = function redSqr () {\n    assert(this.red, 'redSqr works only with red numbers');\n    this.red._verify1(this);\n    return this.red.sqr(this);\n  };\n\n  BN.prototype.redISqr = function redISqr () {\n    assert(this.red, 'redISqr works only with red numbers');\n    this.red._verify1(this);\n    return this.red.isqr(this);\n  };\n\n  // Square root over p\n  BN.prototype.redSqrt = function redSqrt () {\n    assert(this.red, 'redSqrt works only with red numbers');\n    this.red._verify1(this);\n    return this.red.sqrt(this);\n  };\n\n  BN.prototype.redInvm = function redInvm () {\n    assert(this.red, 'redInvm works only with red numbers');\n    this.red._verify1(this);\n    return this.red.invm(this);\n  };\n\n  // Return negative clone of `this` % `red modulo`\n  BN.prototype.redNeg = function redNeg () {\n    assert(this.red, 'redNeg works only with red numbers');\n    this.red._verify1(this);\n    return this.red.neg(this);\n  };\n\n  BN.prototype.redPow = function redPow (num) {\n    assert(this.red && !num.red, 'redPow(normalNum)');\n    this.red._verify1(this);\n    return this.red.pow(this, num);\n  };\n\n  // Prime numbers with efficient reduction\n  var primes = {\n    k256: null,\n    p224: null,\n    p192: null,\n    p25519: null\n  };\n\n  // Pseudo-Mersenne prime\n  function MPrime (name, p) {\n    // P = 2 ^ N - K\n    this.name = name;\n    this.p = new BN(p, 16);\n    this.n = this.p.bitLength();\n    this.k = new BN(1).iushln(this.n).isub(this.p);\n\n    this.tmp = this._tmp();\n  }\n\n  MPrime.prototype._tmp = function _tmp () {\n    var tmp = new BN(null);\n    tmp.words = new Array(Math.ceil(this.n / 13));\n    return tmp;\n  };\n\n  MPrime.prototype.ireduce = function ireduce (num) {\n    // Assumes that `num` is less than `P^2`\n    // num = HI * (2 ^ N - K) + HI * K + LO = HI * K + LO (mod P)\n    var r = num;\n    var rlen;\n\n    do {\n      this.split(r, this.tmp);\n      r = this.imulK(r);\n      r = r.iadd(this.tmp);\n      rlen = r.bitLength();\n    } while (rlen > this.n);\n\n    var cmp = rlen < this.n ? -1 : r.ucmp(this.p);\n    if (cmp === 0) {\n      r.words[0] = 0;\n      r.length = 1;\n    } else if (cmp > 0) {\n      r.isub(this.p);\n    } else {\n      if (r.strip !== undefined) {\n        // r is a BN v4 instance\n        r.strip();\n      } else {\n        // r is a BN v5 instance\n        r._strip();\n      }\n    }\n\n    return r;\n  };\n\n  MPrime.prototype.split = function split (input, out) {\n    input.iushrn(this.n, 0, out);\n  };\n\n  MPrime.prototype.imulK = function imulK (num) {\n    return num.imul(this.k);\n  };\n\n  function K256 () {\n    MPrime.call(\n      this,\n      'k256',\n      'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f');\n  }\n  inherits(K256, MPrime);\n\n  K256.prototype.split = function split (input, output) {\n    // 256 = 9 * 26 + 22\n    var mask = 0x3fffff;\n\n    var outLen = Math.min(input.length, 9);\n    for (var i = 0; i < outLen; i++) {\n      output.words[i] = input.words[i];\n    }\n    output.length = outLen;\n\n    if (input.length <= 9) {\n      input.words[0] = 0;\n      input.length = 1;\n      return;\n    }\n\n    // Shift by 9 limbs\n    var prev = input.words[9];\n    output.words[output.length++] = prev & mask;\n\n    for (i = 10; i < input.length; i++) {\n      var next = input.words[i] | 0;\n      input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22);\n      prev = next;\n    }\n    prev >>>= 22;\n    input.words[i - 10] = prev;\n    if (prev === 0 && input.length > 10) {\n      input.length -= 10;\n    } else {\n      input.length -= 9;\n    }\n  };\n\n  K256.prototype.imulK = function imulK (num) {\n    // K = 0x1000003d1 = [ 0x40, 0x3d1 ]\n    num.words[num.length] = 0;\n    num.words[num.length + 1] = 0;\n    num.length += 2;\n\n    // bounded at: 0x40 * 0x3ffffff + 0x3d0 = 0x100000390\n    var lo = 0;\n    for (var i = 0; i < num.length; i++) {\n      var w = num.words[i] | 0;\n      lo += w * 0x3d1;\n      num.words[i] = lo & 0x3ffffff;\n      lo = w * 0x40 + ((lo / 0x4000000) | 0);\n    }\n\n    // Fast length reduction\n    if (num.words[num.length - 1] === 0) {\n      num.length--;\n      if (num.words[num.length - 1] === 0) {\n        num.length--;\n      }\n    }\n    return num;\n  };\n\n  function P224 () {\n    MPrime.call(\n      this,\n      'p224',\n      'ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001');\n  }\n  inherits(P224, MPrime);\n\n  function P192 () {\n    MPrime.call(\n      this,\n      'p192',\n      'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff');\n  }\n  inherits(P192, MPrime);\n\n  function P25519 () {\n    // 2 ^ 255 - 19\n    MPrime.call(\n      this,\n      '25519',\n      '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed');\n  }\n  inherits(P25519, MPrime);\n\n  P25519.prototype.imulK = function imulK (num) {\n    // K = 0x13\n    var carry = 0;\n    for (var i = 0; i < num.length; i++) {\n      var hi = (num.words[i] | 0) * 0x13 + carry;\n      var lo = hi & 0x3ffffff;\n      hi >>>= 26;\n\n      num.words[i] = lo;\n      carry = hi;\n    }\n    if (carry !== 0) {\n      num.words[num.length++] = carry;\n    }\n    return num;\n  };\n\n  // Exported mostly for testing purposes, use plain name instead\n  BN._prime = function prime (name) {\n    // Cached version of prime\n    if (primes[name]) return primes[name];\n\n    var prime;\n    if (name === 'k256') {\n      prime = new K256();\n    } else if (name === 'p224') {\n      prime = new P224();\n    } else if (name === 'p192') {\n      prime = new P192();\n    } else if (name === 'p25519') {\n      prime = new P25519();\n    } else {\n      throw new Error('Unknown prime ' + name);\n    }\n    primes[name] = prime;\n\n    return prime;\n  };\n\n  //\n  // Base reduction engine\n  //\n  function Red (m) {\n    if (typeof m === 'string') {\n      var prime = BN._prime(m);\n      this.m = prime.p;\n      this.prime = prime;\n    } else {\n      assert(m.gtn(1), 'modulus must be greater than 1');\n      this.m = m;\n      this.prime = null;\n    }\n  }\n\n  Red.prototype._verify1 = function _verify1 (a) {\n    assert(a.negative === 0, 'red works only with positives');\n    assert(a.red, 'red works only with red numbers');\n  };\n\n  Red.prototype._verify2 = function _verify2 (a, b) {\n    assert((a.negative | b.negative) === 0, 'red works only with positives');\n    assert(a.red && a.red === b.red,\n      'red works only with red numbers');\n  };\n\n  Red.prototype.imod = function imod (a) {\n    if (this.prime) return this.prime.ireduce(a)._forceRed(this);\n\n    move(a, a.umod(this.m)._forceRed(this));\n    return a;\n  };\n\n  Red.prototype.neg = function neg (a) {\n    if (a.isZero()) {\n      return a.clone();\n    }\n\n    return this.m.sub(a)._forceRed(this);\n  };\n\n  Red.prototype.add = function add (a, b) {\n    this._verify2(a, b);\n\n    var res = a.add(b);\n    if (res.cmp(this.m) >= 0) {\n      res.isub(this.m);\n    }\n    return res._forceRed(this);\n  };\n\n  Red.prototype.iadd = function iadd (a, b) {\n    this._verify2(a, b);\n\n    var res = a.iadd(b);\n    if (res.cmp(this.m) >= 0) {\n      res.isub(this.m);\n    }\n    return res;\n  };\n\n  Red.prototype.sub = function sub (a, b) {\n    this._verify2(a, b);\n\n    var res = a.sub(b);\n    if (res.cmpn(0) < 0) {\n      res.iadd(this.m);\n    }\n    return res._forceRed(this);\n  };\n\n  Red.prototype.isub = function isub (a, b) {\n    this._verify2(a, b);\n\n    var res = a.isub(b);\n    if (res.cmpn(0) < 0) {\n      res.iadd(this.m);\n    }\n    return res;\n  };\n\n  Red.prototype.shl = function shl (a, num) {\n    this._verify1(a);\n    return this.imod(a.ushln(num));\n  };\n\n  Red.prototype.imul = function imul (a, b) {\n    this._verify2(a, b);\n    return this.imod(a.imul(b));\n  };\n\n  Red.prototype.mul = function mul (a, b) {\n    this._verify2(a, b);\n    return this.imod(a.mul(b));\n  };\n\n  Red.prototype.isqr = function isqr (a) {\n    return this.imul(a, a.clone());\n  };\n\n  Red.prototype.sqr = function sqr (a) {\n    return this.mul(a, a);\n  };\n\n  Red.prototype.sqrt = function sqrt (a) {\n    if (a.isZero()) return a.clone();\n\n    var mod3 = this.m.andln(3);\n    assert(mod3 % 2 === 1);\n\n    // Fast case\n    if (mod3 === 3) {\n      var pow = this.m.add(new BN(1)).iushrn(2);\n      return this.pow(a, pow);\n    }\n\n    // Tonelli-Shanks algorithm (Totally unoptimized and slow)\n    //\n    // Find Q and S, that Q * 2 ^ S = (P - 1)\n    var q = this.m.subn(1);\n    var s = 0;\n    while (!q.isZero() && q.andln(1) === 0) {\n      s++;\n      q.iushrn(1);\n    }\n    assert(!q.isZero());\n\n    var one = new BN(1).toRed(this);\n    var nOne = one.redNeg();\n\n    // Find quadratic non-residue\n    // NOTE: Max is such because of generalized Riemann hypothesis.\n    var lpow = this.m.subn(1).iushrn(1);\n    var z = this.m.bitLength();\n    z = new BN(2 * z * z).toRed(this);\n\n    while (this.pow(z, lpow).cmp(nOne) !== 0) {\n      z.redIAdd(nOne);\n    }\n\n    var c = this.pow(z, q);\n    var r = this.pow(a, q.addn(1).iushrn(1));\n    var t = this.pow(a, q);\n    var m = s;\n    while (t.cmp(one) !== 0) {\n      var tmp = t;\n      for (var i = 0; tmp.cmp(one) !== 0; i++) {\n        tmp = tmp.redSqr();\n      }\n      assert(i < m);\n      var b = this.pow(c, new BN(1).iushln(m - i - 1));\n\n      r = r.redMul(b);\n      c = b.redSqr();\n      t = t.redMul(c);\n      m = i;\n    }\n\n    return r;\n  };\n\n  Red.prototype.invm = function invm (a) {\n    var inv = a._invmp(this.m);\n    if (inv.negative !== 0) {\n      inv.negative = 0;\n      return this.imod(inv).redNeg();\n    } else {\n      return this.imod(inv);\n    }\n  };\n\n  Red.prototype.pow = function pow (a, num) {\n    if (num.isZero()) return new BN(1).toRed(this);\n    if (num.cmpn(1) === 0) return a.clone();\n\n    var windowSize = 4;\n    var wnd = new Array(1 << windowSize);\n    wnd[0] = new BN(1).toRed(this);\n    wnd[1] = a;\n    for (var i = 2; i < wnd.length; i++) {\n      wnd[i] = this.mul(wnd[i - 1], a);\n    }\n\n    var res = wnd[0];\n    var current = 0;\n    var currentLen = 0;\n    var start = num.bitLength() % 26;\n    if (start === 0) {\n      start = 26;\n    }\n\n    for (i = num.length - 1; i >= 0; i--) {\n      var word = num.words[i];\n      for (var j = start - 1; j >= 0; j--) {\n        var bit = (word >> j) & 1;\n        if (res !== wnd[0]) {\n          res = this.sqr(res);\n        }\n\n        if (bit === 0 && current === 0) {\n          currentLen = 0;\n          continue;\n        }\n\n        current <<= 1;\n        current |= bit;\n        currentLen++;\n        if (currentLen !== windowSize && (i !== 0 || j !== 0)) continue;\n\n        res = this.mul(res, wnd[current]);\n        currentLen = 0;\n        current = 0;\n      }\n      start = 26;\n    }\n\n    return res;\n  };\n\n  Red.prototype.convertTo = function convertTo (num) {\n    var r = num.umod(this.m);\n\n    return r === num ? r.clone() : r;\n  };\n\n  Red.prototype.convertFrom = function convertFrom (num) {\n    var res = num.clone();\n    res.red = null;\n    return res;\n  };\n\n  //\n  // Montgomery method engine\n  //\n\n  BN.mont = function mont (num) {\n    return new Mont(num);\n  };\n\n  function Mont (m) {\n    Red.call(this, m);\n\n    this.shift = this.m.bitLength();\n    if (this.shift % 26 !== 0) {\n      this.shift += 26 - (this.shift % 26);\n    }\n\n    this.r = new BN(1).iushln(this.shift);\n    this.r2 = this.imod(this.r.sqr());\n    this.rinv = this.r._invmp(this.m);\n\n    this.minv = this.rinv.mul(this.r).isubn(1).div(this.m);\n    this.minv = this.minv.umod(this.r);\n    this.minv = this.r.sub(this.minv);\n  }\n  inherits(Mont, Red);\n\n  Mont.prototype.convertTo = function convertTo (num) {\n    return this.imod(num.ushln(this.shift));\n  };\n\n  Mont.prototype.convertFrom = function convertFrom (num) {\n    var r = this.imod(num.mul(this.rinv));\n    r.red = null;\n    return r;\n  };\n\n  Mont.prototype.imul = function imul (a, b) {\n    if (a.isZero() || b.isZero()) {\n      a.words[0] = 0;\n      a.length = 1;\n      return a;\n    }\n\n    var t = a.imul(b);\n    var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m);\n    var u = t.isub(c).iushrn(this.shift);\n    var res = u;\n\n    if (u.cmp(this.m) >= 0) {\n      res = u.isub(this.m);\n    } else if (u.cmpn(0) < 0) {\n      res = u.iadd(this.m);\n    }\n\n    return res._forceRed(this);\n  };\n\n  Mont.prototype.mul = function mul (a, b) {\n    if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this);\n\n    var t = a.mul(b);\n    var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m);\n    var u = t.isub(c).iushrn(this.shift);\n    var res = u;\n    if (u.cmp(this.m) >= 0) {\n      res = u.isub(this.m);\n    } else if (u.cmpn(0) < 0) {\n      res = u.iadd(this.m);\n    }\n\n    return res._forceRed(this);\n  };\n\n  Mont.prototype.invm = function invm (a) {\n    // (AR)^-1 * R^2 = (A^-1 * R^-1) * R^2 = A^-1 * R\n    var res = this.imod(a._invmp(this.m).mul(this.r2));\n    return res._forceRed(this);\n  };\n})(typeof module === 'undefined' || module, this);\n","export const AddressZero = \"0x0000000000000000000000000000000000000000\";\n//# sourceMappingURL=addresses.js.map","\"use strict\";\n/**\n *  BigNumber\n *\n *  A wrapper around the BN.js object. We use the BN.js library\n *  because it is used by elliptic, so it is required regardless.\n *\n */\nimport _BN from \"bn.js\";\nvar BN = _BN.BN;\nimport { hexlify, isBytes, isHexString } from \"@ethersproject/bytes\";\nimport { Logger } from \"@ethersproject/logger\";\nimport { version } from \"./_version\";\nconst logger = new Logger(version);\nconst _constructorGuard = {};\nconst MAX_SAFE = 0x1fffffffffffff;\nexport function isBigNumberish(value) {\n    return (value != null) && (BigNumber.isBigNumber(value) ||\n        (typeof (value) === \"number\" && (value % 1) === 0) ||\n        (typeof (value) === \"string\" && !!value.match(/^-?[0-9]+$/)) ||\n        isHexString(value) ||\n        (typeof (value) === \"bigint\") ||\n        isBytes(value));\n}\n// Only warn about passing 10 into radix once\nlet _warnedToStringRadix = false;\nexport class BigNumber {\n    constructor(constructorGuard, hex) {\n        if (constructorGuard !== _constructorGuard) {\n            logger.throwError(\"cannot call constructor directly; use BigNumber.from\", Logger.errors.UNSUPPORTED_OPERATION, {\n                operation: \"new (BigNumber)\"\n            });\n        }\n        this._hex = hex;\n        this._isBigNumber = true;\n        Object.freeze(this);\n    }\n    fromTwos(value) {\n        return toBigNumber(toBN(this).fromTwos(value));\n    }\n    toTwos(value) {\n        return toBigNumber(toBN(this).toTwos(value));\n    }\n    abs() {\n        if (this._hex[0] === \"-\") {\n            return BigNumber.from(this._hex.substring(1));\n        }\n        return this;\n    }\n    add(other) {\n        return toBigNumber(toBN(this).add(toBN(other)));\n    }\n    sub(other) {\n        return toBigNumber(toBN(this).sub(toBN(other)));\n    }\n    div(other) {\n        const o = BigNumber.from(other);\n        if (o.isZero()) {\n            throwFault(\"division-by-zero\", \"div\");\n        }\n        return toBigNumber(toBN(this).div(toBN(other)));\n    }\n    mul(other) {\n        return toBigNumber(toBN(this).mul(toBN(other)));\n    }\n    mod(other) {\n        const value = toBN(other);\n        if (value.isNeg()) {\n            throwFault(\"division-by-zero\", \"mod\");\n        }\n        return toBigNumber(toBN(this).umod(value));\n    }\n    pow(other) {\n        const value = toBN(other);\n        if (value.isNeg()) {\n            throwFault(\"negative-power\", \"pow\");\n        }\n        return toBigNumber(toBN(this).pow(value));\n    }\n    and(other) {\n        const value = toBN(other);\n        if (this.isNegative() || value.isNeg()) {\n            throwFault(\"unbound-bitwise-result\", \"and\");\n        }\n        return toBigNumber(toBN(this).and(value));\n    }\n    or(other) {\n        const value = toBN(other);\n        if (this.isNegative() || value.isNeg()) {\n            throwFault(\"unbound-bitwise-result\", \"or\");\n        }\n        return toBigNumber(toBN(this).or(value));\n    }\n    xor(other) {\n        const value = toBN(other);\n        if (this.isNegative() || value.isNeg()) {\n            throwFault(\"unbound-bitwise-result\", \"xor\");\n        }\n        return toBigNumber(toBN(this).xor(value));\n    }\n    mask(value) {\n        if (this.isNegative() || value < 0) {\n            throwFault(\"negative-width\", \"mask\");\n        }\n        return toBigNumber(toBN(this).maskn(value));\n    }\n    shl(value) {\n        if (this.isNegative() || value < 0) {\n            throwFault(\"negative-width\", \"shl\");\n        }\n        return toBigNumber(toBN(this).shln(value));\n    }\n    shr(value) {\n        if (this.isNegative() || value < 0) {\n            throwFault(\"negative-width\", \"shr\");\n        }\n        return toBigNumber(toBN(this).shrn(value));\n    }\n    eq(other) {\n        return toBN(this).eq(toBN(other));\n    }\n    lt(other) {\n        return toBN(this).lt(toBN(other));\n    }\n    lte(other) {\n        return toBN(this).lte(toBN(other));\n    }\n    gt(other) {\n        return toBN(this).gt(toBN(other));\n    }\n    gte(other) {\n        return toBN(this).gte(toBN(other));\n    }\n    isNegative() {\n        return (this._hex[0] === \"-\");\n    }\n    isZero() {\n        return toBN(this).isZero();\n    }\n    toNumber() {\n        try {\n            return toBN(this).toNumber();\n        }\n        catch (error) {\n            throwFault(\"overflow\", \"toNumber\", this.toString());\n        }\n        return null;\n    }\n    toBigInt() {\n        try {\n            return BigInt(this.toString());\n        }\n        catch (e) { }\n        return logger.throwError(\"this platform does not support BigInt\", Logger.errors.UNSUPPORTED_OPERATION, {\n            value: this.toString()\n        });\n    }\n    toString() {\n        // Lots of people expect this, which we do not support, so check (See: #889)\n        if (arguments.length > 0) {\n            if (arguments[0] === 10) {\n                if (!_warnedToStringRadix) {\n                    _warnedToStringRadix = true;\n                    logger.warn(\"BigNumber.toString does not accept any parameters; base-10 is assumed\");\n                }\n            }\n            else if (arguments[0] === 16) {\n                logger.throwError(\"BigNumber.toString does not accept any parameters; use bigNumber.toHexString()\", Logger.errors.UNEXPECTED_ARGUMENT, {});\n            }\n            else {\n                logger.throwError(\"BigNumber.toString does not accept parameters\", Logger.errors.UNEXPECTED_ARGUMENT, {});\n            }\n        }\n        return toBN(this).toString(10);\n    }\n    toHexString() {\n        return this._hex;\n    }\n    toJSON(key) {\n        return { type: \"BigNumber\", hex: this.toHexString() };\n    }\n    static from(value) {\n        if (value instanceof BigNumber) {\n            return value;\n        }\n        if (typeof (value) === \"string\") {\n            if (value.match(/^-?0x[0-9a-f]+$/i)) {\n                return new BigNumber(_constructorGuard, toHex(value));\n            }\n            if (value.match(/^-?[0-9]+$/)) {\n                return new BigNumber(_constructorGuard, toHex(new BN(value)));\n            }\n            return logger.throwArgumentError(\"invalid BigNumber string\", \"value\", value);\n        }\n        if (typeof (value) === \"number\") {\n            if (value % 1) {\n                throwFault(\"underflow\", \"BigNumber.from\", value);\n            }\n            if (value >= MAX_SAFE || value <= -MAX_SAFE) {\n                throwFault(\"overflow\", \"BigNumber.from\", value);\n            }\n            return BigNumber.from(String(value));\n        }\n        const anyValue = value;\n        if (typeof (anyValue) === \"bigint\") {\n            return BigNumber.from(anyValue.toString());\n        }\n        if (isBytes(anyValue)) {\n            return BigNumber.from(hexlify(anyValue));\n        }\n        if (anyValue) {\n            // Hexable interface (takes priority)\n            if (anyValue.toHexString) {\n                const hex = anyValue.toHexString();\n                if (typeof (hex) === \"string\") {\n                    return BigNumber.from(hex);\n                }\n            }\n            else {\n                // For now, handle legacy JSON-ified values (goes away in v6)\n                let hex = anyValue._hex;\n                // New-form JSON\n                if (hex == null && anyValue.type === \"BigNumber\") {\n                    hex = anyValue.hex;\n                }\n                if (typeof (hex) === \"string\") {\n                    if (isHexString(hex) || (hex[0] === \"-\" && isHexString(hex.substring(1)))) {\n                        return BigNumber.from(hex);\n                    }\n                }\n            }\n        }\n        return logger.throwArgumentError(\"invalid BigNumber value\", \"value\", value);\n    }\n    static isBigNumber(value) {\n        return !!(value && value._isBigNumber);\n    }\n}\n// Normalize the hex string\nfunction toHex(value) {\n    // For BN, call on the hex string\n    if (typeof (value) !== \"string\") {\n        return toHex(value.toString(16));\n    }\n    // If negative, prepend the negative sign to the normalized positive value\n    if (value[0] === \"-\") {\n        // Strip off the negative sign\n        value = value.substring(1);\n        // Cannot have multiple negative signs (e.g. \"--0x04\")\n        if (value[0] === \"-\") {\n            logger.throwArgumentError(\"invalid hex\", \"value\", value);\n        }\n        // Call toHex on the positive component\n        value = toHex(value);\n        // Do not allow \"-0x00\"\n        if (value === \"0x00\") {\n            return value;\n        }\n        // Negate the value\n        return \"-\" + value;\n    }\n    // Add a \"0x\" prefix if missing\n    if (value.substring(0, 2) !== \"0x\") {\n        value = \"0x\" + value;\n    }\n    // Normalize zero\n    if (value === \"0x\") {\n        return \"0x00\";\n    }\n    // Make the string even length\n    if (value.length % 2) {\n        value = \"0x0\" + value.substring(2);\n    }\n    // Trim to smallest even-length string\n    while (value.length > 4 && value.substring(0, 4) === \"0x00\") {\n        value = \"0x\" + value.substring(4);\n    }\n    return value;\n}\nfunction toBigNumber(value) {\n    return BigNumber.from(toHex(value));\n}\nfunction toBN(value) {\n    const hex = BigNumber.from(value).toHexString();\n    if (hex[0] === \"-\") {\n        return (new BN(\"-\" + hex.substring(3), 16));\n    }\n    return new BN(hex.substring(2), 16);\n}\nfunction throwFault(fault, operation, value) {\n    const params = { fault: fault, operation: operation };\n    if (value != null) {\n        params.value = value;\n    }\n    return logger.throwError(fault, Logger.errors.NUMERIC_FAULT, params);\n}\n// value should have no prefix\nexport function _base36To16(value) {\n    return (new BN(value, 36)).toString(16);\n}\n// value should have no prefix\nexport function _base16To36(value) {\n    return (new BN(value, 16)).toString(36);\n}\n//# sourceMappingURL=bignumber.js.map","\"use strict\";\nvar __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {\n    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n    return new (P || (P = Promise))(function (resolve, reject) {\n        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n        function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n        step((generator = generator.apply(thisArg, _arguments || [])).next());\n    });\n};\nimport { checkResultErrors, Indexed, Interface } from \"@ethersproject/abi\";\nimport { Provider } from \"@ethersproject/abstract-provider\";\nimport { Signer, VoidSigner } from \"@ethersproject/abstract-signer\";\nimport { getAddress, getContractAddress } from \"@ethersproject/address\";\nimport { BigNumber } from \"@ethersproject/bignumber\";\nimport { arrayify, concat, hexlify, isBytes, isHexString } from \"@ethersproject/bytes\";\nimport { defineReadOnly, deepCopy, getStatic, resolveProperties, shallowCopy } from \"@ethersproject/properties\";\nimport { accessListify } from \"@ethersproject/transactions\";\nimport { Logger } from \"@ethersproject/logger\";\nimport { version } from \"./_version\";\nconst logger = new Logger(version);\n;\n;\n///////////////////////////////\nconst allowedTransactionKeys = {\n    chainId: true, data: true, from: true, gasLimit: true, gasPrice: true, nonce: true, to: true, value: true,\n    type: true, accessList: true,\n    maxFeePerGas: true, maxPriorityFeePerGas: true,\n    customData: true,\n    ccipReadEnabled: true\n};\nfunction resolveName(resolver, nameOrPromise) {\n    return __awaiter(this, void 0, void 0, function* () {\n        const name = yield nameOrPromise;\n        if (typeof (name) !== \"string\") {\n            logger.throwArgumentError(\"invalid address or ENS name\", \"name\", name);\n        }\n        // If it is already an address, just use it (after adding checksum)\n        try {\n            return getAddress(name);\n        }\n        catch (error) { }\n        if (!resolver) {\n            logger.throwError(\"a provider or signer is needed to resolve ENS names\", Logger.errors.UNSUPPORTED_OPERATION, {\n                operation: \"resolveName\"\n            });\n        }\n        const address = yield resolver.resolveName(name);\n        if (address == null) {\n            logger.throwArgumentError(\"resolver or addr is not configured for ENS name\", \"name\", name);\n        }\n        return address;\n    });\n}\n// Recursively replaces ENS names with promises to resolve the name and resolves all properties\nfunction resolveAddresses(resolver, value, paramType) {\n    return __awaiter(this, void 0, void 0, function* () {\n        if (Array.isArray(paramType)) {\n            return yield Promise.all(paramType.map((paramType, index) => {\n                return resolveAddresses(resolver, ((Array.isArray(value)) ? value[index] : value[paramType.name]), paramType);\n            }));\n        }\n        if (paramType.type === \"address\") {\n            return yield resolveName(resolver, value);\n        }\n        if (paramType.type === \"tuple\") {\n            return yield resolveAddresses(resolver, value, paramType.components);\n        }\n        if (paramType.baseType === \"array\") {\n            if (!Array.isArray(value)) {\n                return Promise.reject(logger.makeError(\"invalid value for array\", Logger.errors.INVALID_ARGUMENT, {\n                    argument: \"value\",\n                    value\n                }));\n            }\n            return yield Promise.all(value.map((v) => resolveAddresses(resolver, v, paramType.arrayChildren)));\n        }\n        return value;\n    });\n}\nfunction populateTransaction(contract, fragment, args) {\n    return __awaiter(this, void 0, void 0, function* () {\n        // If an extra argument is given, it is overrides\n        let overrides = {};\n        if (args.length === fragment.inputs.length + 1 && typeof (args[args.length - 1]) === \"object\") {\n            overrides = shallowCopy(args.pop());\n        }\n        // Make sure the parameter count matches\n        logger.checkArgumentCount(args.length, fragment.inputs.length, \"passed to contract\");\n        // Populate \"from\" override (allow promises)\n        if (contract.signer) {\n            if (overrides.from) {\n                // Contracts with a Signer are from the Signer's frame-of-reference;\n                // but we allow overriding \"from\" if it matches the signer\n                overrides.from = resolveProperties({\n                    override: resolveName(contract.signer, overrides.from),\n                    signer: contract.signer.getAddress()\n                }).then((check) => __awaiter(this, void 0, void 0, function* () {\n                    if (getAddress(check.signer) !== check.override) {\n                        logger.throwError(\"Contract with a Signer cannot override from\", Logger.errors.UNSUPPORTED_OPERATION, {\n                            operation: \"overrides.from\"\n                        });\n                    }\n                    return check.override;\n                }));\n            }\n            else {\n                overrides.from = contract.signer.getAddress();\n            }\n        }\n        else if (overrides.from) {\n            overrides.from = resolveName(contract.provider, overrides.from);\n            //} else {\n            // Contracts without a signer can override \"from\", and if\n            // unspecified the zero address is used\n            //overrides.from = AddressZero;\n        }\n        // Wait for all dependencies to be resolved (prefer the signer over the provider)\n        const resolved = yield resolveProperties({\n            args: resolveAddresses(contract.signer || contract.provider, args, fragment.inputs),\n            address: contract.resolvedAddress,\n            overrides: (resolveProperties(overrides) || {})\n        });\n        // The ABI coded transaction\n        const data = contract.interface.encodeFunctionData(fragment, resolved.args);\n        const tx = {\n            data: data,\n            to: resolved.address\n        };\n        // Resolved Overrides\n        const ro = resolved.overrides;\n        // Populate simple overrides\n        if (ro.nonce != null) {\n            tx.nonce = BigNumber.from(ro.nonce).toNumber();\n        }\n        if (ro.gasLimit != null) {\n            tx.gasLimit = BigNumber.from(ro.gasLimit);\n        }\n        if (ro.gasPrice != null) {\n            tx.gasPrice = BigNumber.from(ro.gasPrice);\n        }\n        if (ro.maxFeePerGas != null) {\n            tx.maxFeePerGas = BigNumber.from(ro.maxFeePerGas);\n        }\n        if (ro.maxPriorityFeePerGas != null) {\n            tx.maxPriorityFeePerGas = BigNumber.from(ro.maxPriorityFeePerGas);\n        }\n        if (ro.from != null) {\n            tx.from = ro.from;\n        }\n        if (ro.type != null) {\n            tx.type = ro.type;\n        }\n        if (ro.accessList != null) {\n            tx.accessList = accessListify(ro.accessList);\n        }\n        // If there was no \"gasLimit\" override, but the ABI specifies a default, use it\n        if (tx.gasLimit == null && fragment.gas != null) {\n            // Compute the intrinsic gas cost for this transaction\n            // @TODO: This is based on the yellow paper as of Petersburg; this is something\n            // we may wish to parameterize in v6 as part of the Network object. Since this\n            // is always a non-nil to address, we can ignore G_create, but may wish to add\n            // similar logic to the ContractFactory.\n            let intrinsic = 21000;\n            const bytes = arrayify(data);\n            for (let i = 0; i < bytes.length; i++) {\n                intrinsic += 4;\n                if (bytes[i]) {\n                    intrinsic += 64;\n                }\n            }\n            tx.gasLimit = BigNumber.from(fragment.gas).add(intrinsic);\n        }\n        // Populate \"value\" override\n        if (ro.value) {\n            const roValue = BigNumber.from(ro.value);\n            if (!roValue.isZero() && !fragment.payable) {\n                logger.throwError(\"non-payable method cannot override value\", Logger.errors.UNSUPPORTED_OPERATION, {\n                    operation: \"overrides.value\",\n                    value: overrides.value\n                });\n            }\n            tx.value = roValue;\n        }\n        if (ro.customData) {\n            tx.customData = shallowCopy(ro.customData);\n        }\n        if (ro.ccipReadEnabled) {\n            tx.ccipReadEnabled = !!ro.ccipReadEnabled;\n        }\n        // Remove the overrides\n        delete overrides.nonce;\n        delete overrides.gasLimit;\n        delete overrides.gasPrice;\n        delete overrides.from;\n        delete overrides.value;\n        delete overrides.type;\n        delete overrides.accessList;\n        delete overrides.maxFeePerGas;\n        delete overrides.maxPriorityFeePerGas;\n        delete overrides.customData;\n        delete overrides.ccipReadEnabled;\n        // Make sure there are no stray overrides, which may indicate a\n        // typo or using an unsupported key.\n        const leftovers = Object.keys(overrides).filter((key) => (overrides[key] != null));\n        if (leftovers.length) {\n            logger.throwError(`cannot override ${leftovers.map((l) => JSON.stringify(l)).join(\",\")}`, Logger.errors.UNSUPPORTED_OPERATION, {\n                operation: \"overrides\",\n                overrides: leftovers\n            });\n        }\n        return tx;\n    });\n}\nfunction buildPopulate(contract, fragment) {\n    return function (...args) {\n        return populateTransaction(contract, fragment, args);\n    };\n}\nfunction buildEstimate(contract, fragment) {\n    const signerOrProvider = (contract.signer || contract.provider);\n    return function (...args) {\n        return __awaiter(this, void 0, void 0, function* () {\n            if (!signerOrProvider) {\n                logger.throwError(\"estimate require a provider or signer\", Logger.errors.UNSUPPORTED_OPERATION, {\n                    operation: \"estimateGas\"\n                });\n            }\n            const tx = yield populateTransaction(contract, fragment, args);\n            return yield signerOrProvider.estimateGas(tx);\n        });\n    };\n}\nfunction addContractWait(contract, tx) {\n    const wait = tx.wait.bind(tx);\n    tx.wait = (confirmations) => {\n        return wait(confirmations).then((receipt) => {\n            receipt.events = receipt.logs.map((log) => {\n                let event = deepCopy(log);\n                let parsed = null;\n                try {\n                    parsed = contract.interface.parseLog(log);\n                }\n                catch (e) { }\n                // Successfully parsed the event log; include it\n                if (parsed) {\n                    event.args = parsed.args;\n                    event.decode = (data, topics) => {\n                        return contract.interface.decodeEventLog(parsed.eventFragment, data, topics);\n                    };\n                    event.event = parsed.name;\n                    event.eventSignature = parsed.signature;\n                }\n                // Useful operations\n                event.removeListener = () => { return contract.provider; };\n                event.getBlock = () => {\n                    return contract.provider.getBlock(receipt.blockHash);\n                };\n                event.getTransaction = () => {\n                    return contract.provider.getTransaction(receipt.transactionHash);\n                };\n                event.getTransactionReceipt = () => {\n                    return Promise.resolve(receipt);\n                };\n                return event;\n            });\n            return receipt;\n        });\n    };\n}\nfunction buildCall(contract, fragment, collapseSimple) {\n    const signerOrProvider = (contract.signer || contract.provider);\n    return function (...args) {\n        return __awaiter(this, void 0, void 0, function* () {\n            // Extract the \"blockTag\" override if present\n            let blockTag = undefined;\n            if (args.length === fragment.inputs.length + 1 && typeof (args[args.length - 1]) === \"object\") {\n                const overrides = shallowCopy(args.pop());\n                if (overrides.blockTag != null) {\n                    blockTag = yield overrides.blockTag;\n                }\n                delete overrides.blockTag;\n                args.push(overrides);\n            }\n            // If the contract was just deployed, wait until it is mined\n            if (contract.deployTransaction != null) {\n                yield contract._deployed(blockTag);\n            }\n            // Call a node and get the result\n            const tx = yield populateTransaction(contract, fragment, args);\n            const result = yield signerOrProvider.call(tx, blockTag);\n            try {\n                let value = contract.interface.decodeFunctionResult(fragment, result);\n                if (collapseSimple && fragment.outputs.length === 1) {\n                    value = value[0];\n                }\n                return value;\n            }\n            catch (error) {\n                if (error.code === Logger.errors.CALL_EXCEPTION) {\n                    error.address = contract.address;\n                    error.args = args;\n                    error.transaction = tx;\n                }\n                throw error;\n            }\n        });\n    };\n}\nfunction buildSend(contract, fragment) {\n    return function (...args) {\n        return __awaiter(this, void 0, void 0, function* () {\n            if (!contract.signer) {\n                logger.throwError(\"sending a transaction requires a signer\", Logger.errors.UNSUPPORTED_OPERATION, {\n                    operation: \"sendTransaction\"\n                });\n            }\n            // If the contract was just deployed, wait until it is mined\n            if (contract.deployTransaction != null) {\n                yield contract._deployed();\n            }\n            const txRequest = yield populateTransaction(contract, fragment, args);\n            const tx = yield contract.signer.sendTransaction(txRequest);\n            // Tweak the tx.wait so the receipt has extra properties\n            addContractWait(contract, tx);\n            return tx;\n        });\n    };\n}\nfunction buildDefault(contract, fragment, collapseSimple) {\n    if (fragment.constant) {\n        return buildCall(contract, fragment, collapseSimple);\n    }\n    return buildSend(contract, fragment);\n}\nfunction getEventTag(filter) {\n    if (filter.address && (filter.topics == null || filter.topics.length === 0)) {\n        return \"*\";\n    }\n    return (filter.address || \"*\") + \"@\" + (filter.topics ? filter.topics.map((topic) => {\n        if (Array.isArray(topic)) {\n            return topic.join(\"|\");\n        }\n        return topic;\n    }).join(\":\") : \"\");\n}\nclass RunningEvent {\n    constructor(tag, filter) {\n        defineReadOnly(this, \"tag\", tag);\n        defineReadOnly(this, \"filter\", filter);\n        this._listeners = [];\n    }\n    addListener(listener, once) {\n        this._listeners.push({ listener: listener, once: once });\n    }\n    removeListener(listener) {\n        let done = false;\n        this._listeners = this._listeners.filter((item) => {\n            if (done || item.listener !== listener) {\n                return true;\n            }\n            done = true;\n            return false;\n        });\n    }\n    removeAllListeners() {\n        this._listeners = [];\n    }\n    listeners() {\n        return this._listeners.map((i) => i.listener);\n    }\n    listenerCount() {\n        return this._listeners.length;\n    }\n    run(args) {\n        const listenerCount = this.listenerCount();\n        this._listeners = this._listeners.filter((item) => {\n            const argsCopy = args.slice();\n            // Call the callback in the next event loop\n            setTimeout(() => {\n                item.listener.apply(this, argsCopy);\n            }, 0);\n            // Reschedule it if it not \"once\"\n            return !(item.once);\n        });\n        return listenerCount;\n    }\n    prepareEvent(event) {\n    }\n    // Returns the array that will be applied to an emit\n    getEmit(event) {\n        return [event];\n    }\n}\nclass ErrorRunningEvent extends RunningEvent {\n    constructor() {\n        super(\"error\", null);\n    }\n}\n// @TODO Fragment should inherit Wildcard? and just override getEmit?\n//       or have a common abstract super class, with enough constructor\n//       options to configure both.\n// A Fragment Event will populate all the properties that Wildcard\n// will, and additionally dereference the arguments when emitting\nclass FragmentRunningEvent extends RunningEvent {\n    constructor(address, contractInterface, fragment, topics) {\n        const filter = {\n            address: address\n        };\n        let topic = contractInterface.getEventTopic(fragment);\n        if (topics) {\n            if (topic !== topics[0]) {\n                logger.throwArgumentError(\"topic mismatch\", \"topics\", topics);\n            }\n            filter.topics = topics.slice();\n        }\n        else {\n            filter.topics = [topic];\n        }\n        super(getEventTag(filter), filter);\n        defineReadOnly(this, \"address\", address);\n        defineReadOnly(this, \"interface\", contractInterface);\n        defineReadOnly(this, \"fragment\", fragment);\n    }\n    prepareEvent(event) {\n        super.prepareEvent(event);\n        event.event = this.fragment.name;\n        event.eventSignature = this.fragment.format();\n        event.decode = (data, topics) => {\n            return this.interface.decodeEventLog(this.fragment, data, topics);\n        };\n        try {\n            event.args = this.interface.decodeEventLog(this.fragment, event.data, event.topics);\n        }\n        catch (error) {\n            event.args = null;\n            event.decodeError = error;\n        }\n    }\n    getEmit(event) {\n        const errors = checkResultErrors(event.args);\n        if (errors.length) {\n            throw errors[0].error;\n        }\n        const args = (event.args || []).slice();\n        args.push(event);\n        return args;\n    }\n}\n// A Wildcard Event will attempt to populate:\n//  - event            The name of the event name\n//  - eventSignature   The full signature of the event\n//  - decode           A function to decode data and topics\n//  - args             The decoded data and topics\nclass WildcardRunningEvent extends RunningEvent {\n    constructor(address, contractInterface) {\n        super(\"*\", { address: address });\n        defineReadOnly(this, \"address\", address);\n        defineReadOnly(this, \"interface\", contractInterface);\n    }\n    prepareEvent(event) {\n        super.prepareEvent(event);\n        try {\n            const parsed = this.interface.parseLog(event);\n            event.event = parsed.name;\n            event.eventSignature = parsed.signature;\n            event.decode = (data, topics) => {\n                return this.interface.decodeEventLog(parsed.eventFragment, data, topics);\n            };\n            event.args = parsed.args;\n        }\n        catch (error) {\n            // No matching event\n        }\n    }\n}\nexport class BaseContract {\n    constructor(addressOrName, contractInterface, signerOrProvider) {\n        // @TODO: Maybe still check the addressOrName looks like a valid address or name?\n        //address = getAddress(address);\n        defineReadOnly(this, \"interface\", getStatic(new.target, \"getInterface\")(contractInterface));\n        if (signerOrProvider == null) {\n            defineReadOnly(this, \"provider\", null);\n            defineReadOnly(this, \"signer\", null);\n        }\n        else if (Signer.isSigner(signerOrProvider)) {\n            defineReadOnly(this, \"provider\", signerOrProvider.provider || null);\n            defineReadOnly(this, \"signer\", signerOrProvider);\n        }\n        else if (Provider.isProvider(signerOrProvider)) {\n            defineReadOnly(this, \"provider\", signerOrProvider);\n            defineReadOnly(this, \"signer\", null);\n        }\n        else {\n            logger.throwArgumentError(\"invalid signer or provider\", \"signerOrProvider\", signerOrProvider);\n        }\n        defineReadOnly(this, \"callStatic\", {});\n        defineReadOnly(this, \"estimateGas\", {});\n        defineReadOnly(this, \"functions\", {});\n        defineReadOnly(this, \"populateTransaction\", {});\n        defineReadOnly(this, \"filters\", {});\n        {\n            const uniqueFilters = {};\n            Object.keys(this.interface.events).forEach((eventSignature) => {\n                const event = this.interface.events[eventSignature];\n                defineReadOnly(this.filters, eventSignature, (...args) => {\n                    return {\n                        address: this.address,\n                        topics: this.interface.encodeFilterTopics(event, args)\n                    };\n                });\n                if (!uniqueFilters[event.name]) {\n                    uniqueFilters[event.name] = [];\n                }\n                uniqueFilters[event.name].push(eventSignature);\n            });\n            Object.keys(uniqueFilters).forEach((name) => {\n                const filters = uniqueFilters[name];\n                if (filters.length === 1) {\n                    defineReadOnly(this.filters, name, this.filters[filters[0]]);\n                }\n                else {\n                    logger.warn(`Duplicate definition of ${name} (${filters.join(\", \")})`);\n                }\n            });\n        }\n        defineReadOnly(this, \"_runningEvents\", {});\n        defineReadOnly(this, \"_wrappedEmits\", {});\n        if (addressOrName == null) {\n            logger.throwArgumentError(\"invalid contract address or ENS name\", \"addressOrName\", addressOrName);\n        }\n        defineReadOnly(this, \"address\", addressOrName);\n        if (this.provider) {\n            defineReadOnly(this, \"resolvedAddress\", resolveName(this.provider, addressOrName));\n        }\n        else {\n            try {\n                defineReadOnly(this, \"resolvedAddress\", Promise.resolve(getAddress(addressOrName)));\n            }\n            catch (error) {\n                // Without a provider, we cannot use ENS names\n                logger.throwError(\"provider is required to use ENS name as contract address\", Logger.errors.UNSUPPORTED_OPERATION, {\n                    operation: \"new Contract\"\n                });\n            }\n        }\n        // Swallow bad ENS names to prevent Unhandled Exceptions\n        this.resolvedAddress.catch((e) => { });\n        const uniqueNames = {};\n        const uniqueSignatures = {};\n        Object.keys(this.interface.functions).forEach((signature) => {\n            const fragment = this.interface.functions[signature];\n            // Check that the signature is unique; if not the ABI generation has\n            // not been cleaned or may be incorrectly generated\n            if (uniqueSignatures[signature]) {\n                logger.warn(`Duplicate ABI entry for ${JSON.stringify(signature)}`);\n                return;\n            }\n            uniqueSignatures[signature] = true;\n            // Track unique names; we only expose bare named functions if they\n            // are ambiguous\n            {\n                const name = fragment.name;\n                if (!uniqueNames[`%${name}`]) {\n                    uniqueNames[`%${name}`] = [];\n                }\n                uniqueNames[`%${name}`].push(signature);\n            }\n            if (this[signature] == null) {\n                defineReadOnly(this, signature, buildDefault(this, fragment, true));\n            }\n            // We do not collapse simple calls on this bucket, which allows\n            // frameworks to safely use this without introspection as well as\n            // allows decoding error recovery.\n            if (this.functions[signature] == null) {\n                defineReadOnly(this.functions, signature, buildDefault(this, fragment, false));\n            }\n            if (this.callStatic[signature] == null) {\n                defineReadOnly(this.callStatic, signature, buildCall(this, fragment, true));\n            }\n            if (this.populateTransaction[signature] == null) {\n                defineReadOnly(this.populateTransaction, signature, buildPopulate(this, fragment));\n            }\n            if (this.estimateGas[signature] == null) {\n                defineReadOnly(this.estimateGas, signature, buildEstimate(this, fragment));\n            }\n        });\n        Object.keys(uniqueNames).forEach((name) => {\n            // Ambiguous names to not get attached as bare names\n            const signatures = uniqueNames[name];\n            if (signatures.length > 1) {\n                return;\n            }\n            // Strip off the leading \"%\" used for prototype protection\n            name = name.substring(1);\n            const signature = signatures[0];\n            // If overwriting a member property that is null, swallow the error\n            try {\n                if (this[name] == null) {\n                    defineReadOnly(this, name, this[signature]);\n                }\n            }\n            catch (e) { }\n            if (this.functions[name] == null) {\n                defineReadOnly(this.functions, name, this.functions[signature]);\n            }\n            if (this.callStatic[name] == null) {\n                defineReadOnly(this.callStatic, name, this.callStatic[signature]);\n            }\n            if (this.populateTransaction[name] == null) {\n                defineReadOnly(this.populateTransaction, name, this.populateTransaction[signature]);\n            }\n            if (this.estimateGas[name] == null) {\n                defineReadOnly(this.estimateGas, name, this.estimateGas[signature]);\n            }\n        });\n    }\n    static getContractAddress(transaction) {\n        return getContractAddress(transaction);\n    }\n    static getInterface(contractInterface) {\n        if (Interface.isInterface(contractInterface)) {\n            return contractInterface;\n        }\n        return new Interface(contractInterface);\n    }\n    // @TODO: Allow timeout?\n    deployed() {\n        return this._deployed();\n    }\n    _deployed(blockTag) {\n        if (!this._deployedPromise) {\n            // If we were just deployed, we know the transaction we should occur in\n            if (this.deployTransaction) {\n                this._deployedPromise = this.deployTransaction.wait().then(() => {\n                    return this;\n                });\n            }\n            else {\n                // @TODO: Once we allow a timeout to be passed in, we will wait\n                // up to that many blocks for getCode\n                // Otherwise, poll for our code to be deployed\n                this._deployedPromise = this.provider.getCode(this.address, blockTag).then((code) => {\n                    if (code === \"0x\") {\n                        logger.throwError(\"contract not deployed\", Logger.errors.UNSUPPORTED_OPERATION, {\n                            contractAddress: this.address,\n                            operation: \"getDeployed\"\n                        });\n                    }\n                    return this;\n                });\n            }\n        }\n        return this._deployedPromise;\n    }\n    // @TODO:\n    // estimateFallback(overrides?: TransactionRequest): Promise<BigNumber>\n    // @TODO:\n    // estimateDeploy(bytecode: string, ...args): Promise<BigNumber>\n    fallback(overrides) {\n        if (!this.signer) {\n            logger.throwError(\"sending a transactions require a signer\", Logger.errors.UNSUPPORTED_OPERATION, { operation: \"sendTransaction(fallback)\" });\n        }\n        const tx = shallowCopy(overrides || {});\n        [\"from\", \"to\"].forEach(function (key) {\n            if (tx[key] == null) {\n                return;\n            }\n            logger.throwError(\"cannot override \" + key, Logger.errors.UNSUPPORTED_OPERATION, { operation: key });\n        });\n        tx.to = this.resolvedAddress;\n        return this.deployed().then(() => {\n            return this.signer.sendTransaction(tx);\n        });\n    }\n    // Reconnect to a different signer or provider\n    connect(signerOrProvider) {\n        if (typeof (signerOrProvider) === \"string\") {\n            signerOrProvider = new VoidSigner(signerOrProvider, this.provider);\n        }\n        const contract = new (this.constructor)(this.address, this.interface, signerOrProvider);\n        if (this.deployTransaction) {\n            defineReadOnly(contract, \"deployTransaction\", this.deployTransaction);\n        }\n        return contract;\n    }\n    // Re-attach to a different on-chain instance of this contract\n    attach(addressOrName) {\n        return new (this.constructor)(addressOrName, this.interface, this.signer || this.provider);\n    }\n    static isIndexed(value) {\n        return Indexed.isIndexed(value);\n    }\n    _normalizeRunningEvent(runningEvent) {\n        // Already have an instance of this event running; we can re-use it\n        if (this._runningEvents[runningEvent.tag]) {\n            return this._runningEvents[runningEvent.tag];\n        }\n        return runningEvent;\n    }\n    _getRunningEvent(eventName) {\n        if (typeof (eventName) === \"string\") {\n            // Listen for \"error\" events (if your contract has an error event, include\n            // the full signature to bypass this special event keyword)\n            if (eventName === \"error\") {\n                return this._normalizeRunningEvent(new ErrorRunningEvent());\n            }\n            // Listen for any event that is registered\n            if (eventName === \"event\") {\n                return this._normalizeRunningEvent(new RunningEvent(\"event\", null));\n            }\n            // Listen for any event\n            if (eventName === \"*\") {\n                return this._normalizeRunningEvent(new WildcardRunningEvent(this.address, this.interface));\n            }\n            // Get the event Fragment (throws if ambiguous/unknown event)\n            const fragment = this.interface.getEvent(eventName);\n            return this._normalizeRunningEvent(new FragmentRunningEvent(this.address, this.interface, fragment));\n        }\n        // We have topics to filter by...\n        if (eventName.topics && eventName.topics.length > 0) {\n            // Is it a known topichash? (throws if no matching topichash)\n            try {\n                const topic = eventName.topics[0];\n                if (typeof (topic) !== \"string\") {\n                    throw new Error(\"invalid topic\"); // @TODO: May happen for anonymous events\n                }\n                const fragment = this.interface.getEvent(topic);\n                return this._normalizeRunningEvent(new FragmentRunningEvent(this.address, this.interface, fragment, eventName.topics));\n            }\n            catch (error) { }\n            // Filter by the unknown topichash\n            const filter = {\n                address: this.address,\n                topics: eventName.topics\n            };\n            return this._normalizeRunningEvent(new RunningEvent(getEventTag(filter), filter));\n        }\n        return this._normalizeRunningEvent(new WildcardRunningEvent(this.address, this.interface));\n    }\n    _checkRunningEvents(runningEvent) {\n        if (runningEvent.listenerCount() === 0) {\n            delete this._runningEvents[runningEvent.tag];\n            // If we have a poller for this, remove it\n            const emit = this._wrappedEmits[runningEvent.tag];\n            if (emit && runningEvent.filter) {\n                this.provider.off(runningEvent.filter, emit);\n                delete this._wrappedEmits[runningEvent.tag];\n            }\n        }\n    }\n    // Subclasses can override this to gracefully recover\n    // from parse errors if they wish\n    _wrapEvent(runningEvent, log, listener) {\n        const event = deepCopy(log);\n        event.removeListener = () => {\n            if (!listener) {\n                return;\n            }\n            runningEvent.removeListener(listener);\n            this._checkRunningEvents(runningEvent);\n        };\n        event.getBlock = () => { return this.provider.getBlock(log.blockHash); };\n        event.getTransaction = () => { return this.provider.getTransaction(log.transactionHash); };\n        event.getTransactionReceipt = () => { return this.provider.getTransactionReceipt(log.transactionHash); };\n        // This may throw if the topics and data mismatch the signature\n        runningEvent.prepareEvent(event);\n        return event;\n    }\n    _addEventListener(runningEvent, listener, once) {\n        if (!this.provider) {\n            logger.throwError(\"events require a provider or a signer with a provider\", Logger.errors.UNSUPPORTED_OPERATION, { operation: \"once\" });\n        }\n        runningEvent.addListener(listener, once);\n        // Track this running event and its listeners (may already be there; but no hard in updating)\n        this._runningEvents[runningEvent.tag] = runningEvent;\n        // If we are not polling the provider, start polling\n        if (!this._wrappedEmits[runningEvent.tag]) {\n            const wrappedEmit = (log) => {\n                let event = this._wrapEvent(runningEvent, log, listener);\n                // Try to emit the result for the parameterized event...\n                if (event.decodeError == null) {\n                    try {\n                        const args = runningEvent.getEmit(event);\n                        this.emit(runningEvent.filter, ...args);\n                    }\n                    catch (error) {\n                        event.decodeError = error.error;\n                    }\n                }\n                // Always emit \"event\" for fragment-base events\n                if (runningEvent.filter != null) {\n                    this.emit(\"event\", event);\n                }\n                // Emit \"error\" if there was an error\n                if (event.decodeError != null) {\n                    this.emit(\"error\", event.decodeError, event);\n                }\n            };\n            this._wrappedEmits[runningEvent.tag] = wrappedEmit;\n            // Special events, like \"error\" do not have a filter\n            if (runningEvent.filter != null) {\n                this.provider.on(runningEvent.filter, wrappedEmit);\n            }\n        }\n    }\n    queryFilter(event, fromBlockOrBlockhash, toBlock) {\n        const runningEvent = this._getRunningEvent(event);\n        const filter = shallowCopy(runningEvent.filter);\n        if (typeof (fromBlockOrBlockhash) === \"string\" && isHexString(fromBlockOrBlockhash, 32)) {\n            if (toBlock != null) {\n                logger.throwArgumentError(\"cannot specify toBlock with blockhash\", \"toBlock\", toBlock);\n            }\n            filter.blockHash = fromBlockOrBlockhash;\n        }\n        else {\n            filter.fromBlock = ((fromBlockOrBlockhash != null) ? fromBlockOrBlockhash : 0);\n            filter.toBlock = ((toBlock != null) ? toBlock : \"latest\");\n        }\n        return this.provider.getLogs(filter).then((logs) => {\n            return logs.map((log) => this._wrapEvent(runningEvent, log, null));\n        });\n    }\n    on(event, listener) {\n        this._addEventListener(this._getRunningEvent(event), listener, false);\n        return this;\n    }\n    once(event, listener) {\n        this._addEventListener(this._getRunningEvent(event), listener, true);\n        return this;\n    }\n    emit(eventName, ...args) {\n        if (!this.provider) {\n            return false;\n        }\n        const runningEvent = this._getRunningEvent(eventName);\n        const result = (runningEvent.run(args) > 0);\n        // May have drained all the \"once\" events; check for living events\n        this._checkRunningEvents(runningEvent);\n        return result;\n    }\n    listenerCount(eventName) {\n        if (!this.provider) {\n            return 0;\n        }\n        if (eventName == null) {\n            return Object.keys(this._runningEvents).reduce((accum, key) => {\n                return accum + this._runningEvents[key].listenerCount();\n            }, 0);\n        }\n        return this._getRunningEvent(eventName).listenerCount();\n    }\n    listeners(eventName) {\n        if (!this.provider) {\n            return [];\n        }\n        if (eventName == null) {\n            const result = [];\n            for (let tag in this._runningEvents) {\n                this._runningEvents[tag].listeners().forEach((listener) => {\n                    result.push(listener);\n                });\n            }\n            return result;\n        }\n        return this._getRunningEvent(eventName).listeners();\n    }\n    removeAllListeners(eventName) {\n        if (!this.provider) {\n            return this;\n        }\n        if (eventName == null) {\n            for (const tag in this._runningEvents) {\n                const runningEvent = this._runningEvents[tag];\n                runningEvent.removeAllListeners();\n                this._checkRunningEvents(runningEvent);\n            }\n            return this;\n        }\n        // Delete any listeners\n        const runningEvent = this._getRunningEvent(eventName);\n        runningEvent.removeAllListeners();\n        this._checkRunningEvents(runningEvent);\n        return this;\n    }\n    off(eventName, listener) {\n        if (!this.provider) {\n            return this;\n        }\n        const runningEvent = this._getRunningEvent(eventName);\n        runningEvent.removeListener(listener);\n        this._checkRunningEvents(runningEvent);\n        return this;\n    }\n    removeListener(eventName, listener) {\n        return this.off(eventName, listener);\n    }\n}\nexport class Contract extends BaseContract {\n}\nexport class ContractFactory {\n    constructor(contractInterface, bytecode, signer) {\n        let bytecodeHex = null;\n        if (typeof (bytecode) === \"string\") {\n            bytecodeHex = bytecode;\n        }\n        else if (isBytes(bytecode)) {\n            bytecodeHex = hexlify(bytecode);\n        }\n        else if (bytecode && typeof (bytecode.object) === \"string\") {\n            // Allow the bytecode object from the Solidity compiler\n            bytecodeHex = bytecode.object;\n        }\n        else {\n            // Crash in the next verification step\n            bytecodeHex = \"!\";\n        }\n        // Make sure it is 0x prefixed\n        if (bytecodeHex.substring(0, 2) !== \"0x\") {\n            bytecodeHex = \"0x\" + bytecodeHex;\n        }\n        // Make sure the final result is valid bytecode\n        if (!isHexString(bytecodeHex) || (bytecodeHex.length % 2)) {\n            logger.throwArgumentError(\"invalid bytecode\", \"bytecode\", bytecode);\n        }\n        // If we have a signer, make sure it is valid\n        if (signer && !Signer.isSigner(signer)) {\n            logger.throwArgumentError(\"invalid signer\", \"signer\", signer);\n        }\n        defineReadOnly(this, \"bytecode\", bytecodeHex);\n        defineReadOnly(this, \"interface\", getStatic(new.target, \"getInterface\")(contractInterface));\n        defineReadOnly(this, \"signer\", signer || null);\n    }\n    // @TODO: Future; rename to populateTransaction?\n    getDeployTransaction(...args) {\n        let tx = {};\n        // If we have 1 additional argument, we allow transaction overrides\n        if (args.length === this.interface.deploy.inputs.length + 1 && typeof (args[args.length - 1]) === \"object\") {\n            tx = shallowCopy(args.pop());\n            for (const key in tx) {\n                if (!allowedTransactionKeys[key]) {\n                    throw new Error(\"unknown transaction override \" + key);\n                }\n            }\n        }\n        // Do not allow these to be overridden in a deployment transaction\n        [\"data\", \"from\", \"to\"].forEach((key) => {\n            if (tx[key] == null) {\n                return;\n            }\n            logger.throwError(\"cannot override \" + key, Logger.errors.UNSUPPORTED_OPERATION, { operation: key });\n        });\n        if (tx.value) {\n            const value = BigNumber.from(tx.value);\n            if (!value.isZero() && !this.interface.deploy.payable) {\n                logger.throwError(\"non-payable constructor cannot override value\", Logger.errors.UNSUPPORTED_OPERATION, {\n                    operation: \"overrides.value\",\n                    value: tx.value\n                });\n            }\n        }\n        // Make sure the call matches the constructor signature\n        logger.checkArgumentCount(args.length, this.interface.deploy.inputs.length, \" in Contract constructor\");\n        // Set the data to the bytecode + the encoded constructor arguments\n        tx.data = hexlify(concat([\n            this.bytecode,\n            this.interface.encodeDeploy(args)\n        ]));\n        return tx;\n    }\n    deploy(...args) {\n        return __awaiter(this, void 0, void 0, function* () {\n            let overrides = {};\n            // If 1 extra parameter was passed in, it contains overrides\n            if (args.length === this.interface.deploy.inputs.length + 1) {\n                overrides = args.pop();\n            }\n            // Make sure the call matches the constructor signature\n            logger.checkArgumentCount(args.length, this.interface.deploy.inputs.length, \" in Contract constructor\");\n            // Resolve ENS names and promises in the arguments\n            const params = yield resolveAddresses(this.signer, args, this.interface.deploy.inputs);\n            params.push(overrides);\n            // Get the deployment transaction (with optional overrides)\n            const unsignedTx = this.getDeployTransaction(...params);\n            // Send the deployment transaction\n            const tx = yield this.signer.sendTransaction(unsignedTx);\n            const address = getStatic(this.constructor, \"getContractAddress\")(tx);\n            const contract = getStatic(this.constructor, \"getContract\")(address, this.interface, this.signer);\n            // Add the modified wait that wraps events\n            addContractWait(contract, tx);\n            defineReadOnly(contract, \"deployTransaction\", tx);\n            return contract;\n        });\n    }\n    attach(address) {\n        return (this.constructor).getContract(address, this.interface, this.signer);\n    }\n    connect(signer) {\n        return new (this.constructor)(this.interface, this.bytecode, signer);\n    }\n    static fromSolidity(compilerOutput, signer) {\n        if (compilerOutput == null) {\n            logger.throwError(\"missing compiler output\", Logger.errors.MISSING_ARGUMENT, { argument: \"compilerOutput\" });\n        }\n        if (typeof (compilerOutput) === \"string\") {\n            compilerOutput = JSON.parse(compilerOutput);\n        }\n        const abi = compilerOutput.abi;\n        let bytecode = null;\n        if (compilerOutput.bytecode) {\n            bytecode = compilerOutput.bytecode;\n        }\n        else if (compilerOutput.evm && compilerOutput.evm.bytecode) {\n            bytecode = compilerOutput.evm.bytecode;\n        }\n        return new this(abi, bytecode, signer);\n    }\n    static getInterface(contractInterface) {\n        return Contract.getInterface(contractInterface);\n    }\n    static getContractAddress(tx) {\n        return getContractAddress(tx);\n    }\n    static getContract(address, contractInterface, signer) {\n        return new Contract(address, contractInterface, signer);\n    }\n}\n//# sourceMappingURL=index.js.map","export const version = \"contracts/5.7.0\";\n//# sourceMappingURL=_version.js.map"],"sourceRoot":""}