{"version":3,"sources":["webpack:///./node_modules/browserify-sign/node_modules/readable-stream/lib/internal/streams/state.js","webpack:///./node_modules/browserify-sign/algos.js","webpack:///./node_modules/browserify-sign/node_modules/readable-stream/lib/internal/streams/buffer_list.js","webpack:///./node_modules/browserify-sign/node_modules/readable-stream/readable-browser.js","webpack:///./node_modules/browserify-sign/node_modules/readable-stream/lib/internal/streams/end-of-stream.js","webpack:///./node_modules/browserify-sign/node_modules/readable-stream/lib/_stream_writable.js","webpack:///./node_modules/browserify-sign/node_modules/readable-stream/lib/internal/streams/async_iterator.js","webpack:///./node_modules/browserify-sign/node_modules/readable-stream/lib/_stream_duplex.js","webpack:///./node_modules/browserify-sign/browser/sign.js","webpack:///./node_modules/buffer-xor/index.js","webpack:///./node_modules/browserify-sign/node_modules/readable-stream/lib/internal/streams/destroy.js","webpack:///./node_modules/browserify-sign/browser/verify.js","webpack:///./node_modules/browserify-sign/node_modules/readable-stream/lib/_stream_passthrough.js","webpack:///./node_modules/browserify-sign/node_modules/readable-stream/lib/internal/streams/pipeline.js","webpack:///./node_modules/buffer-equal-constant-time/index.js","webpack:///./node_modules/browserify-sign/browser/index.js","webpack:///./node_modules/browserify-sign/node_modules/bn.js/lib/bn.js","webpack:///./node_modules/browserify-sign/node_modules/readable-stream/lib/_stream_readable.js","webpack:///./node_modules/browserify-sign/node_modules/readable-stream/errors-browser.js","webpack:///./node_modules/browserify-sign/node_modules/readable-stream/lib/internal/streams/stream-browser.js","webpack:///./node_modules/browserify-sign/node_modules/readable-stream/lib/_stream_transform.js","webpack:///./node_modules/browserify-sign/node_modules/readable-stream/lib/internal/streams/from-browser.js"],"names":["ERR_INVALID_OPT_VALUE","codes","highWaterMarkFrom","options","isDuplex","duplexKey","highWaterMark","getHighWaterMark","state","hwm","isFinite","Math","floor","name","objectMode","module","exports","ownKeys","object","enumerableOnly","keys","Object","getOwnPropertySymbols","symbols","filter","sym","getOwnPropertyDescriptor","enumerable","push","apply","_objectSpread","target","i","arguments","length","source","forEach","key","_defineProperty","getOwnPropertyDescriptors","defineProperties","defineProperty","obj","value","configurable","writable","_classCallCheck","instance","Constructor","TypeError","_defineProperties","props","descriptor","_createClass","protoProps","staticProps","prototype","_require","Buffer","_require2","inspect","custom","copyBuffer","src","offset","copy","call","BufferList","this","head","tail","v","entry","data","next","ret","s","p","n","alloc","allocUnsafe","hasStrings","slice","shift","_getString","_getBuffer","c","str","nb","buf","_","depth","customInspect","Stream","Readable","Writable","Duplex","Transform","PassThrough","finished","pipeline","ERR_STREAM_PREMATURE_CLOSE","once","callback","called","_len","args","Array","_key","noop","isRequest","stream","setHeader","abort","eos","opts","readable","onlegacyfinish","onfinish","writableEnded","_writableState","readableEnded","_readableState","endEmitted","onend","onerror","err","onclose","ended","onrequest","req","on","error","removeListener","CorkedRequest","_this","finish","onCorkedFinish","WritableState","internalUtil","deprecate","OurUint8Array","global","Uint8Array","_uint8ArrayToBuffer","chunk","from","_isUint8Array","isBuffer","realHasInstance","destroyImpl","_require$codes","ERR_INVALID_ARG_TYPE","ERR_METHOD_NOT_IMPLEMENTED","ERR_MULTIPLE_CALLBACK","ERR_STREAM_CANNOT_PIPE","ERR_STREAM_DESTROYED","ERR_STREAM_NULL_VALUES","ERR_STREAM_WRITE_AFTER_END","ERR_UNKNOWN_ENCODING","errorOrDestroy","nop","writableObjectMode","finalCalled","needDrain","ending","destroyed","noDecode","decodeStrings","defaultEncoding","writing","corked","sync","bufferProcessing","onwrite","er","writecb","writelen","bufferedRequest","lastBufferedRequest","pendingcb","prefinished","errorEmitted","emitClose","autoDestroy","bufferedRequestCount","corkedRequestsFree","write","_write","writev","_writev","destroy","_destroy","final","_final","writeAfterEnd","cb","process","nextTick","validChunk","decodeChunk","encoding","writeOrBuffer","isBuf","newChunk","len","last","doWrite","onwriteError","finishMaybe","onwriteStateUpdate","needFinish","clearBuffer","afterWrite","onwriteDrain","emit","l","buffer","holder","count","allBuffers","callFinal","prefinish","need","rState","endWritable","corkReq","getBuffer","current","out","get","Symbol","hasInstance","Function","pipe","cork","uncork","setDefaultEncoding","toLowerCase","indexOf","end","undefined","set","_undestroy","undestroy","_Object$setPrototypeO","kLastResolve","kLastReject","kError","kEnded","kLastPromise","kHandlePromise","kStream","createIterResult","done","readAndResolve","iter","resolve","read","onReadable","wrapForNext","lastPromise","reject","then","AsyncIteratorPrototype","getPrototypeOf","ReadableStreamAsyncIteratorPrototype","setPrototypeOf","Promise","promise","asyncIterator","_this2","createReadableStreamAsyncIterator","_Object$create","iterator","create","code","bind","objectKeys","method","allowHalfOpen","onEndNT","self","createHmac","crt","EC","ec","BN","parseKeys","curves","sign","hash","hashType","signType","tag","priv","curve","Error","ecSign","type","dsaSign","concat","modulus","byteLength","pad","curveId","join","keyFromPrivate","privateKey","toDER","algo","k","x","params","priv_key","q","g","r","H","bits2int","mod","kv","getKey","makeKey","makeR","invm","imul","add","mul","cmpn","toArray","total","res","zeros","hlen","hbits","bits2octets","fill","update","digest","obits","bits","bitLength","ishrn","t","cmp","toRed","mont","redPow","fromRed","min","a","b","readableDestroyed","writableDestroyed","emitErrorNT","emitCloseNT","emitErrorAndCloseNT","reading","wState","verify","sig","pub","ecVerify","dsaVerify","padNum","red","publicExponent","algorithm","pubkey","subjectPrivateKey","y","pub_key","unpacked","signature","decode","checkValue","montp","w","_transform","ERR_MISSING_ARGS","destroyer","closed","fn","to","popCallback","streams","pop","isArray","destroys","map","reduce","SlowBuffer","bufferEq","install","equal","that","origBufEqual","origSlowBufEqual","restore","createHash","inherits","algorithms","Sign","_hashType","_hash","_tag","id","_signType","Verify","createSign","createVerify","enc","toString","assert","val","msg","ctor","superCtor","super_","TempCtor","constructor","number","base","endian","isBN","negative","words","_init","wordSize","e","parseHex","start","z","charCodeAt","parseBase","move","dest","num","max","left","right","_initNumber","_initArray","replace","_parseHex","_parseBase","_strip","ceil","j","off","limbLen","limbPow","word","imuln","_iaddn","pow","_move","clone","_expand","size","_normSign","for","groupSizes","groupBases","padding","carry","groupSize","groupBase","isZero","modrn","idivn","toNumber","toJSON","toBuffer","toArrayLike","allocate","ArrayType","toBitArray","bit","wbit","smallMulTo","lo","ncarry","rword","maxJ","reqLength","postfix","_toArrayLikeLE","position","_toArrayLikeBE","clz32","_countBits","_zeroBits","hi","zeroBits","toTwos","width","abs","inotn","iaddn","fromTwos","testn","notn","ineg","isNeg","neg","iuor","ior","or","uor","iuand","iand","and","uand","iuxor","ixor","xor","uxor","bytesNeeded","bitsLeft","setn","iadd","isub","sub","comb10MulTo","mid","o","a0","al0","ah0","a1","al1","ah1","a2","al2","ah2","a3","al3","ah3","a4","al4","ah4","a5","al5","ah5","a6","al6","ah6","a7","al7","ah7","a8","al8","ah8","a9","al9","ah9","b0","bl0","bh0","b1","bl1","bh1","b2","bl2","bh2","b3","bl3","bh3","b4","bl4","bh4","b5","bl5","bh5","b6","bl6","bh6","b7","bl7","bh7","b8","bl8","bh8","b9","bl9","bh9","w0","w1","w2","w3","w4","w5","w6","w7","w8","w9","w10","w11","w12","w13","w14","w15","w16","w17","w18","bigMulTo","hncarry","jumboMulTo","FFTM","mulTo","makeRBT","N","revBin","rb","permute","rbt","rws","iws","rtws","itws","transform","rtwdf","cos","PI","itwdf","sin","rtwdf_","itwdf_","re","ie","ro","io","rx","guessLen13b","m","odd","conjugate","normalize13b","ws","round","convert13b","stub","ph","mulp","rwst","iwst","nrws","nrwst","niwst","rmws","mulf","isNegNum","muln","sqr","isqr","iushln","carryMask","newCarry","ishln","iushrn","hint","extended","h","mask","maskedWords","shln","ushln","shrn","ushrn","imaskn","maskn","isubn","addn","subn","iabs","_ishlnsubmul","_wordDiv","mode","bhi","bhiBits","diff","qj","div","divmod","positive","divn","umod","divRound","dm","half","r2","andln","acc","modn","egcd","A","B","C","D","isEven","yp","xp","im","isOdd","jm","gcd","_invmp","x1","x2","delta","bincn","ucmp","gtn","gt","gten","gte","ltn","lt","lten","lte","eqn","eq","Red","ctx","convertTo","_forceRed","convertFrom","forceRed","redAdd","redIAdd","redSub","redISub","redShl","shl","redMul","_verify2","redIMul","redSqr","_verify1","redISqr","redSqrt","sqrt","redInvm","redNeg","primes","k256","p224","p192","p25519","MPrime","tmp","_tmp","K256","P224","P192","P25519","prime","_prime","Mont","imod","rinv","minv","ireduce","rlen","split","imulK","input","output","outLen","prev","mod3","one","nOne","lpow","inv","windowSize","wnd","currentLen","u","ReadableState","EventEmitter","EElistenerCount","emitter","listeners","debug","debugUtil","debuglog","StringDecoder","ERR_STREAM_PUSH_AFTER_EOF","ERR_STREAM_UNSHIFT_AFTER_END_EVENT","kProxyEvents","prependListener","event","_events","unshift","readableObjectMode","pipes","pipesCount","flowing","needReadable","emittedReadable","readableListening","resumeScheduled","paused","awaitDrain","readingMore","decoder","_read","readableAddChunk","addToFront","skipChunkCheck","onEofChunk","chunkInvalid","addChunk","maybeReadMore","emitReadable","isPaused","setEncoding","content","clear","MAX_HWM","computeNewHighWaterMark","howMuchToRead","emitReadable_","flow","maybeReadMore_","pipeOnDrain","updateReadableListening","listenerCount","resume","nReadingNextTick","resume_","fromList","first","consume","endReadable","endReadableNT","xs","parseInt","nOrig","doRead","pipeOpts","doEnd","stdout","stderr","endFn","unpipe","onunpipe","unpipeInfo","hasUnpiped","cleanup","ondrain","cleanedUp","ondata","pause","dests","index","splice","ev","addListener","removeAllListeners","wrap","_fromList","iterable","_inheritsLoose","subClass","superClass","__proto__","createErrorType","message","Base","getMessage","arg1","arg2","arg3","NodeError","_Base","oneOf","expected","thing","String","startsWith","search","pos","substr","endsWith","this_len","substring","includes","actual","determiner","arg","ERR_TRANSFORM_ALREADY_TRANSFORMING","ERR_TRANSFORM_WITH_LENGTH_0","afterTransform","ts","_transformState","transforming","writechunk","rs","needTransform","writeencoding","flush","_flush","err2"],"mappings":"0HAEA,IAAIA,EAAwB,EAAQ,QAAmBC,MAAMD,sBAE7D,SAASE,EAAkBC,EAASC,EAAUC,GAC5C,OAAgC,MAAzBF,EAAQG,cAAwBH,EAAQG,cAAgBF,EAAWD,EAAQE,GAAa,KAGjG,SAASE,EAAiBC,EAAOL,EAASE,EAAWD,GACnD,IAAIK,EAAMP,EAAkBC,EAASC,EAAUC,GAE/C,GAAW,MAAPI,EAAa,CACf,IAAMC,SAASD,IAAQE,KAAKC,MAAMH,KAASA,GAAQA,EAAM,EAAG,CAC1D,IAAII,EAAOT,EAAWC,EAAY,gBAClC,MAAM,IAAIL,EAAsBa,EAAMJ,GAGxC,OAAOE,KAAKC,MAAMH,GAIpB,OAAOD,EAAMM,WAAa,GAAK,MAGjCC,EAAOC,QAAU,CACfT,iBAAkBA,I,uBCzBpBQ,EAAOC,QAAU,EAAQ,S,oCCEzB,SAASC,EAAQC,EAAQC,GAAkB,IAAIC,EAAOC,OAAOD,KAAKF,GAAS,GAAIG,OAAOC,sBAAuB,CAAE,IAAIC,EAAUF,OAAOC,sBAAsBJ,GAAaC,IAAgBI,EAAUA,EAAQC,QAAO,SAAUC,GAAO,OAAOJ,OAAOK,yBAAyBR,EAAQO,GAAKE,eAAgBP,EAAKQ,KAAKC,MAAMT,EAAMG,GAAY,OAAOH,EAE9U,SAASU,EAAcC,GAAU,IAAK,IAAIC,EAAI,EAAGA,EAAIC,UAAUC,OAAQF,IAAK,CAAE,IAAIG,EAAyB,MAAhBF,UAAUD,GAAaC,UAAUD,GAAK,GAAQA,EAAI,EAAKf,EAAQI,OAAOc,IAAS,GAAMC,SAAQ,SAAUC,GAAOC,EAAgBP,EAAQM,EAAKF,EAAOE,OAAsBhB,OAAOkB,0BAA6BlB,OAAOmB,iBAAiBT,EAAQV,OAAOkB,0BAA0BJ,IAAmBlB,EAAQI,OAAOc,IAASC,SAAQ,SAAUC,GAAOhB,OAAOoB,eAAeV,EAAQM,EAAKhB,OAAOK,yBAAyBS,EAAQE,OAAe,OAAON,EAE7gB,SAASO,EAAgBI,EAAKL,EAAKM,GAAiK,OAApJN,KAAOK,EAAOrB,OAAOoB,eAAeC,EAAKL,EAAK,CAAEM,MAAOA,EAAOhB,YAAY,EAAMiB,cAAc,EAAMC,UAAU,IAAkBH,EAAIL,GAAOM,EAAgBD,EAE3M,SAASI,EAAgBC,EAAUC,GAAe,KAAMD,aAAoBC,GAAgB,MAAM,IAAIC,UAAU,qCAEhH,SAASC,EAAkBnB,EAAQoB,GAAS,IAAK,IAAInB,EAAI,EAAGA,EAAImB,EAAMjB,OAAQF,IAAK,CAAE,IAAIoB,EAAaD,EAAMnB,GAAIoB,EAAWzB,WAAayB,EAAWzB,aAAc,EAAOyB,EAAWR,cAAe,EAAU,UAAWQ,IAAYA,EAAWP,UAAW,GAAMxB,OAAOoB,eAAeV,EAAQqB,EAAWf,IAAKe,IAE7S,SAASC,EAAaL,EAAaM,EAAYC,GAAmJ,OAAhID,GAAYJ,EAAkBF,EAAYQ,UAAWF,GAAiBC,GAAaL,EAAkBF,EAAaO,GAAqBP,EAEzM,IAAIS,EAAW,EAAQ,QACnBC,EAASD,EAASC,OAElBC,EAAY,EAAQ,GACpBC,EAAUD,EAAUC,QAEpBC,EAASD,GAAWA,EAAQC,QAAU,UAE1C,SAASC,EAAWC,EAAKhC,EAAQiC,GAC/BN,EAAOF,UAAUS,KAAKC,KAAKH,EAAKhC,EAAQiC,GAG1CjD,EAAOC,QAEP,WACE,SAASmD,IACPrB,EAAgBsB,KAAMD,GAEtBC,KAAKC,KAAO,KACZD,KAAKE,KAAO,KACZF,KAAKlC,OAAS,EA8KhB,OA3KAmB,EAAac,EAAY,CAAC,CACxB9B,IAAK,OACLM,MAAO,SAAc4B,GACnB,IAAIC,EAAQ,CACVC,KAAMF,EACNG,KAAM,MAEJN,KAAKlC,OAAS,EAAGkC,KAAKE,KAAKI,KAAOF,EAAWJ,KAAKC,KAAOG,EAC7DJ,KAAKE,KAAOE,IACVJ,KAAKlC,SAER,CACDG,IAAK,UACLM,MAAO,SAAiB4B,GACtB,IAAIC,EAAQ,CACVC,KAAMF,EACNG,KAAMN,KAAKC,MAEO,IAAhBD,KAAKlC,SAAckC,KAAKE,KAAOE,GACnCJ,KAAKC,KAAOG,IACVJ,KAAKlC,SAER,CACDG,IAAK,QACLM,MAAO,WACL,GAAoB,IAAhByB,KAAKlC,OAAT,CACA,IAAIyC,EAAMP,KAAKC,KAAKI,KAGpB,OAFoB,IAAhBL,KAAKlC,OAAckC,KAAKC,KAAOD,KAAKE,KAAO,KAAUF,KAAKC,KAAOD,KAAKC,KAAKK,OAC7EN,KAAKlC,OACAyC,KAER,CACDtC,IAAK,QACLM,MAAO,WACLyB,KAAKC,KAAOD,KAAKE,KAAO,KACxBF,KAAKlC,OAAS,IAEf,CACDG,IAAK,OACLM,MAAO,SAAciC,GACnB,GAAoB,IAAhBR,KAAKlC,OAAc,MAAO,GAC9B,IAAI2C,EAAIT,KAAKC,KACTM,EAAM,GAAKE,EAAEJ,KAEjB,MAAOI,EAAIA,EAAEH,KACXC,GAAOC,EAAIC,EAAEJ,KAGf,OAAOE,IAER,CACDtC,IAAK,SACLM,MAAO,SAAgBmC,GACrB,GAAoB,IAAhBV,KAAKlC,OAAc,OAAOwB,EAAOqB,MAAM,GAC3C,IAAIJ,EAAMjB,EAAOsB,YAAYF,IAAM,GAC/BD,EAAIT,KAAKC,KACTrC,EAAI,EAER,MAAO6C,EACLf,EAAWe,EAAEJ,KAAME,EAAK3C,GACxBA,GAAK6C,EAAEJ,KAAKvC,OACZ2C,EAAIA,EAAEH,KAGR,OAAOC,IAGR,CACDtC,IAAK,UACLM,MAAO,SAAiBmC,EAAGG,GACzB,IAAIN,EAcJ,OAZIG,EAAIV,KAAKC,KAAKI,KAAKvC,QAErByC,EAAMP,KAAKC,KAAKI,KAAKS,MAAM,EAAGJ,GAC9BV,KAAKC,KAAKI,KAAOL,KAAKC,KAAKI,KAAKS,MAAMJ,IAGtCH,EAFSG,IAAMV,KAAKC,KAAKI,KAAKvC,OAExBkC,KAAKe,QAGLF,EAAab,KAAKgB,WAAWN,GAAKV,KAAKiB,WAAWP,GAGnDH,IAER,CACDtC,IAAK,QACLM,MAAO,WACL,OAAOyB,KAAKC,KAAKI,OAGlB,CACDpC,IAAK,aACLM,MAAO,SAAoBmC,GACzB,IAAID,EAAIT,KAAKC,KACTiB,EAAI,EACJX,EAAME,EAAEJ,KACZK,GAAKH,EAAIzC,OAET,MAAO2C,EAAIA,EAAEH,KAAM,CACjB,IAAIa,EAAMV,EAAEJ,KACRe,EAAKV,EAAIS,EAAIrD,OAASqD,EAAIrD,OAAS4C,EAIvC,GAHIU,IAAOD,EAAIrD,OAAQyC,GAAOY,EAASZ,GAAOY,EAAIL,MAAM,EAAGJ,GAC3DA,GAAKU,EAEK,IAANV,EAAS,CACPU,IAAOD,EAAIrD,UACXoD,EACET,EAAEH,KAAMN,KAAKC,KAAOQ,EAAEH,KAAUN,KAAKC,KAAOD,KAAKE,KAAO,OAE5DF,KAAKC,KAAOQ,EACZA,EAAEJ,KAAOc,EAAIL,MAAMM,IAGrB,QAGAF,EAIJ,OADAlB,KAAKlC,QAAUoD,EACRX,IAGR,CACDtC,IAAK,aACLM,MAAO,SAAoBmC,GACzB,IAAIH,EAAMjB,EAAOsB,YAAYF,GACzBD,EAAIT,KAAKC,KACTiB,EAAI,EACRT,EAAEJ,KAAKR,KAAKU,GACZG,GAAKD,EAAEJ,KAAKvC,OAEZ,MAAO2C,EAAIA,EAAEH,KAAM,CACjB,IAAIe,EAAMZ,EAAEJ,KACRe,EAAKV,EAAIW,EAAIvD,OAASuD,EAAIvD,OAAS4C,EAIvC,GAHAW,EAAIxB,KAAKU,EAAKA,EAAIzC,OAAS4C,EAAG,EAAGU,GACjCV,GAAKU,EAEK,IAANV,EAAS,CACPU,IAAOC,EAAIvD,UACXoD,EACET,EAAEH,KAAMN,KAAKC,KAAOQ,EAAEH,KAAUN,KAAKC,KAAOD,KAAKE,KAAO,OAE5DF,KAAKC,KAAOQ,EACZA,EAAEJ,KAAOgB,EAAIP,MAAMM,IAGrB,QAGAF,EAIJ,OADAlB,KAAKlC,QAAUoD,EACRX,IAGR,CACDtC,IAAKwB,EACLlB,MAAO,SAAe+C,EAAGvF,GACvB,OAAOyD,EAAQQ,KAAMtC,EAAc,GAAI3B,EAAS,CAE9CwF,MAAO,EAEPC,eAAe,SAKdzB,EApLT,I,uBC5BAnD,EAAUD,EAAOC,QAAU,EAAQ,QACnCA,EAAQ6E,OAAS7E,EACjBA,EAAQ8E,SAAW9E,EACnBA,EAAQ+E,SAAW,EAAQ,QAC3B/E,EAAQgF,OAAS,EAAQ,QACzBhF,EAAQiF,UAAY,EAAQ,QAC5BjF,EAAQkF,YAAc,EAAQ,QAC9BlF,EAAQmF,SAAW,EAAQ,QAC3BnF,EAAQoF,SAAW,EAAQ,S,oCCJ3B,IAAIC,EAA6B,EAAQ,QAAmBpG,MAAMoG,2BAElE,SAASC,EAAKC,GACZ,IAAIC,GAAS,EACb,OAAO,WACL,IAAIA,EAAJ,CACAA,GAAS,EAET,IAAK,IAAIC,EAAOxE,UAAUC,OAAQwE,EAAO,IAAIC,MAAMF,GAAOG,EAAO,EAAGA,EAAOH,EAAMG,IAC/EF,EAAKE,GAAQ3E,UAAU2E,GAGzBL,EAAS1E,MAAMuC,KAAMsC,KAIzB,SAASG,KAET,SAASC,EAAUC,GACjB,OAAOA,EAAOC,WAAqC,oBAAjBD,EAAOE,MAG3C,SAASC,EAAIH,EAAQI,EAAMZ,GACzB,GAAoB,oBAATY,EAAqB,OAAOD,EAAIH,EAAQ,KAAMI,GACpDA,IAAMA,EAAO,IAClBZ,EAAWD,EAAKC,GAAYM,GAC5B,IAAIO,EAAWD,EAAKC,WAA8B,IAAlBD,EAAKC,UAAsBL,EAAOK,SAC9DvE,EAAWsE,EAAKtE,WAA8B,IAAlBsE,EAAKtE,UAAsBkE,EAAOlE,SAE9DwE,EAAiB,WACdN,EAAOlE,UAAUyE,KAGpBC,EAAgBR,EAAOS,gBAAkBT,EAAOS,eAAerB,SAE/DmB,EAAW,WACbzE,GAAW,EACX0E,GAAgB,EACXH,GAAUb,EAASrC,KAAK6C,IAG3BU,EAAgBV,EAAOW,gBAAkBX,EAAOW,eAAeC,WAE/DC,EAAQ,WACVR,GAAW,EACXK,GAAgB,EACX5E,GAAU0D,EAASrC,KAAK6C,IAG3Bc,EAAU,SAAiBC,GAC7BvB,EAASrC,KAAK6C,EAAQe,IAGpBC,EAAU,WACZ,IAAID,EAEJ,OAAIV,IAAaK,GACVV,EAAOW,gBAAmBX,EAAOW,eAAeM,QAAOF,EAAM,IAAIzB,GAC/DE,EAASrC,KAAK6C,EAAQe,IAG3BjF,IAAa0E,GACVR,EAAOS,gBAAmBT,EAAOS,eAAeQ,QAAOF,EAAM,IAAIzB,GAC/DE,EAASrC,KAAK6C,EAAQe,SAF/B,GAMEG,EAAY,WACdlB,EAAOmB,IAAIC,GAAG,SAAUb,IAiB1B,OAdIR,EAAUC,IACZA,EAAOoB,GAAG,WAAYb,GACtBP,EAAOoB,GAAG,QAASJ,GACfhB,EAAOmB,IAAKD,IAAiBlB,EAAOoB,GAAG,UAAWF,IAC7CpF,IAAakE,EAAOS,iBAE7BT,EAAOoB,GAAG,MAAOd,GACjBN,EAAOoB,GAAG,QAASd,IAGrBN,EAAOoB,GAAG,MAAOP,GACjBb,EAAOoB,GAAG,SAAUb,IACD,IAAfH,EAAKiB,OAAiBrB,EAAOoB,GAAG,QAASN,GAC7Cd,EAAOoB,GAAG,QAASJ,GACZ,WACLhB,EAAOsB,eAAe,WAAYf,GAClCP,EAAOsB,eAAe,QAASN,GAC/BhB,EAAOsB,eAAe,UAAWJ,GAC7BlB,EAAOmB,KAAKnB,EAAOmB,IAAIG,eAAe,SAAUf,GACpDP,EAAOsB,eAAe,MAAOhB,GAC7BN,EAAOsB,eAAe,QAAShB,GAC/BN,EAAOsB,eAAe,SAAUf,GAChCP,EAAOsB,eAAe,MAAOT,GAC7Bb,EAAOsB,eAAe,QAASR,GAC/Bd,EAAOsB,eAAe,QAASN,IAInChH,EAAOC,QAAUkG,G,qCCvGjB,cAqCA,SAASoB,EAAc9H,GACrB,IAAI+H,EAAQnE,KAEZA,KAAKM,KAAO,KACZN,KAAKI,MAAQ,KAEbJ,KAAKoE,OAAS,WACZC,EAAeF,EAAO/H,IAQ1B,IAAIwF,EA3BJjF,EAAOC,QAAU+E,EA8BjBA,EAAS2C,cAAgBA,EAGzB,IAAIC,EAAe,CACjBC,UAAW,EAAQ,SAMjB/C,EAAS,EAAQ,QAIjBnC,EAAS,EAAQ,QAAUA,OAE3BmF,EAAgBC,EAAOC,YAAc,aAEzC,SAASC,EAAoBC,GAC3B,OAAOvF,EAAOwF,KAAKD,GAGrB,SAASE,EAAczG,GACrB,OAAOgB,EAAO0F,SAAS1G,IAAQA,aAAemG,EAGhD,IAkIIQ,EAlIAC,EAAc,EAAQ,QAEtB7F,EAAW,EAAQ,QACnBlD,EAAmBkD,EAASlD,iBAE5BgJ,EAAiB,EAAQ,QAAatJ,MACtCuJ,EAAuBD,EAAeC,qBACtCC,EAA6BF,EAAeE,2BAC5CC,EAAwBH,EAAeG,sBACvCC,EAAyBJ,EAAeI,uBACxCC,EAAuBL,EAAeK,qBACtCC,EAAyBN,EAAeM,uBACxCC,EAA6BP,EAAeO,2BAC5CC,EAAuBR,EAAeQ,qBAEtCC,EAAiBV,EAAYU,eAIjC,SAASC,KAET,SAASvB,EAAcvI,EAAS4G,EAAQ3G,GACtC4F,EAASA,GAAU,EAAQ,QAC3B7F,EAAUA,GAAW,GAMG,mBAAbC,IAAwBA,EAAW2G,aAAkBf,GAGhE5B,KAAKtD,aAAeX,EAAQW,WACxBV,IAAUgE,KAAKtD,WAAasD,KAAKtD,cAAgBX,EAAQ+J,oBAI7D9F,KAAK9D,cAAgBC,EAAiB6D,KAAMjE,EAAS,wBAAyBC,GAE9EgE,KAAK+F,aAAc,EAEnB/F,KAAKgG,WAAY,EAEjBhG,KAAKiG,QAAS,EAEdjG,KAAK4D,OAAQ,EAEb5D,KAAK+B,UAAW,EAEhB/B,KAAKkG,WAAY,EAIjB,IAAIC,GAAqC,IAA1BpK,EAAQqK,cACvBpG,KAAKoG,eAAiBD,EAItBnG,KAAKqG,gBAAkBtK,EAAQsK,iBAAmB,OAIlDrG,KAAKlC,OAAS,EAEdkC,KAAKsG,SAAU,EAEftG,KAAKuG,OAAS,EAKdvG,KAAKwG,MAAO,EAIZxG,KAAKyG,kBAAmB,EAExBzG,KAAK0G,QAAU,SAAUC,GACvBD,EAAQ/D,EAAQgE,IAIlB3G,KAAK4G,QAAU,KAEf5G,KAAK6G,SAAW,EAChB7G,KAAK8G,gBAAkB,KACvB9G,KAAK+G,oBAAsB,KAG3B/G,KAAKgH,UAAY,EAGjBhH,KAAKiH,aAAc,EAEnBjH,KAAKkH,cAAe,EAEpBlH,KAAKmH,WAAkC,IAAtBpL,EAAQoL,UAEzBnH,KAAKoH,cAAgBrL,EAAQqL,YAE7BpH,KAAKqH,qBAAuB,EAG5BrH,KAAKsH,mBAAqB,IAAIpD,EAAclE,MA4C9C,SAAS2B,EAAS5F,GAChB6F,EAASA,GAAU,EAAQ,QAS3B,IAAI5F,EAAWgE,gBAAgB4B,EAC/B,IAAK5F,IAAaiJ,EAAgBnF,KAAK6B,EAAU3B,MAAO,OAAO,IAAI2B,EAAS5F,GAC5EiE,KAAKoD,eAAiB,IAAIkB,EAAcvI,EAASiE,KAAMhE,GAEvDgE,KAAKvB,UAAW,EAEZ1C,IAC2B,oBAAlBA,EAAQwL,QAAsBvH,KAAKwH,OAASzL,EAAQwL,OACjC,oBAAnBxL,EAAQ0L,SAAuBzH,KAAK0H,QAAU3L,EAAQ0L,QAClC,oBAApB1L,EAAQ4L,UAAwB3H,KAAK4H,SAAW7L,EAAQ4L,SACtC,oBAAlB5L,EAAQ8L,QAAsB7H,KAAK8H,OAAS/L,EAAQ8L,QAGjEpG,EAAO3B,KAAKE,MAQd,SAAS+H,EAAcpF,EAAQqF,GAC7B,IAAIrB,EAAK,IAAIjB,EAEbE,EAAejD,EAAQgE,GACvBsB,EAAQC,SAASF,EAAIrB,GAMvB,SAASwB,EAAWxF,EAAQvG,EAAOyI,EAAOmD,GACxC,IAAIrB,EAQJ,OANc,OAAV9B,EACF8B,EAAK,IAAIlB,EACiB,kBAAVZ,GAAuBzI,EAAMM,aAC7CiK,EAAK,IAAIvB,EAAqB,QAAS,CAAC,SAAU,UAAWP,KAG3D8B,IACFf,EAAejD,EAAQgE,GACvBsB,EAAQC,SAASF,EAAIrB,IACd,GA6DX,SAASyB,EAAYhM,EAAOyI,EAAOwD,GAKjC,OAJKjM,EAAMM,aAAsC,IAAxBN,EAAMgK,eAA4C,kBAAVvB,IAC/DA,EAAQvF,EAAOwF,KAAKD,EAAOwD,IAGtBxD,EAeT,SAASyD,EAAc3F,EAAQvG,EAAOmM,EAAO1D,EAAOwD,EAAUL,GAC5D,IAAKO,EAAO,CACV,IAAIC,EAAWJ,EAAYhM,EAAOyI,EAAOwD,GAErCxD,IAAU2D,IACZD,GAAQ,EACRF,EAAW,SACXxD,EAAQ2D,GAIZ,IAAIC,EAAMrM,EAAMM,WAAa,EAAImI,EAAM/G,OACvC1B,EAAM0B,QAAU2K,EAChB,IAAIlI,EAAMnE,EAAM0B,OAAS1B,EAAMF,cAI/B,GAFKqE,IAAKnE,EAAM4J,WAAY,GAExB5J,EAAMkK,SAAWlK,EAAMmK,OAAQ,CACjC,IAAImC,EAAOtM,EAAM2K,oBACjB3K,EAAM2K,oBAAsB,CAC1BlC,MAAOA,EACPwD,SAAUA,EACVE,MAAOA,EACPpG,SAAU6F,EACV1H,KAAM,MAGJoI,EACFA,EAAKpI,KAAOlE,EAAM2K,oBAElB3K,EAAM0K,gBAAkB1K,EAAM2K,oBAGhC3K,EAAMiL,sBAAwB,OAE9BsB,EAAQhG,EAAQvG,GAAO,EAAOqM,EAAK5D,EAAOwD,EAAUL,GAGtD,OAAOzH,EAGT,SAASoI,EAAQhG,EAAQvG,EAAOqL,EAAQgB,EAAK5D,EAAOwD,EAAUL,GAC5D5L,EAAMyK,SAAW4B,EACjBrM,EAAMwK,QAAUoB,EAChB5L,EAAMkK,SAAU,EAChBlK,EAAMoK,MAAO,EACTpK,EAAM8J,UAAW9J,EAAMsK,QAAQ,IAAIlB,EAAqB,UAAmBiC,EAAQ9E,EAAO+E,QAAQ7C,EAAOzI,EAAMsK,SAAc/D,EAAO6E,OAAO3C,EAAOwD,EAAUjM,EAAMsK,SACtKtK,EAAMoK,MAAO,EAGf,SAASoC,EAAajG,EAAQvG,EAAOoK,EAAMG,EAAIqB,KAC3C5L,EAAM4K,UAEJR,GAGFyB,EAAQC,SAASF,EAAIrB,GAGrBsB,EAAQC,SAASW,EAAalG,EAAQvG,GACtCuG,EAAOS,eAAe8D,cAAe,EACrCtB,EAAejD,EAAQgE,KAIvBqB,EAAGrB,GACHhE,EAAOS,eAAe8D,cAAe,EACrCtB,EAAejD,EAAQgE,GAGvBkC,EAAYlG,EAAQvG,IAIxB,SAAS0M,EAAmB1M,GAC1BA,EAAMkK,SAAU,EAChBlK,EAAMwK,QAAU,KAChBxK,EAAM0B,QAAU1B,EAAMyK,SACtBzK,EAAMyK,SAAW,EAGnB,SAASH,EAAQ/D,EAAQgE,GACvB,IAAIvK,EAAQuG,EAAOS,eACfoD,EAAOpK,EAAMoK,KACbwB,EAAK5L,EAAMwK,QACf,GAAkB,oBAAPoB,EAAmB,MAAM,IAAI1C,EAExC,GADAwD,EAAmB1M,GACfuK,EAAIiC,EAAajG,EAAQvG,EAAOoK,EAAMG,EAAIqB,OAAS,CAErD,IAAIjG,EAAWgH,EAAW3M,IAAUuG,EAAOuD,UAEtCnE,GAAa3F,EAAMmK,QAAWnK,EAAMqK,mBAAoBrK,EAAM0K,iBACjEkC,EAAYrG,EAAQvG,GAGlBoK,EACFyB,EAAQC,SAASe,EAAYtG,EAAQvG,EAAO2F,EAAUiG,GAEtDiB,EAAWtG,EAAQvG,EAAO2F,EAAUiG,IAK1C,SAASiB,EAAWtG,EAAQvG,EAAO2F,EAAUiG,GACtCjG,GAAUmH,EAAavG,EAAQvG,GACpCA,EAAM4K,YACNgB,IACAa,EAAYlG,EAAQvG,GAMtB,SAAS8M,EAAavG,EAAQvG,GACP,IAAjBA,EAAM0B,QAAgB1B,EAAM4J,YAC9B5J,EAAM4J,WAAY,EAClBrD,EAAOwG,KAAK,UAKhB,SAASH,EAAYrG,EAAQvG,GAC3BA,EAAMqK,kBAAmB,EACzB,IAAIrG,EAAQhE,EAAM0K,gBAElB,GAAInE,EAAO+E,SAAWtH,GAASA,EAAME,KAAM,CAEzC,IAAI8I,EAAIhN,EAAMiL,qBACVgC,EAAS,IAAI9G,MAAM6G,GACnBE,EAASlN,EAAMkL,mBACnBgC,EAAOlJ,MAAQA,EACf,IAAImJ,EAAQ,EACRC,GAAa,EAEjB,MAAOpJ,EACLiJ,EAAOE,GAASnJ,EACXA,EAAMmI,QAAOiB,GAAa,GAC/BpJ,EAAQA,EAAME,KACdiJ,GAAS,EAGXF,EAAOG,WAAaA,EACpBb,EAAQhG,EAAQvG,GAAO,EAAMA,EAAM0B,OAAQuL,EAAQ,GAAIC,EAAOlF,QAG9DhI,EAAM4K,YACN5K,EAAM2K,oBAAsB,KAExBuC,EAAOhJ,MACTlE,EAAMkL,mBAAqBgC,EAAOhJ,KAClCgJ,EAAOhJ,KAAO,MAEdlE,EAAMkL,mBAAqB,IAAIpD,EAAc9H,GAG/CA,EAAMiL,qBAAuB,MACxB,CAEL,MAAOjH,EAAO,CACZ,IAAIyE,EAAQzE,EAAMyE,MACdwD,EAAWjI,EAAMiI,SACjBL,EAAK5H,EAAM+B,SACXsG,EAAMrM,EAAMM,WAAa,EAAImI,EAAM/G,OAQvC,GAPA6K,EAAQhG,EAAQvG,GAAO,EAAOqM,EAAK5D,EAAOwD,EAAUL,GACpD5H,EAAQA,EAAME,KACdlE,EAAMiL,uBAKFjL,EAAMkK,QACR,MAIU,OAAVlG,IAAgBhE,EAAM2K,oBAAsB,MAGlD3K,EAAM0K,gBAAkB1G,EACxBhE,EAAMqK,kBAAmB,EA2C3B,SAASsC,EAAW3M,GAClB,OAAOA,EAAM6J,QAA2B,IAAjB7J,EAAM0B,QAA0C,OAA1B1B,EAAM0K,kBAA6B1K,EAAM2F,WAAa3F,EAAMkK,QAG3G,SAASmD,EAAU9G,EAAQvG,GACzBuG,EAAOmF,QAAO,SAAUpE,GACtBtH,EAAM4K,YAEFtD,GACFkC,EAAejD,EAAQe,GAGzBtH,EAAM6K,aAAc,EACpBtE,EAAOwG,KAAK,aACZN,EAAYlG,EAAQvG,MAIxB,SAASsN,EAAU/G,EAAQvG,GACpBA,EAAM6K,aAAgB7K,EAAM2J,cACF,oBAAlBpD,EAAOmF,QAA0B1L,EAAM8J,WAKhD9J,EAAM6K,aAAc,EACpBtE,EAAOwG,KAAK,eALZ/M,EAAM4K,YACN5K,EAAM2J,aAAc,EACpBkC,EAAQC,SAASuB,EAAW9G,EAAQvG,KAQ1C,SAASyM,EAAYlG,EAAQvG,GAC3B,IAAIuN,EAAOZ,EAAW3M,GAEtB,GAAIuN,IACFD,EAAU/G,EAAQvG,GAEM,IAApBA,EAAM4K,YACR5K,EAAM2F,UAAW,EACjBY,EAAOwG,KAAK,UAER/M,EAAMgL,cAAa,CAGrB,IAAIwC,EAASjH,EAAOW,iBAEfsG,GAAUA,EAAOxC,aAAewC,EAAOrG,aAC1CZ,EAAOgF,UAMf,OAAOgC,EAGT,SAASE,EAAYlH,EAAQvG,EAAO4L,GAClC5L,EAAM6J,QAAS,EACf4C,EAAYlG,EAAQvG,GAEhB4L,IACE5L,EAAM2F,SAAUkG,EAAQC,SAASF,GAASrF,EAAOT,KAAK,SAAU8F,IAGtE5L,EAAMwH,OAAQ,EACdjB,EAAOlE,UAAW,EAGpB,SAAS4F,EAAeyF,EAAS1N,EAAOsH,GACtC,IAAItD,EAAQ0J,EAAQ1J,MACpB0J,EAAQ1J,MAAQ,KAEhB,MAAOA,EAAO,CACZ,IAAI4H,EAAK5H,EAAM+B,SACf/F,EAAM4K,YACNgB,EAAGtE,GACHtD,EAAQA,EAAME,KAIhBlE,EAAMkL,mBAAmBhH,KAAOwJ,EAtjBlC,EAAQ,OAAR,CAAoBnI,EAAUF,GAyF9B6C,EAAclF,UAAU2K,UAAY,WAClC,IAAIC,EAAUhK,KAAK8G,gBACfmD,EAAM,GAEV,MAAOD,EACLC,EAAIzM,KAAKwM,GACTA,EAAUA,EAAQ1J,KAGpB,OAAO2J,GAGT,WACE,IACEhN,OAAOoB,eAAeiG,EAAclF,UAAW,SAAU,CACvD8K,IAAK3F,EAAaC,WAAU,WAC1B,OAAOxE,KAAK+J,cACX,6EAAmF,aAExF,MAAOzI,KAPX,GAcsB,oBAAX6I,QAAyBA,OAAOC,aAAiE,oBAA3CC,SAASjL,UAAU+K,OAAOC,cACzFnF,EAAkBoF,SAASjL,UAAU+K,OAAOC,aAC5CnN,OAAOoB,eAAesD,EAAUwI,OAAOC,YAAa,CAClD7L,MAAO,SAAezB,GACpB,QAAImI,EAAgBnF,KAAKE,KAAMlD,IAC3BkD,OAAS2B,IACN7E,GAAUA,EAAOsG,0BAA0BkB,OAItDW,EAAkB,SAAyBnI,GACzC,OAAOA,aAAkBkD,MA+B7B2B,EAASvC,UAAUkL,KAAO,WACxB1E,EAAe5F,KAAM,IAAIuF,IA+B3B5D,EAASvC,UAAUmI,MAAQ,SAAU1C,EAAOwD,EAAUL,GACpD,IAAI5L,EAAQ4D,KAAKoD,eACb7C,GAAM,EAENgI,GAASnM,EAAMM,YAAcqI,EAAcF,GAiB/C,OAfI0D,IAAUjJ,EAAO0F,SAASH,KAC5BA,EAAQD,EAAoBC,IAGN,oBAAbwD,IACTL,EAAKK,EACLA,EAAW,MAGTE,EAAOF,EAAW,SAAmBA,IAAUA,EAAWjM,EAAMiK,iBAClD,oBAAP2B,IAAmBA,EAAKnC,GAC/BzJ,EAAM6J,OAAQ8B,EAAc/H,KAAMgI,IAAaO,GAASJ,EAAWnI,KAAM5D,EAAOyI,EAAOmD,MACzF5L,EAAM4K,YACNzG,EAAM+H,EAActI,KAAM5D,EAAOmM,EAAO1D,EAAOwD,EAAUL,IAEpDzH,GAGToB,EAASvC,UAAUmL,KAAO,WACxBvK,KAAKoD,eAAemD,UAGtB5E,EAASvC,UAAUoL,OAAS,WAC1B,IAAIpO,EAAQ4D,KAAKoD,eAEbhH,EAAMmK,SACRnK,EAAMmK,SACDnK,EAAMkK,SAAYlK,EAAMmK,QAAWnK,EAAMqK,mBAAoBrK,EAAM0K,iBAAiBkC,EAAYhJ,KAAM5D,KAI/GuF,EAASvC,UAAUqL,mBAAqB,SAA4BpC,GAGlE,GADwB,kBAAbA,IAAuBA,EAAWA,EAASqC,iBAChD,CAAC,MAAO,OAAQ,QAAS,QAAS,SAAU,SAAU,OAAQ,QAAS,UAAW,WAAY,OAAOC,SAAStC,EAAW,IAAIqC,gBAAkB,GAAI,MAAM,IAAI/E,EAAqB0C,GAExL,OADArI,KAAKoD,eAAeiD,gBAAkBgC,EAC/BrI,MAGT/C,OAAOoB,eAAesD,EAASvC,UAAW,iBAAkB,CAI1D7B,YAAY,EACZ2M,IAAK,WACH,OAAOlK,KAAKoD,gBAAkBpD,KAAKoD,eAAe2G,eAYtD9M,OAAOoB,eAAesD,EAASvC,UAAW,wBAAyB,CAIjE7B,YAAY,EACZ2M,IAAK,WACH,OAAOlK,KAAKoD,eAAelH,iBA4L/ByF,EAASvC,UAAUoI,OAAS,SAAU3C,EAAOwD,EAAUL,GACrDA,EAAG,IAAI3C,EAA2B,cAGpC1D,EAASvC,UAAUsI,QAAU,KAE7B/F,EAASvC,UAAUwL,IAAM,SAAU/F,EAAOwD,EAAUL,GAClD,IAAI5L,EAAQ4D,KAAKoD,eAoBjB,MAlBqB,oBAAVyB,GACTmD,EAAKnD,EACLA,EAAQ,KACRwD,EAAW,MACkB,oBAAbA,IAChBL,EAAKK,EACLA,EAAW,MAGC,OAAVxD,QAA4BgG,IAAVhG,GAAqB7E,KAAKuH,MAAM1C,EAAOwD,GAEzDjM,EAAMmK,SACRnK,EAAMmK,OAAS,EACfvG,KAAKwK,UAIFpO,EAAM6J,QAAQ4D,EAAY7J,KAAM5D,EAAO4L,GACrChI,MAGT/C,OAAOoB,eAAesD,EAASvC,UAAW,iBAAkB,CAI1D7B,YAAY,EACZ2M,IAAK,WACH,OAAOlK,KAAKoD,eAAetF,UAuF/Bb,OAAOoB,eAAesD,EAASvC,UAAW,YAAa,CAIrD7B,YAAY,EACZ2M,IAAK,WACH,YAA4BW,IAAxB7K,KAAKoD,gBAIFpD,KAAKoD,eAAe8C,WAE7B4E,IAAK,SAAavM,GAGXyB,KAAKoD,iBAMVpD,KAAKoD,eAAe8C,UAAY3H,MAGpCoD,EAASvC,UAAUuI,QAAUzC,EAAYyC,QACzChG,EAASvC,UAAU2L,WAAa7F,EAAY8F,UAE5CrJ,EAASvC,UAAUwI,SAAW,SAAUlE,EAAKsE,GAC3CA,EAAGtE,M,qECvrBL,YAEA,IAAIuH,EAEJ,SAAS/M,EAAgBI,EAAKL,EAAKM,GAAiK,OAApJN,KAAOK,EAAOrB,OAAOoB,eAAeC,EAAKL,EAAK,CAAEM,MAAOA,EAAOhB,YAAY,EAAMiB,cAAc,EAAMC,UAAU,IAAkBH,EAAIL,GAAOM,EAAgBD,EAE3M,IAAIyD,EAAW,EAAQ,QAEnBmJ,EAAef,OAAO,eACtBgB,EAAchB,OAAO,cACrBiB,EAASjB,OAAO,SAChBkB,EAASlB,OAAO,SAChBmB,EAAenB,OAAO,eACtBoB,EAAiBpB,OAAO,iBACxBqB,EAAUrB,OAAO,UAErB,SAASsB,EAAiBlN,EAAOmN,GAC/B,MAAO,CACLnN,MAAOA,EACPmN,KAAMA,GAIV,SAASC,EAAeC,GACtB,IAAIC,EAAUD,EAAKV,GAEnB,GAAgB,OAAZW,EAAkB,CACpB,IAAIxL,EAAOuL,EAAKJ,GAASM,OAIZ,OAATzL,IACFuL,EAAKN,GAAgB,KACrBM,EAAKV,GAAgB,KACrBU,EAAKT,GAAe,KACpBU,EAAQJ,EAAiBpL,GAAM,MAKrC,SAAS0L,EAAWH,GAGlB3D,EAAQC,SAASyD,EAAgBC,GAGnC,SAASI,EAAYC,EAAaL,GAChC,OAAO,SAAUC,EAASK,GACxBD,EAAYE,MAAK,WACXP,EAAKP,GACPQ,EAAQJ,OAAiBZ,GAAW,IAItCe,EAAKL,GAAgBM,EAASK,KAC7BA,IAIP,IAAIE,EAAyBnP,OAAOoP,gBAAe,eAC/CC,EAAuCrP,OAAOsP,gBAAgBtB,EAAwB,CACxF,aACE,OAAOjL,KAAKwL,IAGdlL,KAAM,WACJ,IAAI6D,EAAQnE,KAIRgE,EAAQhE,KAAKoL,GAEjB,GAAc,OAAVpH,EACF,OAAOwI,QAAQN,OAAOlI,GAGxB,GAAIhE,KAAKqL,GACP,OAAOmB,QAAQX,QAAQJ,OAAiBZ,GAAW,IAGrD,GAAI7K,KAAKwL,GAAStF,UAKhB,OAAO,IAAIsG,SAAQ,SAAUX,EAASK,GACpCjE,EAAQC,UAAS,WACX/D,EAAMiH,GACRc,EAAO/H,EAAMiH,IAEbS,EAAQJ,OAAiBZ,GAAW,UAU5C,IACI4B,EADAR,EAAcjM,KAAKsL,GAGvB,GAAIW,EACFQ,EAAU,IAAID,QAAQR,EAAYC,EAAajM,WAC1C,CAGL,IAAIK,EAAOL,KAAKwL,GAASM,OAEzB,GAAa,OAATzL,EACF,OAAOmM,QAAQX,QAAQJ,EAAiBpL,GAAM,IAGhDoM,EAAU,IAAID,QAAQxM,KAAKuL,IAI7B,OADAvL,KAAKsL,GAAgBmB,EACdA,IAERvO,EAAgB+M,EAAuBd,OAAOuC,eAAe,WAC9D,OAAO1M,QACL9B,EAAgB+M,EAAuB,UAAU,WACnD,IAAI0B,EAAS3M,KAKb,OAAO,IAAIwM,SAAQ,SAAUX,EAASK,GACpCS,EAAOnB,GAAS7D,QAAQ,MAAM,SAAUjE,GAClCA,EACFwI,EAAOxI,GAITmI,EAAQJ,OAAiBZ,GAAW,aAGtCI,GAAwBmB,GAExBQ,EAAoC,SAA2CjK,GACjF,IAAIkK,EAEAC,EAAW7P,OAAO8P,OAAOT,GAAuCO,EAAiB,GAAI3O,EAAgB2O,EAAgBrB,EAAS,CAChIjN,MAAOoE,EACPlE,UAAU,IACRP,EAAgB2O,EAAgB3B,EAAc,CAChD3M,MAAO,KACPE,UAAU,IACRP,EAAgB2O,EAAgB1B,EAAa,CAC/C5M,MAAO,KACPE,UAAU,IACRP,EAAgB2O,EAAgBzB,EAAQ,CAC1C7M,MAAO,KACPE,UAAU,IACRP,EAAgB2O,EAAgBxB,EAAQ,CAC1C9M,MAAOoE,EAAOW,eAAeC,WAC7B9E,UAAU,IACRP,EAAgB2O,EAAgBtB,EAAgB,CAClDhN,MAAO,SAAesN,EAASK,GAC7B,IAAI7L,EAAOyM,EAAStB,GAASM,OAEzBzL,GACFyM,EAASxB,GAAgB,KACzBwB,EAAS5B,GAAgB,KACzB4B,EAAS3B,GAAe,KACxBU,EAAQJ,EAAiBpL,GAAM,MAE/ByM,EAAS5B,GAAgBW,EACzBiB,EAAS3B,GAAee,IAG5BzN,UAAU,IACRoO,IA8BJ,OA7BAC,EAASxB,GAAgB,KACzBvJ,EAASY,GAAQ,SAAUe,GACzB,GAAIA,GAAoB,+BAAbA,EAAIsJ,KAAuC,CACpD,IAAId,EAASY,EAAS3B,GAWtB,OARe,OAAXe,IACFY,EAASxB,GAAgB,KACzBwB,EAAS5B,GAAgB,KACzB4B,EAAS3B,GAAe,KACxBe,EAAOxI,SAGToJ,EAAS1B,GAAU1H,GAIrB,IAAImI,EAAUiB,EAAS5B,GAEP,OAAZW,IACFiB,EAASxB,GAAgB,KACzBwB,EAAS5B,GAAgB,KACzB4B,EAAS3B,GAAe,KACxBU,EAAQJ,OAAiBZ,GAAW,KAGtCiC,EAASzB,IAAU,KAErB1I,EAAOoB,GAAG,WAAYgI,EAAWkB,KAAK,KAAMH,IACrCA,GAGTnQ,EAAOC,QAAUgQ,I,2DC9MjB,YA2BA,IAAIM,EAAajQ,OAAOD,MAAQ,SAAUsB,GACxC,IAAItB,EAAO,GAEX,IAAK,IAAIiB,KAAOK,EACdtB,EAAKQ,KAAKS,GAGZ,OAAOjB,GAKTL,EAAOC,QAAUgF,EAEjB,IAAIF,EAAW,EAAQ,QAEnBC,EAAW,EAAQ,QAEvB,EAAQ,OAAR,CAAoBC,EAAQF,GAM1B,IAFA,IAAI1E,EAAOkQ,EAAWvL,EAASvC,WAEtBe,EAAI,EAAGA,EAAInD,EAAKc,OAAQqC,IAAK,CACpC,IAAIgN,EAASnQ,EAAKmD,GACbyB,EAAOxC,UAAU+N,KAASvL,EAAOxC,UAAU+N,GAAUxL,EAASvC,UAAU+N,IAIjF,SAASvL,EAAO7F,GACd,KAAMiE,gBAAgB4B,GAAS,OAAO,IAAIA,EAAO7F,GACjD2F,EAAS5B,KAAKE,KAAMjE,GACpB4F,EAAS7B,KAAKE,KAAMjE,GACpBiE,KAAKoN,eAAgB,EAEjBrR,KACuB,IAArBA,EAAQiH,WAAoBhD,KAAKgD,UAAW,IACvB,IAArBjH,EAAQ0C,WAAoBuB,KAAKvB,UAAW,IAElB,IAA1B1C,EAAQqR,gBACVpN,KAAKoN,eAAgB,EACrBpN,KAAKkC,KAAK,MAAOsB,KAiCvB,SAASA,IAEHxD,KAAKoD,eAAeQ,OAGxBqE,EAAQC,SAASmF,EAASrN,MAG5B,SAASqN,EAAQC,GACfA,EAAK1C,MArCP3N,OAAOoB,eAAeuD,EAAOxC,UAAW,wBAAyB,CAI/D7B,YAAY,EACZ2M,IAAK,WACH,OAAOlK,KAAKoD,eAAelH,iBAG/Be,OAAOoB,eAAeuD,EAAOxC,UAAW,iBAAkB,CAIxD7B,YAAY,EACZ2M,IAAK,WACH,OAAOlK,KAAKoD,gBAAkBpD,KAAKoD,eAAe2G,eAGtD9M,OAAOoB,eAAeuD,EAAOxC,UAAW,iBAAkB,CAIxD7B,YAAY,EACZ2M,IAAK,WACH,OAAOlK,KAAKoD,eAAetF,UAgB/Bb,OAAOoB,eAAeuD,EAAOxC,UAAW,YAAa,CAInD7B,YAAY,EACZ2M,IAAK,WACH,YAA4BW,IAAxB7K,KAAKsD,qBAAwDuH,IAAxB7K,KAAKoD,iBAIvCpD,KAAKsD,eAAe4C,WAAalG,KAAKoD,eAAe8C,YAE9D4E,IAAK,SAAavM,QAGYsM,IAAxB7K,KAAKsD,qBAAwDuH,IAAxB7K,KAAKoD,iBAM9CpD,KAAKsD,eAAe4C,UAAY3H,EAChCyB,KAAKoD,eAAe8C,UAAY3H,Q,6CCvIpC,IAAIe,EAAS,EAAQ,QAAUA,OAC3BiO,EAAa,EAAQ,QACrBC,EAAM,EAAQ,QACdC,EAAK,EAAQ,QAAYC,GACzBC,EAAK,EAAQ,QACbC,EAAY,EAAQ,QACpBC,EAAS,EAAQ,QAErB,SAASC,EAAMC,EAAM9P,EAAK+P,EAAUC,EAAUC,GAC5C,IAAIC,EAAOP,EAAU3P,GACrB,GAAIkQ,EAAKC,MAAO,CAEd,GAAiB,UAAbH,GAAqC,cAAbA,EAA0B,MAAM,IAAII,MAAM,0BACtE,OAAOC,EAAOP,EAAMI,GACf,GAAkB,QAAdA,EAAKI,KAAgB,CAC9B,GAAiB,QAAbN,EAAoB,MAAM,IAAII,MAAM,0BACxC,OAAOG,EAAQT,EAAMI,EAAMH,GAE3B,GAAiB,QAAbC,GAAmC,cAAbA,EAA0B,MAAM,IAAII,MAAM,0BAEtEN,EAAOzO,EAAOmP,OAAO,CAACP,EAAKH,IAC3B,IAAItF,EAAM0F,EAAKO,QAAQC,aACnBC,EAAM,CAAC,EAAG,GACd,MAAOb,EAAKjQ,OAAS8Q,EAAI9Q,OAAS,EAAI2K,EAAKmG,EAAIpR,KAAK,KACpDoR,EAAIpR,KAAK,GACT,IAAII,GAAK,EACT,QAASA,EAAImQ,EAAKjQ,OAAQ8Q,EAAIpR,KAAKuQ,EAAKnQ,IAExC,IAAIqM,EAAMuD,EAAIoB,EAAKT,GACnB,OAAOlE,EAGT,SAASqE,EAAQP,EAAMI,GACrB,IAAIU,EAAUhB,EAAOM,EAAKC,MAAMU,KAAK,MACrC,IAAKD,EAAS,MAAM,IAAIR,MAAM,iBAAmBF,EAAKC,MAAMU,KAAK,MAEjE,IAAIV,EAAQ,IAAIX,EAAGoB,GACf5Q,EAAMmQ,EAAMW,eAAeZ,EAAKa,YAChC/E,EAAMhM,EAAI6P,KAAKC,GAEnB,OAAOzO,EAAOwF,KAAKmF,EAAIgF,SAGzB,SAAST,EAAST,EAAMI,EAAMe,GAC5B,IAKIC,EALAC,EAAIjB,EAAKkB,OAAOC,SAChB7O,EAAI0N,EAAKkB,OAAO5O,EAChB8O,EAAIpB,EAAKkB,OAAOE,EAChBC,EAAIrB,EAAKkB,OAAOG,EAChBC,EAAI,IAAI9B,EAAG,GAEX+B,EAAIC,EAAS5B,EAAMwB,GAAGK,IAAIL,GAC1B/O,GAAI,EACJqP,EAAKC,EAAOV,EAAGG,EAAGxB,EAAMmB,GAC5B,OAAa,IAAN1O,EACL2O,EAAIY,EAAQR,EAAGM,EAAIX,GACnBO,EAAIO,EAAMR,EAAGL,EAAG1O,EAAG8O,GACnB/O,EAAI2O,EAAEc,KAAKV,GAAGW,KAAKR,EAAES,IAAIf,EAAEgB,IAAIX,KAAKG,IAAIL,GACtB,IAAd/O,EAAE6P,KAAK,KACT7P,GAAI,EACJiP,EAAI,IAAI9B,EAAG,IAGf,OAAOsB,EAAMQ,EAAGjP,GAGlB,SAASyO,EAAOQ,EAAGjP,GACjBiP,EAAIA,EAAEa,UACN9P,EAAIA,EAAE8P,UAGK,IAAPb,EAAE,KAAWA,EAAI,CAAC,GAAGhB,OAAOgB,IACrB,IAAPjP,EAAE,KAAWA,EAAI,CAAC,GAAGiO,OAAOjO,IAEhC,IAAI+P,EAAQd,EAAE3R,OAAS0C,EAAE1C,OAAS,EAC9B0S,EAAM,CAAC,GAAMD,EAAO,EAAMd,EAAE3R,QAEhC,OADA0S,EAAMA,EAAI/B,OAAOgB,EAAG,CAAC,EAAMjP,EAAE1C,QAAS0C,GAC/BlB,EAAOwF,KAAK0L,GAGrB,SAASV,EAAQV,EAAGG,EAAGxB,EAAMmB,GAE3B,GADAE,EAAI9P,EAAOwF,KAAKsK,EAAEkB,WACdlB,EAAEtR,OAASyR,EAAEZ,aAAc,CAC7B,IAAI8B,EAAQnR,EAAOqB,MAAM4O,EAAEZ,aAAeS,EAAEtR,QAC5CsR,EAAI9P,EAAOmP,OAAO,CAACgC,EAAOrB,IAE5B,IAAIsB,EAAO3C,EAAKjQ,OACZ6S,EAAQC,EAAY7C,EAAMwB,GAC1BpP,EAAIb,EAAOqB,MAAM+P,GACrBvQ,EAAE0Q,KAAK,GACP,IAAI1B,EAAI7P,EAAOqB,MAAM+P,GAKrB,OAJAvB,EAAI5B,EAAW2B,EAAMC,GAAG2B,OAAO3Q,GAAG2Q,OAAOxR,EAAOwF,KAAK,CAAC,KAAKgM,OAAO1B,GAAG0B,OAAOH,GAAOI,SACnF5Q,EAAIoN,EAAW2B,EAAMC,GAAG2B,OAAO3Q,GAAG4Q,SAClC5B,EAAI5B,EAAW2B,EAAMC,GAAG2B,OAAO3Q,GAAG2Q,OAAOxR,EAAOwF,KAAK,CAAC,KAAKgM,OAAO1B,GAAG0B,OAAOH,GAAOI,SACnF5Q,EAAIoN,EAAW2B,EAAMC,GAAG2B,OAAO3Q,GAAG4Q,SAC3B,CAAE5B,EAAGA,EAAGhP,EAAGA,GAGpB,SAASwP,EAAUqB,EAAOzB,GACxB,IAAI0B,EAAO,IAAItD,EAAGqD,GACdjQ,GAASiQ,EAAMlT,QAAU,GAAKyR,EAAE2B,YAEpC,OADInQ,EAAQ,GAAGkQ,EAAKE,MAAMpQ,GACnBkQ,EAGT,SAASL,EAAaK,EAAM1B,GAC1B0B,EAAOtB,EAASsB,EAAM1B,GACtB0B,EAAOA,EAAKrB,IAAIL,GAChB,IAAItF,EAAM3K,EAAOwF,KAAKmM,EAAKX,WAC3B,GAAIrG,EAAInM,OAASyR,EAAEZ,aAAc,CAC/B,IAAI8B,EAAQnR,EAAOqB,MAAM4O,EAAEZ,aAAe1E,EAAInM,QAC9CmM,EAAM3K,EAAOmP,OAAO,CAACgC,EAAOxG,IAE9B,OAAOA,EAGT,SAAS8F,EAASR,EAAGM,EAAIX,GACvB,IAAIkC,EACAjC,EAEJ,EAAG,CACDiC,EAAI9R,EAAOqB,MAAM,GAEjB,MAAkB,EAAXyQ,EAAEtT,OAAayR,EAAE2B,YACtBrB,EAAG1P,EAAIoN,EAAW2B,EAAMW,EAAGV,GAAG2B,OAAOjB,EAAG1P,GAAG4Q,SAC3CK,EAAI9R,EAAOmP,OAAO,CAAC2C,EAAGvB,EAAG1P,IAG3BgP,EAAIQ,EAASyB,EAAG7B,GAChBM,EAAGV,EAAI5B,EAAW2B,EAAMW,EAAGV,GAAG2B,OAAOjB,EAAG1P,GAAG2Q,OAAOxR,EAAOwF,KAAK,CAAC,KAAKiM,SACpElB,EAAG1P,EAAIoN,EAAW2B,EAAMW,EAAGV,GAAG2B,OAAOjB,EAAG1P,GAAG4Q,gBACtB,IAAd5B,EAAEkC,IAAI9B,IAEf,OAAOJ,EAGT,SAASa,EAAOR,EAAGL,EAAG1O,EAAG8O,GACvB,OAAOC,EAAE8B,MAAM3D,EAAG4D,KAAK9Q,IAAI+Q,OAAOrC,GAAGsC,UAAU7B,IAAIL,GAGrD5S,EAAOC,QAAUkR,EACjBnR,EAAOC,QAAQkT,OAASA,EACxBnT,EAAOC,QAAQmT,QAAUA,G,wBC9IzB,YAAApT,EAAA,sBAIE,IAHA,IAAImB,EAASvB,KAAKmV,IAAIC,EAAE7T,OAAQ8T,EAAE9T,QAC9BuL,EAAS,IAAI/J,EAAOxB,GAEfF,EAAI,EAAGA,EAAIE,IAAUF,EAC5ByL,EAAOzL,GAAK+T,EAAE/T,GAAKgU,EAAEhU,GAGvB,OAAOyL,K,gECRT,YAEA,SAAS1B,EAAQjE,EAAKsE,GACpB,IAAI7D,EAAQnE,KAER6R,EAAoB7R,KAAKsD,gBAAkBtD,KAAKsD,eAAe4C,UAC/D4L,EAAoB9R,KAAKoD,gBAAkBpD,KAAKoD,eAAe8C,UAEnE,OAAI2L,GAAqBC,GACnB9J,EACFA,EAAGtE,GACMA,IACJ1D,KAAKoD,eAEEpD,KAAKoD,eAAe8D,eAC9BlH,KAAKoD,eAAe8D,cAAe,EACnCe,EAAQC,SAAS6J,EAAa/R,KAAM0D,IAHpCuE,EAAQC,SAAS6J,EAAa/R,KAAM0D,IAOjC1D,OAKLA,KAAKsD,iBACPtD,KAAKsD,eAAe4C,WAAY,GAI9BlG,KAAKoD,iBACPpD,KAAKoD,eAAe8C,WAAY,GAGlClG,KAAK4H,SAASlE,GAAO,MAAM,SAAUA,IAC9BsE,GAAMtE,EACJS,EAAMf,eAECe,EAAMf,eAAe8D,aAI/Be,EAAQC,SAAS8J,EAAa7N,IAH9BA,EAAMf,eAAe8D,cAAe,EACpCe,EAAQC,SAAS+J,EAAqB9N,EAAOT,IAH7CuE,EAAQC,SAAS+J,EAAqB9N,EAAOT,GAOtCsE,GACTC,EAAQC,SAAS8J,EAAa7N,GAC9B6D,EAAGtE,IAEHuE,EAAQC,SAAS8J,EAAa7N,MAI3BnE,MAGT,SAASiS,EAAoB3E,EAAM5J,GACjCqO,EAAYzE,EAAM5J,GAClBsO,EAAY1E,GAGd,SAAS0E,EAAY1E,GACfA,EAAKlK,iBAAmBkK,EAAKlK,eAAe+D,WAC5CmG,EAAKhK,iBAAmBgK,EAAKhK,eAAe6D,WAChDmG,EAAKnE,KAAK,SAGZ,SAAS6B,IACHhL,KAAKsD,iBACPtD,KAAKsD,eAAe4C,WAAY,EAChClG,KAAKsD,eAAe4O,SAAU,EAC9BlS,KAAKsD,eAAeM,OAAQ,EAC5B5D,KAAKsD,eAAeC,YAAa,GAG/BvD,KAAKoD,iBACPpD,KAAKoD,eAAe8C,WAAY,EAChClG,KAAKoD,eAAeQ,OAAQ,EAC5B5D,KAAKoD,eAAe6C,QAAS,EAC7BjG,KAAKoD,eAAe2C,aAAc,EAClC/F,KAAKoD,eAAe6D,aAAc,EAClCjH,KAAKoD,eAAerB,UAAW,EAC/B/B,KAAKoD,eAAe8D,cAAe,GAIvC,SAAS6K,EAAYzE,EAAM5J,GACzB4J,EAAKnE,KAAK,QAASzF,GAGrB,SAASkC,EAAejD,EAAQe,GAM9B,IAAIkG,EAASjH,EAAOW,eAChB6O,EAASxP,EAAOS,eAChBwG,GAAUA,EAAOxC,aAAe+K,GAAUA,EAAO/K,YAAazE,EAAOgF,QAAQjE,GAAUf,EAAOwG,KAAK,QAASzF,GAGlH/G,EAAOC,QAAU,CACf+K,QAASA,EACTqD,UAAWA,EACXpF,eAAgBA,K,6CCtGlB,IAAItG,EAAS,EAAQ,QAAUA,OAC3BqO,EAAK,EAAQ,QACbF,EAAK,EAAQ,QAAYC,GACzBE,EAAY,EAAQ,QACpBC,EAAS,EAAQ,QAErB,SAASuE,EAAQC,EAAKtE,EAAM9P,EAAKgQ,EAAUC,GACzC,IAAIoE,EAAM1E,EAAU3P,GACpB,GAAiB,OAAbqU,EAAI/D,KAAe,CAErB,GAAiB,UAAbN,GAAqC,cAAbA,EAA0B,MAAM,IAAII,MAAM,yBACtE,OAAOkE,EAASF,EAAKtE,EAAMuE,GACtB,GAAiB,QAAbA,EAAI/D,KAAgB,CAC7B,GAAiB,QAAbN,EAAoB,MAAM,IAAII,MAAM,yBACxC,OAAOmE,EAAUH,EAAKtE,EAAMuE,GAE5B,GAAiB,QAAbrE,GAAmC,cAAbA,EAA0B,MAAM,IAAII,MAAM,yBAEtEN,EAAOzO,EAAOmP,OAAO,CAACP,EAAKH,IAC3B,IAAItF,EAAM6J,EAAI5D,QAAQC,aAClBC,EAAM,CAAC,GACP6D,EAAS,EACb,MAAO1E,EAAKjQ,OAAS8Q,EAAI9Q,OAAS,EAAI2K,EACpCmG,EAAIpR,KAAK,KACTiV,IAEF7D,EAAIpR,KAAK,GACT,IAAII,GAAK,EACT,QAASA,EAAImQ,EAAKjQ,OAChB8Q,EAAIpR,KAAKuQ,EAAKnQ,IAEhBgR,EAAMtP,EAAOwF,KAAK8J,GAClB,IAAI8D,EAAM/E,EAAG4D,KAAKe,EAAI5D,SACtB2D,EAAM,IAAI1E,EAAG0E,GAAKf,MAAMoB,GAExBL,EAAMA,EAAIb,OAAO,IAAI7D,EAAG2E,EAAIK,iBAC5BN,EAAM/S,EAAOwF,KAAKuN,EAAIZ,UAAUnB,WAChC,IAAIrG,EAAMwI,EAAS,EAAI,EAAI,EAC3BhK,EAAMlM,KAAKmV,IAAIW,EAAIvU,OAAQ8Q,EAAI9Q,QAC3BuU,EAAIvU,SAAW8Q,EAAI9Q,SAAQmM,EAAM,GAErCrM,GAAK,EACL,QAASA,EAAI6K,EAAKwB,GAAOoI,EAAIzU,GAAKgR,EAAIhR,GACtC,OAAe,IAARqM,EAGT,SAASsI,EAAUF,EAAKtE,EAAMuE,GAC5B,IAAIzD,EAAUhB,EAAOyE,EAAIjS,KAAKuS,UAAUxE,MAAMU,KAAK,MACnD,IAAKD,EAAS,MAAM,IAAIR,MAAM,iBAAmBiE,EAAIjS,KAAKuS,UAAUxE,MAAMU,KAAK,MAE/E,IAAIV,EAAQ,IAAIX,EAAGoB,GACfgE,EAASP,EAAIjS,KAAKyS,kBAAkBzS,KAExC,OAAO+N,EAAMgE,OAAOrE,EAAMsE,EAAKQ,GAGjC,SAASL,EAAWH,EAAKtE,EAAMuE,GAC7B,IAAI7R,EAAI6R,EAAIjS,KAAKI,EACb8O,EAAI+C,EAAIjS,KAAKkP,EACbC,EAAI8C,EAAIjS,KAAKmP,EACbuD,EAAIT,EAAIjS,KAAK2S,QACbC,EAAWrF,EAAUsF,UAAUC,OAAOd,EAAK,OAC3C7R,EAAIyS,EAASzS,EACbiP,EAAIwD,EAASxD,EACjB2D,EAAW5S,EAAG+O,GACd6D,EAAW3D,EAAGF,GACd,IAAI8D,EAAQ1F,EAAG4D,KAAK9Q,GAChB6S,EAAI9S,EAAEyP,KAAKV,GACXpP,EAAIqP,EAAE8B,MAAM+B,GACb7B,OAAO,IAAI7D,EAAGI,GAAMqC,IAAIkD,GAAG1D,IAAIL,IAC/BkC,UACArB,IAAI2C,EAAEzB,MAAM+B,GAAO7B,OAAO/B,EAAEW,IAAIkD,GAAG1D,IAAIL,IAAIkC,WAC3C7B,IAAInP,GACJmP,IAAIL,GACP,OAAoB,IAAbpP,EAAEkR,IAAI5B,GAGf,SAAS2D,EAAYxB,EAAGrC,GACtB,GAAIqC,EAAEvB,KAAK,IAAM,EAAG,MAAM,IAAIhC,MAAM,eACpC,GAAIuD,EAAEP,IAAI9B,IAAMA,EAAG,MAAM,IAAIlB,MAAM,eAGrC1R,EAAOC,QAAUwV,G,oCC1DjBzV,EAAOC,QAAUkF,EAEjB,IAAID,EAAY,EAAQ,QAIxB,SAASC,EAAY/F,GACnB,KAAMiE,gBAAgB8B,GAAc,OAAO,IAAIA,EAAY/F,GAC3D8F,EAAU/B,KAAKE,KAAMjE,GAJvB,EAAQ,OAAR,CAAoB+F,EAAaD,GAOjCC,EAAY1C,UAAUmU,WAAa,SAAU1O,EAAOwD,EAAUL,GAC5DA,EAAG,KAAMnD,K,kCCjCX,IAAI/B,EAEJ,SAASZ,EAAKC,GACZ,IAAIC,GAAS,EACb,OAAO,WACDA,IACJA,GAAS,EACTD,EAAS1E,WAAM,EAAQI,aAI3B,IAAIsH,EAAiB,EAAQ,QAAmBtJ,MAC5C2X,EAAmBrO,EAAeqO,iBAClChO,EAAuBL,EAAeK,qBAE1C,SAAS/C,EAAKiB,GAEZ,GAAIA,EAAK,MAAMA,EAGjB,SAAShB,EAAUC,GACjB,OAAOA,EAAOC,WAAqC,oBAAjBD,EAAOE,MAG3C,SAAS4Q,EAAU9Q,EAAQuP,EAAS5L,EAASnE,GAC3CA,EAAWD,EAAKC,GAChB,IAAIuR,GAAS,EACb/Q,EAAOoB,GAAG,SAAS,WACjB2P,GAAS,UAEC7I,IAAR/H,IAAmBA,EAAM,EAAQ,SACrCA,EAAIH,EAAQ,CACVK,SAAUkP,EACVzT,SAAU6H,IACT,SAAU5C,GACX,GAAIA,EAAK,OAAOvB,EAASuB,GACzBgQ,GAAS,EACTvR,OAEF,IAAI+D,GAAY,EAChB,OAAO,SAAUxC,GACf,IAAIgQ,IACAxN,EAGJ,OAFAA,GAAY,EAERxD,EAAUC,GAAgBA,EAAOE,QACP,oBAAnBF,EAAOgF,QAA+BhF,EAAOgF,eACxDxF,EAASuB,GAAO,IAAI8B,EAAqB,UAI7C,SAAS1F,EAAK6T,GACZA,IAGF,SAASrJ,EAAKxF,EAAM8O,GAClB,OAAO9O,EAAKwF,KAAKsJ,GAGnB,SAASC,EAAYC,GACnB,OAAKA,EAAQhW,OAC8B,oBAAhCgW,EAAQA,EAAQhW,OAAS,GAA0B2E,EACvDqR,EAAQC,MAFatR,EAK9B,SAAST,IACP,IAAK,IAAIK,EAAOxE,UAAUC,OAAQgW,EAAU,IAAIvR,MAAMF,GAAOG,EAAO,EAAGA,EAAOH,EAAMG,IAClFsR,EAAQtR,GAAQ3E,UAAU2E,GAG5B,IAOIwB,EAPA7B,EAAW0R,EAAYC,GAG3B,GAFIvR,MAAMyR,QAAQF,EAAQ,MAAKA,EAAUA,EAAQ,IAE7CA,EAAQhW,OAAS,EACnB,MAAM,IAAI0V,EAAiB,WAI7B,IAAIS,EAAWH,EAAQI,KAAI,SAAUvR,EAAQ/E,GAC3C,IAAIsU,EAAUtU,EAAIkW,EAAQhW,OAAS,EAC/BwI,EAAU1I,EAAI,EAClB,OAAO6V,EAAU9Q,EAAQuP,EAAS5L,GAAS,SAAU5C,GAC9CM,IAAOA,EAAQN,GAChBA,GAAKuQ,EAASjW,QAAQ8B,GACtBoS,IACJ+B,EAASjW,QAAQ8B,GACjBqC,EAAS6B,UAGb,OAAO8P,EAAQK,OAAO7J,GAGxB3N,EAAOC,QAAUoF,G,4oEC9FjB,IAAI1C,EAAS,EAAQ,QAAUA,OAC3B8U,EAAa,EAAQ,QAAUA,WAInC,SAASC,EAAS1C,EAAGC,GAGnB,IAAKtS,EAAO0F,SAAS2M,KAAOrS,EAAO0F,SAAS4M,GAC1C,OAAO,EAMT,GAAID,EAAE7T,SAAW8T,EAAE9T,OACjB,OAAO,EAIT,IADA,IAAIoD,EAAI,EACCtD,EAAI,EAAGA,EAAI+T,EAAE7T,OAAQF,IAE5BsD,GAAKyQ,EAAE/T,GAAKgU,EAAEhU,GAEhB,OAAa,IAANsD,EArBTvE,EAAOC,QAAUyX,EAwBjBA,EAASC,QAAU,WACjBhV,EAAOF,UAAUmV,MAAQH,EAAWhV,UAAUmV,MAAQ,SAAeC,GACnE,OAAOH,EAASrU,KAAMwU,KAI1B,IAAIC,EAAenV,EAAOF,UAAUmV,MAChCG,EAAmBN,EAAWhV,UAAUmV,MAC5CF,EAASM,QAAU,WACjBrV,EAAOF,UAAUmV,MAAQE,EACzBL,EAAWhV,UAAUmV,MAAQG,I,qBCvC/B,IAAIpV,EAAS,EAAQ,QAAUA,OAC3BsV,EAAa,EAAQ,QACrBjS,EAAS,EAAQ,QACjBkS,EAAW,EAAQ,QACnB/G,EAAO,EAAQ,QACfsE,EAAS,EAAQ,QAEjB0C,EAAa,EAAQ,QAMzB,SAASC,EAAMnC,GACbjQ,EAAOhB,SAAS7B,KAAKE,MAErB,IAAIK,EAAOyU,EAAWlC,GACtB,IAAKvS,EAAM,MAAM,IAAIgO,MAAM,0BAE3BrO,KAAKgV,UAAY3U,EAAK0N,KACtB/N,KAAKiV,MAAQL,EAAWvU,EAAK0N,MAC7B/N,KAAKkV,KAAO7U,EAAK8U,GACjBnV,KAAKoV,UAAY/U,EAAKyN,KAwBxB,SAASuH,EAAQzC,GACfjQ,EAAOhB,SAAS7B,KAAKE,MAErB,IAAIK,EAAOyU,EAAWlC,GACtB,IAAKvS,EAAM,MAAM,IAAIgO,MAAM,0BAE3BrO,KAAKiV,MAAQL,EAAWvU,EAAK0N,MAC7B/N,KAAKkV,KAAO7U,EAAK8U,GACjBnV,KAAKoV,UAAY/U,EAAKyN,KAwBxB,SAASwH,EAAY1C,GACnB,OAAO,IAAImC,EAAKnC,GAGlB,SAAS2C,EAAc3C,GACrB,OAAO,IAAIyC,EAAOzC,GA3EpB3V,OAAOD,KAAK8X,GAAY9W,SAAQ,SAAUC,GACxC6W,EAAW7W,GAAKkX,GAAK7V,EAAOwF,KAAKgQ,EAAW7W,GAAKkX,GAAI,OACrDL,EAAW7W,EAAIyM,eAAiBoK,EAAW7W,MAc7C4W,EAASE,EAAMpS,EAAOhB,UAEtBoT,EAAK3V,UAAUoI,OAAS,SAAiBnH,EAAMiB,EAAGoK,GAChD1L,KAAKiV,MAAMnE,OAAOzQ,GAClBqL,KAGFqJ,EAAK3V,UAAU0R,OAAS,SAAiBzQ,EAAMmV,GAI7C,MAHoB,kBAATnV,IAAmBA,EAAOf,EAAOwF,KAAKzE,EAAMmV,IAEvDxV,KAAKiV,MAAMnE,OAAOzQ,GACXL,MAGT+U,EAAK3V,UAAU0O,KAAO,SAAqB7P,EAAKuX,GAC9CxV,KAAK4K,MACL,IAAImD,EAAO/N,KAAKiV,MAAMlE,SAClBsB,EAAMvE,EAAKC,EAAM9P,EAAK+B,KAAKgV,UAAWhV,KAAKoV,UAAWpV,KAAKkV,MAE/D,OAAOM,EAAMnD,EAAIoD,SAASD,GAAOnD,GAanCwC,EAASQ,EAAQ1S,EAAOhB,UAExB0T,EAAOjW,UAAUoI,OAAS,SAAiBnH,EAAMiB,EAAGoK,GAClD1L,KAAKiV,MAAMnE,OAAOzQ,GAClBqL,KAGF2J,EAAOjW,UAAU0R,OAAS,SAAiBzQ,EAAMmV,GAI/C,MAHoB,kBAATnV,IAAmBA,EAAOf,EAAOwF,KAAKzE,EAAMmV,IAEvDxV,KAAKiV,MAAMnE,OAAOzQ,GACXL,MAGTqV,EAAOjW,UAAUgT,OAAS,SAAuBnU,EAAKoU,EAAKmD,GACtC,kBAARnD,IAAkBA,EAAM/S,EAAOwF,KAAKuN,EAAKmD,IAEpDxV,KAAK4K,MACL,IAAImD,EAAO/N,KAAKiV,MAAMlE,SACtB,OAAOqB,EAAOC,EAAKtE,EAAM9P,EAAK+B,KAAKoV,UAAWpV,KAAKkV,OAWrDvY,EAAOC,QAAU,CACfmY,KAAMO,EACND,OAAQE,EACRD,WAAYA,EACZC,aAAcA,I,sBC1FhB,2BACE,aAGA,SAASG,EAAQC,EAAKC,GACpB,IAAKD,EAAK,MAAM,IAAItH,MAAMuH,GAAO,oBAKnC,SAASf,EAAUgB,EAAMC,GACvBD,EAAKE,OAASD,EACd,IAAIE,EAAW,aACfA,EAAS5W,UAAY0W,EAAU1W,UAC/ByW,EAAKzW,UAAY,IAAI4W,EACrBH,EAAKzW,UAAU6W,YAAcJ,EAK/B,SAASlI,EAAIuI,EAAQC,EAAMC,GACzB,GAAIzI,EAAG0I,KAAKH,GACV,OAAOA,EAGTlW,KAAKsW,SAAW,EAChBtW,KAAKuW,MAAQ,KACbvW,KAAKlC,OAAS,EAGdkC,KAAK0S,IAAM,KAEI,OAAXwD,IACW,OAATC,GAA0B,OAATA,IACnBC,EAASD,EACTA,EAAO,IAGTnW,KAAKwW,MAAMN,GAAU,EAAGC,GAAQ,GAAIC,GAAU,OAYlD,IAAI9W,EATkB,kBAAX3C,EACTA,EAAOC,QAAU+Q,EAEjB/Q,EAAQ+Q,GAAKA,EAGfA,EAAGA,GAAKA,EACRA,EAAG8I,SAAW,GAGd,IACEnX,EAAS,EAAQ,GAAUA,OAC3B,MAAOoX,IAoIT,SAASC,EAAUxV,EAAKyV,EAAOhM,GAI7B,IAHA,IAAI6E,EAAI,EACJhH,EAAMlM,KAAKmV,IAAIvQ,EAAIrD,OAAQ8M,GAC3BiM,EAAI,EACCjZ,EAAIgZ,EAAOhZ,EAAI6K,EAAK7K,IAAK,CAChC,IAIIgU,EAJA1Q,EAAIC,EAAI2V,WAAWlZ,GAAK,GAE5B6R,IAAM,EAMJmC,EADE1Q,GAAK,IAAMA,GAAK,GACdA,EAAI,GAAK,GAGJA,GAAK,IAAMA,GAAK,GACrBA,EAAI,GAAK,GAITA,EAGNuO,GAAKmC,EACLiF,GAAKjF,EAIP,OADA8D,IAAa,IAAJmB,GAAW,wBAA0B1V,GACvCsO,EAiCT,SAASsH,EAAW5V,EAAKyV,EAAOhM,EAAKwF,GAInC,IAHA,IAAIX,EAAI,EACJmC,EAAI,EACJnJ,EAAMlM,KAAKmV,IAAIvQ,EAAIrD,OAAQ8M,GACtBhN,EAAIgZ,EAAOhZ,EAAI6K,EAAK7K,IAAK,CAChC,IAAIsD,EAAIC,EAAI2V,WAAWlZ,GAAK,GAE5B6R,GAAKW,EAIHwB,EADE1Q,GAAK,GACHA,EAAI,GAAK,GAGJA,GAAK,GACVA,EAAI,GAAK,GAITA,EAENwU,EAAOxU,GAAK,GAAK0Q,EAAIxB,EAAK,qBAC1BX,GAAKmC,EAEP,OAAOnC,EA0DT,SAASuH,EAAMC,EAAMtX,GACnBsX,EAAKV,MAAQ5W,EAAI4W,MACjBU,EAAKnZ,OAAS6B,EAAI7B,OAClBmZ,EAAKX,SAAW3W,EAAI2W,SACpBW,EAAKvE,IAAM/S,EAAI+S,IA4CjB,SAASlT,IACP,OAAQQ,KAAK0S,IAAM,UAAY,SAAW1S,KAAKyV,SAAS,IAAM,IAlUhE9H,EAAG0I,KAAO,SAAea,GACvB,OAAIA,aAAevJ,GAIJ,OAARuJ,GAA+B,kBAARA,GAC5BA,EAAIjB,YAAYQ,WAAa9I,EAAG8I,UAAYlU,MAAMyR,QAAQkD,EAAIX,QAGlE5I,EAAGwJ,IAAM,SAAcC,EAAMC,GAC3B,OAAID,EAAK/F,IAAIgG,GAAS,EAAUD,EACzBC,GAGT1J,EAAG+D,IAAM,SAAc0F,EAAMC,GAC3B,OAAID,EAAK/F,IAAIgG,GAAS,EAAUD,EACzBC,GAGT1J,EAAGvO,UAAUoX,MAAQ,SAAeN,EAAQC,EAAMC,GAChD,GAAsB,kBAAXF,EACT,OAAOlW,KAAKsX,YAAYpB,EAAQC,EAAMC,GAGxC,GAAsB,kBAAXF,EACT,OAAOlW,KAAKuX,WAAWrB,EAAQC,EAAMC,GAG1B,QAATD,IACFA,EAAO,IAETT,EAAOS,KAAiB,EAAPA,IAAaA,GAAQ,GAAKA,GAAQ,IAEnDD,EAASA,EAAOT,WAAW+B,QAAQ,OAAQ,IAC3C,IAAIZ,EAAQ,EACM,MAAdV,EAAO,IACTU,IAGW,KAATT,EACFnW,KAAKyX,UAAUvB,EAAQU,GAEvB5W,KAAK0X,WAAWxB,EAAQC,EAAMS,GAGd,MAAdV,EAAO,KACTlW,KAAKsW,SAAW,GAGlBtW,KAAK2X,SAEU,OAAXvB,GAEJpW,KAAKuX,WAAWvX,KAAKsQ,UAAW6F,EAAMC,IAGxCzI,EAAGvO,UAAUkY,YAAc,SAAsBpB,EAAQC,EAAMC,GACzDF,EAAS,IACXlW,KAAKsW,SAAW,EAChBJ,GAAUA,GAERA,EAAS,UACXlW,KAAKuW,MAAQ,CAAU,SAATL,GACdlW,KAAKlC,OAAS,GACLoY,EAAS,kBAClBlW,KAAKuW,MAAQ,CACF,SAATL,EACCA,EAAS,SAAa,UAEzBlW,KAAKlC,OAAS,IAEd4X,EAAOQ,EAAS,kBAChBlW,KAAKuW,MAAQ,CACF,SAATL,EACCA,EAAS,SAAa,SACvB,GAEFlW,KAAKlC,OAAS,GAGD,OAAXsY,GAGJpW,KAAKuX,WAAWvX,KAAKsQ,UAAW6F,EAAMC,IAGxCzI,EAAGvO,UAAUmY,WAAa,SAAqBrB,EAAQC,EAAMC,GAG3D,GADAV,EAAgC,kBAAlBQ,EAAOpY,QACjBoY,EAAOpY,QAAU,EAGnB,OAFAkC,KAAKuW,MAAQ,CAAC,GACdvW,KAAKlC,OAAS,EACPkC,KAGTA,KAAKlC,OAASvB,KAAKqb,KAAK1B,EAAOpY,OAAS,GACxCkC,KAAKuW,MAAQ,IAAIhU,MAAMvC,KAAKlC,QAC5B,IAAK,IAAIF,EAAI,EAAGA,EAAIoC,KAAKlC,OAAQF,IAC/BoC,KAAKuW,MAAM3Y,GAAK,EAGlB,IAAIia,EAAGvE,EACHwE,EAAM,EACV,GAAe,OAAX1B,EACF,IAAKxY,EAAIsY,EAAOpY,OAAS,EAAG+Z,EAAI,EAAGja,GAAK,EAAGA,GAAK,EAC9C0V,EAAI4C,EAAOtY,GAAMsY,EAAOtY,EAAI,IAAM,EAAMsY,EAAOtY,EAAI,IAAM,GACzDoC,KAAKuW,MAAMsB,IAAOvE,GAAKwE,EAAO,SAC9B9X,KAAKuW,MAAMsB,EAAI,GAAMvE,IAAO,GAAKwE,EAAQ,SACzCA,GAAO,GACHA,GAAO,KACTA,GAAO,GACPD,UAGC,GAAe,OAAXzB,EACT,IAAKxY,EAAI,EAAGia,EAAI,EAAGja,EAAIsY,EAAOpY,OAAQF,GAAK,EACzC0V,EAAI4C,EAAOtY,GAAMsY,EAAOtY,EAAI,IAAM,EAAMsY,EAAOtY,EAAI,IAAM,GACzDoC,KAAKuW,MAAMsB,IAAOvE,GAAKwE,EAAO,SAC9B9X,KAAKuW,MAAMsB,EAAI,GAAMvE,IAAO,GAAKwE,EAAQ,SACzCA,GAAO,GACHA,GAAO,KACTA,GAAO,GACPD,KAIN,OAAO7X,KAAK2X,UAmCdhK,EAAGvO,UAAUqY,UAAY,SAAoBvB,EAAQU,GAEnD5W,KAAKlC,OAASvB,KAAKqb,MAAM1B,EAAOpY,OAAS8Y,GAAS,GAClD5W,KAAKuW,MAAQ,IAAIhU,MAAMvC,KAAKlC,QAC5B,IAAK,IAAIF,EAAI,EAAGA,EAAIoC,KAAKlC,OAAQF,IAC/BoC,KAAKuW,MAAM3Y,GAAK,EAGlB,IAAIia,EAAGvE,EAEHwE,EAAM,EACV,IAAKla,EAAIsY,EAAOpY,OAAS,EAAG+Z,EAAI,EAAGja,GAAKgZ,EAAOhZ,GAAK,EAClD0V,EAAIqD,EAAST,EAAQtY,EAAGA,EAAI,GAC5BoC,KAAKuW,MAAMsB,IAAOvE,GAAKwE,EAAO,SAE9B9X,KAAKuW,MAAMsB,EAAI,IAAMvE,IAAO,GAAKwE,EAAO,QACxCA,GAAO,GACHA,GAAO,KACTA,GAAO,GACPD,KAGAja,EAAI,IAAMgZ,IACZtD,EAAIqD,EAAST,EAAQU,EAAOhZ,EAAI,GAChCoC,KAAKuW,MAAMsB,IAAOvE,GAAKwE,EAAO,SAC9B9X,KAAKuW,MAAMsB,EAAI,IAAMvE,IAAO,GAAKwE,EAAO,SAE1C9X,KAAK2X,UA8BPhK,EAAGvO,UAAUsY,WAAa,SAAqBxB,EAAQC,EAAMS,GAE3D5W,KAAKuW,MAAQ,CAAC,GACdvW,KAAKlC,OAAS,EAGd,IAAK,IAAIia,EAAU,EAAGC,EAAU,EAAGA,GAAW,SAAWA,GAAW7B,EAClE4B,IAEFA,IACAC,EAAWA,EAAU7B,EAAQ,EAO7B,IALA,IAAI5F,EAAQ2F,EAAOpY,OAAS8Y,EACxBhH,EAAMW,EAAQwH,EACdnN,EAAMrO,KAAKmV,IAAInB,EAAOA,EAAQX,GAAOgH,EAErCqB,EAAO,EACFra,EAAIgZ,EAAOhZ,EAAIgN,EAAKhN,GAAKma,EAChCE,EAAOlB,EAAUb,EAAQtY,EAAGA,EAAIma,EAAS5B,GAEzCnW,KAAKkY,MAAMF,GACPhY,KAAKuW,MAAM,GAAK0B,EAAO,SACzBjY,KAAKuW,MAAM,IAAM0B,EAEjBjY,KAAKmY,OAAOF,GAIhB,GAAY,IAARrI,EAAW,CACb,IAAIwI,EAAM,EAGV,IAFAH,EAAOlB,EAAUb,EAAQtY,EAAGsY,EAAOpY,OAAQqY,GAEtCvY,EAAI,EAAGA,EAAIgS,EAAKhS,IACnBwa,GAAOjC,EAGTnW,KAAKkY,MAAME,GACPpY,KAAKuW,MAAM,GAAK0B,EAAO,SACzBjY,KAAKuW,MAAM,IAAM0B,EAEjBjY,KAAKmY,OAAOF,KAKlBtK,EAAGvO,UAAUS,KAAO,SAAeoX,GACjCA,EAAKV,MAAQ,IAAIhU,MAAMvC,KAAKlC,QAC5B,IAAK,IAAIF,EAAI,EAAGA,EAAIoC,KAAKlC,OAAQF,IAC/BqZ,EAAKV,MAAM3Y,GAAKoC,KAAKuW,MAAM3Y,GAE7BqZ,EAAKnZ,OAASkC,KAAKlC,OACnBmZ,EAAKX,SAAWtW,KAAKsW,SACrBW,EAAKvE,IAAM1S,KAAK0S,KAUlB/E,EAAGvO,UAAUiZ,MAAQ,SAAgBpB,GACnCD,EAAKC,EAAMjX,OAGb2N,EAAGvO,UAAUkZ,MAAQ,WACnB,IAAI7I,EAAI,IAAI9B,EAAG,MAEf,OADA3N,KAAKH,KAAK4P,GACHA,GAGT9B,EAAGvO,UAAUmZ,QAAU,SAAkBC,GACvC,MAAOxY,KAAKlC,OAAS0a,EACnBxY,KAAKuW,MAAMvW,KAAKlC,UAAY,EAE9B,OAAOkC,MAIT2N,EAAGvO,UAAUuY,OAAS,WACpB,MAAO3X,KAAKlC,OAAS,GAAqC,IAAhCkC,KAAKuW,MAAMvW,KAAKlC,OAAS,GACjDkC,KAAKlC,SAEP,OAAOkC,KAAKyY,aAGd9K,EAAGvO,UAAUqZ,UAAY,WAKvB,OAHoB,IAAhBzY,KAAKlC,QAAkC,IAAlBkC,KAAKuW,MAAM,KAClCvW,KAAKsW,SAAW,GAEXtW,MAKa,qBAAXmK,QAAgD,oBAAfA,OAAOuO,IACjD/K,EAAGvO,UAAU+K,OAAOuO,IAAI,+BAAiClZ,EAEzDmO,EAAGvO,UAAUI,QAAUA,EAqCzB,IAAIiR,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,6BAGEkI,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,UAG9DjL,EAAGvO,UAAUqW,SAAW,SAAmBU,EAAM0C,GAI/C,IAAI5O,EACJ,GAJAkM,EAAOA,GAAQ,GACf0C,EAAoB,EAAVA,GAAe,EAGZ,KAAT1C,GAAwB,QAATA,EAAgB,CACjClM,EAAM,GAGN,IAFA,IAAI6N,EAAM,EACNgB,EAAQ,EACHlb,EAAI,EAAGA,EAAIoC,KAAKlC,OAAQF,IAAK,CACpC,IAAI0V,EAAItT,KAAKuW,MAAM3Y,GACfqa,GAA+B,UAArB3E,GAAKwE,EAAOgB,IAAmBrD,SAAS,IACtDqD,EAASxF,IAAO,GAAKwE,EAAQ,SAE3B7N,EADY,IAAV6O,GAAelb,IAAMoC,KAAKlC,OAAS,EAC/B2S,EAAM,EAAIwH,EAAKna,QAAUma,EAAOhO,EAEhCgO,EAAOhO,EAEf6N,GAAO,EACHA,GAAO,KACTA,GAAO,GACPla,KAGU,IAAVkb,IACF7O,EAAM6O,EAAMrD,SAAS,IAAMxL,GAE7B,MAAOA,EAAInM,OAAS+a,IAAY,EAC9B5O,EAAM,IAAMA,EAKd,OAHsB,IAAlBjK,KAAKsW,WACPrM,EAAM,IAAMA,GAEPA,EAGT,GAAIkM,KAAiB,EAAPA,IAAaA,GAAQ,GAAKA,GAAQ,GAAI,CAElD,IAAI4C,EAAYJ,EAAWxC,GAEvB6C,EAAYJ,EAAWzC,GAC3BlM,EAAM,GACN,IAAI/I,EAAIlB,KAAKsY,QACbpX,EAAEoV,SAAW,EACb,OAAQpV,EAAE+X,SAAU,CAClB,IAAIxJ,EAAIvO,EAAEgY,MAAMF,GAAWvD,SAASU,GACpCjV,EAAIA,EAAEiY,MAAMH,GAKV/O,EAHG/I,EAAE+X,SAGCxJ,EAAIxF,EAFJwG,EAAMsI,EAAYtJ,EAAE3R,QAAU2R,EAAIxF,EAKxCjK,KAAKiZ,WACPhP,EAAM,IAAMA,GAEd,MAAOA,EAAInM,OAAS+a,IAAY,EAC9B5O,EAAM,IAAMA,EAKd,OAHsB,IAAlBjK,KAAKsW,WACPrM,EAAM,IAAMA,GAEPA,EAGTyL,GAAO,EAAO,oCAGhB/H,EAAGvO,UAAUga,SAAW,WACtB,IAAI7Y,EAAMP,KAAKuW,MAAM,GASrB,OARoB,IAAhBvW,KAAKlC,OACPyC,GAAuB,SAAhBP,KAAKuW,MAAM,GACO,IAAhBvW,KAAKlC,QAAkC,IAAlBkC,KAAKuW,MAAM,GAEzChW,GAAO,iBAAoC,SAAhBP,KAAKuW,MAAM,GAC7BvW,KAAKlC,OAAS,GACvB4X,GAAO,EAAO,8CAEU,IAAlB1V,KAAKsW,UAAmB/V,EAAMA,GAGxCoN,EAAGvO,UAAUia,OAAS,WACpB,OAAOrZ,KAAKyV,SAAS,GAAI,IAGvBnW,IACFqO,EAAGvO,UAAUka,SAAW,SAAmBlD,EAAQtY,GACjD,OAAOkC,KAAKuZ,YAAYja,EAAQ8W,EAAQtY,KAI5C6P,EAAGvO,UAAUkR,QAAU,SAAkB8F,EAAQtY,GAC/C,OAAOkC,KAAKuZ,YAAYhX,MAAO6T,EAAQtY,IAGzC,IAAI0b,EAAW,SAAmBC,EAAWjB,GAC3C,OAAIiB,EAAU7Y,YACL6Y,EAAU7Y,YAAY4X,GAExB,IAAIiB,EAAUjB,IAwJvB,SAASkB,EAAYxC,GAGnB,IAFA,IAAI5D,EAAI,IAAI/Q,MAAM2U,EAAIhG,aAEbyI,EAAM,EAAGA,EAAMrG,EAAExV,OAAQ6b,IAAO,CACvC,IAAI7B,EAAO6B,EAAM,GAAM,EACnBC,EAAOD,EAAM,GAEjBrG,EAAEqG,GAAQzC,EAAIX,MAAMuB,KAAS8B,EAAQ,EAGvC,OAAOtG,EAmWT,SAASuG,EAAYvM,EAAM4J,EAAKjN,GAC9BA,EAAIqM,SAAWY,EAAIZ,SAAWhJ,EAAKgJ,SACnC,IAAI7N,EAAO6E,EAAKxP,OAASoZ,EAAIpZ,OAAU,EACvCmM,EAAInM,OAAS2K,EACbA,EAAOA,EAAM,EAAK,EAGlB,IAAIkJ,EAAoB,EAAhBrE,EAAKiJ,MAAM,GACf3E,EAAmB,EAAfsF,EAAIX,MAAM,GACd9G,EAAIkC,EAAIC,EAERkI,EAAS,SAAJrK,EACLqJ,EAASrJ,EAAI,SAAa,EAC9BxF,EAAIsM,MAAM,GAAKuD,EAEf,IAAK,IAAI3K,EAAI,EAAGA,EAAI1G,EAAK0G,IAAK,CAM5B,IAHA,IAAI4K,EAASjB,IAAU,GACnBkB,EAAgB,SAARlB,EACRmB,EAAO1d,KAAKmV,IAAIvC,EAAG+H,EAAIpZ,OAAS,GAC3B+Z,EAAItb,KAAK4a,IAAI,EAAGhI,EAAI7B,EAAKxP,OAAS,GAAI+Z,GAAKoC,EAAMpC,IAAK,CAC7D,IAAIja,EAAKuR,EAAI0I,EAAK,EAClBlG,EAAoB,EAAhBrE,EAAKiJ,MAAM3Y,GACfgU,EAAmB,EAAfsF,EAAIX,MAAMsB,GACdpI,EAAIkC,EAAIC,EAAIoI,EACZD,GAAWtK,EAAI,SAAa,EAC5BuK,EAAY,SAAJvK,EAEVxF,EAAIsM,MAAMpH,GAAa,EAAR6K,EACflB,EAAiB,EAATiB,EAQV,OANc,IAAVjB,EACF7O,EAAIsM,MAAMpH,GAAa,EAAR2J,EAEf7O,EAAInM,SAGCmM,EAAI0N,SAxiBbhK,EAAGvO,UAAUma,YAAc,SAAsBE,EAAWrD,EAAQtY,GAClEkC,KAAK2X,SAEL,IAAIhJ,EAAa3O,KAAK2O,aAClBuL,EAAYpc,GAAUvB,KAAK4a,IAAI,EAAGxI,GACtC+G,EAAO/G,GAAcuL,EAAW,yCAChCxE,EAAOwE,EAAY,EAAG,+BAEtB,IAAI1J,EAAMgJ,EAASC,EAAWS,GAC1BC,EAAqB,OAAX/D,EAAkB,KAAO,KAEvC,OADApW,KAAK,eAAiBma,GAAS3J,EAAK7B,GAC7B6B,GAGT7C,EAAGvO,UAAUgb,eAAiB,SAAyB5J,EAAK7B,GAI1D,IAHA,IAAI0L,EAAW,EACXvB,EAAQ,EAEHlb,EAAI,EAAGmD,EAAQ,EAAGnD,EAAIoC,KAAKlC,OAAQF,IAAK,CAC/C,IAAIqa,EAAQjY,KAAKuW,MAAM3Y,IAAMmD,EAAS+X,EAEtCtI,EAAI6J,KAAqB,IAAPpC,EACdoC,EAAW7J,EAAI1S,SACjB0S,EAAI6J,KAAepC,GAAQ,EAAK,KAE9BoC,EAAW7J,EAAI1S,SACjB0S,EAAI6J,KAAepC,GAAQ,GAAM,KAGrB,IAAVlX,GACEsZ,EAAW7J,EAAI1S,SACjB0S,EAAI6J,KAAepC,GAAQ,GAAM,KAEnCa,EAAQ,EACR/X,EAAQ,IAER+X,EAAQb,IAAS,GACjBlX,GAAS,GAIb,GAAIsZ,EAAW7J,EAAI1S,OAAQ,CACzB0S,EAAI6J,KAAcvB,EAElB,MAAOuB,EAAW7J,EAAI1S,OACpB0S,EAAI6J,KAAc,IAKxB1M,EAAGvO,UAAUkb,eAAiB,SAAyB9J,EAAK7B,GAI1D,IAHA,IAAI0L,EAAW7J,EAAI1S,OAAS,EACxBgb,EAAQ,EAEHlb,EAAI,EAAGmD,EAAQ,EAAGnD,EAAIoC,KAAKlC,OAAQF,IAAK,CAC/C,IAAIqa,EAAQjY,KAAKuW,MAAM3Y,IAAMmD,EAAS+X,EAEtCtI,EAAI6J,KAAqB,IAAPpC,EACdoC,GAAY,IACd7J,EAAI6J,KAAepC,GAAQ,EAAK,KAE9BoC,GAAY,IACd7J,EAAI6J,KAAepC,GAAQ,GAAM,KAGrB,IAAVlX,GACEsZ,GAAY,IACd7J,EAAI6J,KAAepC,GAAQ,GAAM,KAEnCa,EAAQ,EACR/X,EAAQ,IAER+X,EAAQb,IAAS,GACjBlX,GAAS,GAIb,GAAIsZ,GAAY,EAAG,CACjB7J,EAAI6J,KAAcvB,EAElB,MAAOuB,GAAY,EACjB7J,EAAI6J,KAAc,IAKpB9d,KAAKge,MACP5M,EAAGvO,UAAUob,WAAa,SAAqBlH,GAC7C,OAAO,GAAK/W,KAAKge,MAAMjH,IAGzB3F,EAAGvO,UAAUob,WAAa,SAAqBlH,GAC7C,IAAIlC,EAAIkC,EACJ7D,EAAI,EAiBR,OAhBI2B,GAAK,OACP3B,GAAK,GACL2B,KAAO,IAELA,GAAK,KACP3B,GAAK,EACL2B,KAAO,GAELA,GAAK,IACP3B,GAAK,EACL2B,KAAO,GAELA,GAAK,IACP3B,GAAK,EACL2B,KAAO,GAEF3B,EAAI2B,GAIfzD,EAAGvO,UAAUqb,UAAY,SAAoBnH,GAE3C,GAAU,IAANA,EAAS,OAAO,GAEpB,IAAIlC,EAAIkC,EACJ7D,EAAI,EAoBR,OAnBqB,KAAZ,KAAJ2B,KACH3B,GAAK,GACL2B,KAAO,IAEU,KAAV,IAAJA,KACH3B,GAAK,EACL2B,KAAO,GAES,KAAT,GAAJA,KACH3B,GAAK,EACL2B,KAAO,GAES,KAAT,EAAJA,KACH3B,GAAK,EACL2B,KAAO,GAES,KAAT,EAAJA,IACH3B,IAEKA,GAIT9B,EAAGvO,UAAU8R,UAAY,WACvB,IAAIoC,EAAItT,KAAKuW,MAAMvW,KAAKlC,OAAS,GAC7B4c,EAAK1a,KAAKwa,WAAWlH,GACzB,OAA2B,IAAnBtT,KAAKlC,OAAS,GAAU4c,GAiBlC/M,EAAGvO,UAAUub,SAAW,WACtB,GAAI3a,KAAKiZ,SAAU,OAAO,EAG1B,IADA,IAAIxJ,EAAI,EACC7R,EAAI,EAAGA,EAAIoC,KAAKlC,OAAQF,IAAK,CACpC,IAAIgU,EAAI5R,KAAKya,UAAUza,KAAKuW,MAAM3Y,IAElC,GADA6R,GAAKmC,EACK,KAANA,EAAU,MAEhB,OAAOnC,GAGT9B,EAAGvO,UAAUuP,WAAa,WACxB,OAAOpS,KAAKqb,KAAK5X,KAAKkR,YAAc,IAGtCvD,EAAGvO,UAAUwb,OAAS,SAAiBC,GACrC,OAAsB,IAAlB7a,KAAKsW,SACAtW,KAAK8a,MAAMC,MAAMF,GAAOG,MAAM,GAEhChb,KAAKsY,SAGd3K,EAAGvO,UAAU6b,SAAW,SAAmBJ,GACzC,OAAI7a,KAAKkb,MAAML,EAAQ,GACd7a,KAAKmb,KAAKN,GAAOG,MAAM,GAAGI,OAE5Bpb,KAAKsY,SAGd3K,EAAGvO,UAAUic,MAAQ,WACnB,OAAyB,IAAlBrb,KAAKsW,UAId3I,EAAGvO,UAAUkc,IAAM,WACjB,OAAOtb,KAAKsY,QAAQ8C,QAGtBzN,EAAGvO,UAAUgc,KAAO,WAKlB,OAJKpb,KAAKiZ,WACRjZ,KAAKsW,UAAY,GAGZtW,MAIT2N,EAAGvO,UAAUmc,KAAO,SAAerE,GACjC,MAAOlX,KAAKlC,OAASoZ,EAAIpZ,OACvBkC,KAAKuW,MAAMvW,KAAKlC,UAAY,EAG9B,IAAK,IAAIF,EAAI,EAAGA,EAAIsZ,EAAIpZ,OAAQF,IAC9BoC,KAAKuW,MAAM3Y,GAAKoC,KAAKuW,MAAM3Y,GAAKsZ,EAAIX,MAAM3Y,GAG5C,OAAOoC,KAAK2X,UAGdhK,EAAGvO,UAAUoc,IAAM,SAActE,GAE/B,OADAxB,EAA0C,KAAlC1V,KAAKsW,SAAWY,EAAIZ,WACrBtW,KAAKub,KAAKrE,IAInBvJ,EAAGvO,UAAUqc,GAAK,SAAavE,GAC7B,OAAIlX,KAAKlC,OAASoZ,EAAIpZ,OAAekC,KAAKsY,QAAQkD,IAAItE,GAC/CA,EAAIoB,QAAQkD,IAAIxb,OAGzB2N,EAAGvO,UAAUsc,IAAM,SAAcxE,GAC/B,OAAIlX,KAAKlC,OAASoZ,EAAIpZ,OAAekC,KAAKsY,QAAQiD,KAAKrE,GAChDA,EAAIoB,QAAQiD,KAAKvb,OAI1B2N,EAAGvO,UAAUuc,MAAQ,SAAgBzE,GAEnC,IAAItF,EAEFA,EADE5R,KAAKlC,OAASoZ,EAAIpZ,OAChBoZ,EAEAlX,KAGN,IAAK,IAAIpC,EAAI,EAAGA,EAAIgU,EAAE9T,OAAQF,IAC5BoC,KAAKuW,MAAM3Y,GAAKoC,KAAKuW,MAAM3Y,GAAKsZ,EAAIX,MAAM3Y,GAK5C,OAFAoC,KAAKlC,OAAS8T,EAAE9T,OAETkC,KAAK2X,UAGdhK,EAAGvO,UAAUwc,KAAO,SAAe1E,GAEjC,OADAxB,EAA0C,KAAlC1V,KAAKsW,SAAWY,EAAIZ,WACrBtW,KAAK2b,MAAMzE,IAIpBvJ,EAAGvO,UAAUyc,IAAM,SAAc3E,GAC/B,OAAIlX,KAAKlC,OAASoZ,EAAIpZ,OAAekC,KAAKsY,QAAQsD,KAAK1E,GAChDA,EAAIoB,QAAQsD,KAAK5b,OAG1B2N,EAAGvO,UAAU0c,KAAO,SAAe5E,GACjC,OAAIlX,KAAKlC,OAASoZ,EAAIpZ,OAAekC,KAAKsY,QAAQqD,MAAMzE,GACjDA,EAAIoB,QAAQqD,MAAM3b,OAI3B2N,EAAGvO,UAAU2c,MAAQ,SAAgB7E,GAEnC,IAAIvF,EACAC,EACA5R,KAAKlC,OAASoZ,EAAIpZ,QACpB6T,EAAI3R,KACJ4R,EAAIsF,IAEJvF,EAAIuF,EACJtF,EAAI5R,MAGN,IAAK,IAAIpC,EAAI,EAAGA,EAAIgU,EAAE9T,OAAQF,IAC5BoC,KAAKuW,MAAM3Y,GAAK+T,EAAE4E,MAAM3Y,GAAKgU,EAAE2E,MAAM3Y,GAGvC,GAAIoC,OAAS2R,EACX,KAAO/T,EAAI+T,EAAE7T,OAAQF,IACnBoC,KAAKuW,MAAM3Y,GAAK+T,EAAE4E,MAAM3Y,GAM5B,OAFAoC,KAAKlC,OAAS6T,EAAE7T,OAETkC,KAAK2X,UAGdhK,EAAGvO,UAAU4c,KAAO,SAAe9E,GAEjC,OADAxB,EAA0C,KAAlC1V,KAAKsW,SAAWY,EAAIZ,WACrBtW,KAAK+b,MAAM7E,IAIpBvJ,EAAGvO,UAAU6c,IAAM,SAAc/E,GAC/B,OAAIlX,KAAKlC,OAASoZ,EAAIpZ,OAAekC,KAAKsY,QAAQ0D,KAAK9E,GAChDA,EAAIoB,QAAQ0D,KAAKhc,OAG1B2N,EAAGvO,UAAU8c,KAAO,SAAehF,GACjC,OAAIlX,KAAKlC,OAASoZ,EAAIpZ,OAAekC,KAAKsY,QAAQyD,MAAM7E,GACjDA,EAAIoB,QAAQyD,MAAM/b,OAI3B2N,EAAGvO,UAAU2b,MAAQ,SAAgBF,GACnCnF,EAAwB,kBAAVmF,GAAsBA,GAAS,GAE7C,IAAIsB,EAAsC,EAAxB5f,KAAKqb,KAAKiD,EAAQ,IAChCuB,EAAWvB,EAAQ,GAGvB7a,KAAKuY,QAAQ4D,GAETC,EAAW,GACbD,IAIF,IAAK,IAAIve,EAAI,EAAGA,EAAIue,EAAave,IAC/BoC,KAAKuW,MAAM3Y,GAAsB,UAAhBoC,KAAKuW,MAAM3Y,GAS9B,OALIwe,EAAW,IACbpc,KAAKuW,MAAM3Y,IAAMoC,KAAKuW,MAAM3Y,GAAM,UAAc,GAAKwe,GAIhDpc,KAAK2X,UAGdhK,EAAGvO,UAAU+b,KAAO,SAAeN,GACjC,OAAO7a,KAAKsY,QAAQyC,MAAMF,IAI5BlN,EAAGvO,UAAUid,KAAO,SAAe1C,EAAKhE,GACtCD,EAAsB,kBAARiE,GAAoBA,GAAO,GAEzC,IAAI7B,EAAO6B,EAAM,GAAM,EACnBC,EAAOD,EAAM,GAUjB,OARA3Z,KAAKuY,QAAQT,EAAM,GAGjB9X,KAAKuW,MAAMuB,GADTnC,EACgB3V,KAAKuW,MAAMuB,GAAQ,GAAK8B,EAExB5Z,KAAKuW,MAAMuB,KAAS,GAAK8B,GAGtC5Z,KAAK2X,UAIdhK,EAAGvO,UAAUkd,KAAO,SAAepF,GACjC,IAAIzH,EAkBAkC,EAAGC,EAfP,GAAsB,IAAlB5R,KAAKsW,UAAmC,IAAjBY,EAAIZ,SAI7B,OAHAtW,KAAKsW,SAAW,EAChB7G,EAAIzP,KAAKuc,KAAKrF,GACdlX,KAAKsW,UAAY,EACVtW,KAAKyY,YAGP,GAAsB,IAAlBzY,KAAKsW,UAAmC,IAAjBY,EAAIZ,SAIpC,OAHAY,EAAIZ,SAAW,EACf7G,EAAIzP,KAAKuc,KAAKrF,GACdA,EAAIZ,SAAW,EACR7G,EAAEgJ,YAKPzY,KAAKlC,OAASoZ,EAAIpZ,QACpB6T,EAAI3R,KACJ4R,EAAIsF,IAEJvF,EAAIuF,EACJtF,EAAI5R,MAIN,IADA,IAAI8Y,EAAQ,EACHlb,EAAI,EAAGA,EAAIgU,EAAE9T,OAAQF,IAC5B6R,GAAkB,EAAbkC,EAAE4E,MAAM3Y,KAAwB,EAAbgU,EAAE2E,MAAM3Y,IAAUkb,EAC1C9Y,KAAKuW,MAAM3Y,GAAS,SAAJ6R,EAChBqJ,EAAQrJ,IAAM,GAEhB,KAAiB,IAAVqJ,GAAelb,EAAI+T,EAAE7T,OAAQF,IAClC6R,GAAkB,EAAbkC,EAAE4E,MAAM3Y,IAAUkb,EACvB9Y,KAAKuW,MAAM3Y,GAAS,SAAJ6R,EAChBqJ,EAAQrJ,IAAM,GAIhB,GADAzP,KAAKlC,OAAS6T,EAAE7T,OACF,IAAVgb,EACF9Y,KAAKuW,MAAMvW,KAAKlC,QAAUgb,EAC1B9Y,KAAKlC,cAEA,GAAI6T,IAAM3R,KACf,KAAOpC,EAAI+T,EAAE7T,OAAQF,IACnBoC,KAAKuW,MAAM3Y,GAAK+T,EAAE4E,MAAM3Y,GAI5B,OAAOoC,MAIT2N,EAAGvO,UAAU+Q,IAAM,SAAc+G,GAC/B,IAAI1G,EACJ,OAAqB,IAAjB0G,EAAIZ,UAAoC,IAAlBtW,KAAKsW,UAC7BY,EAAIZ,SAAW,EACf9F,EAAMxQ,KAAKwc,IAAItF,GACfA,EAAIZ,UAAY,EACT9F,GACmB,IAAjB0G,EAAIZ,UAAoC,IAAlBtW,KAAKsW,UACpCtW,KAAKsW,SAAW,EAChB9F,EAAM0G,EAAIsF,IAAIxc,MACdA,KAAKsW,SAAW,EACT9F,GAGLxQ,KAAKlC,OAASoZ,EAAIpZ,OAAekC,KAAKsY,QAAQgE,KAAKpF,GAEhDA,EAAIoB,QAAQgE,KAAKtc,OAI1B2N,EAAGvO,UAAUmd,KAAO,SAAerF,GAEjC,GAAqB,IAAjBA,EAAIZ,SAAgB,CACtBY,EAAIZ,SAAW,EACf,IAAI7G,EAAIzP,KAAKsc,KAAKpF,GAElB,OADAA,EAAIZ,SAAW,EACR7G,EAAEgJ,YAGJ,GAAsB,IAAlBzY,KAAKsW,SAId,OAHAtW,KAAKsW,SAAW,EAChBtW,KAAKsc,KAAKpF,GACVlX,KAAKsW,SAAW,EACTtW,KAAKyY,YAId,IAWI9G,EAAGC,EAXHP,EAAMrR,KAAKqR,IAAI6F,GAGnB,GAAY,IAAR7F,EAIF,OAHArR,KAAKsW,SAAW,EAChBtW,KAAKlC,OAAS,EACdkC,KAAKuW,MAAM,GAAK,EACTvW,KAKLqR,EAAM,GACRM,EAAI3R,KACJ4R,EAAIsF,IAEJvF,EAAIuF,EACJtF,EAAI5R,MAIN,IADA,IAAI8Y,EAAQ,EACHlb,EAAI,EAAGA,EAAIgU,EAAE9T,OAAQF,IAC5B6R,GAAkB,EAAbkC,EAAE4E,MAAM3Y,KAAwB,EAAbgU,EAAE2E,MAAM3Y,IAAUkb,EAC1CA,EAAQrJ,GAAK,GACbzP,KAAKuW,MAAM3Y,GAAS,SAAJ6R,EAElB,KAAiB,IAAVqJ,GAAelb,EAAI+T,EAAE7T,OAAQF,IAClC6R,GAAkB,EAAbkC,EAAE4E,MAAM3Y,IAAUkb,EACvBA,EAAQrJ,GAAK,GACbzP,KAAKuW,MAAM3Y,GAAS,SAAJ6R,EAIlB,GAAc,IAAVqJ,GAAelb,EAAI+T,EAAE7T,QAAU6T,IAAM3R,KACvC,KAAOpC,EAAI+T,EAAE7T,OAAQF,IACnBoC,KAAKuW,MAAM3Y,GAAK+T,EAAE4E,MAAM3Y,GAU5B,OANAoC,KAAKlC,OAASvB,KAAK4a,IAAInX,KAAKlC,OAAQF,GAEhC+T,IAAM3R,OACRA,KAAKsW,SAAW,GAGXtW,KAAK2X,UAIdhK,EAAGvO,UAAUod,IAAM,SAActF,GAC/B,OAAOlX,KAAKsY,QAAQiE,KAAKrF,IA+C3B,IAAIuF,EAAc,SAAsBnP,EAAM4J,EAAKjN,GACjD,IAII6P,EACA4C,EACAhC,EANA/I,EAAIrE,EAAKiJ,MACT3E,EAAIsF,EAAIX,MACRoG,EAAI1S,EAAIsM,MACRrV,EAAI,EAIJ0b,EAAY,EAAPjL,EAAE,GACPkL,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPpL,EAAE,GACPqL,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPvL,EAAE,GACPwL,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP1L,EAAE,GACP2L,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP7L,EAAE,GACP8L,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPhM,EAAE,GACPiM,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPnM,EAAE,GACPoM,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPtM,EAAE,GACPuM,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPzM,EAAE,GACP0M,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP5M,EAAE,GACP6M,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP9M,EAAE,GACP+M,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPjN,EAAE,GACPkN,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPpN,EAAE,GACPqN,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPvN,EAAE,GACPwN,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP1N,EAAE,GACP2N,EAAW,KAALD,EACNE,GAAMF,IAAO,GACbG,GAAY,EAAP7N,EAAE,GACP8N,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAPhO,EAAE,GACPiO,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAPnO,EAAE,GACPoO,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAPtO,EAAE,GACPuO,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAPzO,EAAE,GACP0O,GAAW,KAALD,GACNE,GAAMF,KAAO,GAEjBpW,EAAIqM,SAAWhJ,EAAKgJ,SAAWY,EAAIZ,SACnCrM,EAAInM,OAAS,GAEbgc,EAAKvd,KAAK2T,KAAK2M,EAAK8B,GACpBjC,EAAMngB,KAAK2T,KAAK2M,EAAK+B,GACrBlC,EAAOA,EAAMngB,KAAK2T,KAAK4M,EAAK6B,GAAQ,EACpCjE,EAAKne,KAAK2T,KAAK4M,EAAK8B,GACpB,IAAI4B,IAAQtf,EAAI4Y,EAAM,KAAa,KAAN4C,IAAiB,IAAO,EACrDxb,GAAOwZ,GAAMgC,IAAQ,IAAO,IAAM8D,KAAO,IAAO,EAChDA,IAAM,SAEN1G,EAAKvd,KAAK2T,KAAK8M,EAAK2B,GACpBjC,EAAMngB,KAAK2T,KAAK8M,EAAK4B,GACrBlC,EAAOA,EAAMngB,KAAK2T,KAAK+M,EAAK0B,GAAQ,EACpCjE,EAAKne,KAAK2T,KAAK+M,EAAK2B,GACpB9E,EAAMA,EAAKvd,KAAK2T,KAAK2M,EAAKiC,GAAQ,EAClCpC,EAAOA,EAAMngB,KAAK2T,KAAK2M,EAAKkC,GAAQ,EACpCrC,EAAOA,EAAMngB,KAAK2T,KAAK4M,EAAKgC,GAAQ,EACpCpE,EAAMA,EAAKne,KAAK2T,KAAK4M,EAAKiC,GAAQ,EAClC,IAAI0B,IAAQvf,EAAI4Y,EAAM,KAAa,KAAN4C,IAAiB,IAAO,EACrDxb,GAAOwZ,GAAMgC,IAAQ,IAAO,IAAM+D,KAAO,IAAO,EAChDA,IAAM,SAEN3G,EAAKvd,KAAK2T,KAAKiN,EAAKwB,GACpBjC,EAAMngB,KAAK2T,KAAKiN,EAAKyB,GACrBlC,EAAOA,EAAMngB,KAAK2T,KAAKkN,EAAKuB,GAAQ,EACpCjE,EAAKne,KAAK2T,KAAKkN,EAAKwB,GACpB9E,EAAMA,EAAKvd,KAAK2T,KAAK8M,EAAK8B,GAAQ,EAClCpC,EAAOA,EAAMngB,KAAK2T,KAAK8M,EAAK+B,GAAQ,EACpCrC,EAAOA,EAAMngB,KAAK2T,KAAK+M,EAAK6B,GAAQ,EACpCpE,EAAMA,EAAKne,KAAK2T,KAAK+M,EAAK8B,GAAQ,EAClCjF,EAAMA,EAAKvd,KAAK2T,KAAK2M,EAAKoC,GAAQ,EAClCvC,EAAOA,EAAMngB,KAAK2T,KAAK2M,EAAKqC,GAAQ,EACpCxC,EAAOA,EAAMngB,KAAK2T,KAAK4M,EAAKmC,GAAQ,EACpCvE,EAAMA,EAAKne,KAAK2T,KAAK4M,EAAKoC,GAAQ,EAClC,IAAIwB,IAAQxf,EAAI4Y,EAAM,KAAa,KAAN4C,IAAiB,IAAO,EACrDxb,GAAOwZ,GAAMgC,IAAQ,IAAO,IAAMgE,KAAO,IAAO,EAChDA,IAAM,SAEN5G,EAAKvd,KAAK2T,KAAKoN,EAAKqB,GACpBjC,EAAMngB,KAAK2T,KAAKoN,EAAKsB,GACrBlC,EAAOA,EAAMngB,KAAK2T,KAAKqN,EAAKoB,GAAQ,EACpCjE,EAAKne,KAAK2T,KAAKqN,EAAKqB,GACpB9E,EAAMA,EAAKvd,KAAK2T,KAAKiN,EAAK2B,GAAQ,EAClCpC,EAAOA,EAAMngB,KAAK2T,KAAKiN,EAAK4B,GAAQ,EACpCrC,EAAOA,EAAMngB,KAAK2T,KAAKkN,EAAK0B,GAAQ,EACpCpE,EAAMA,EAAKne,KAAK2T,KAAKkN,EAAK2B,GAAQ,EAClCjF,EAAMA,EAAKvd,KAAK2T,KAAK8M,EAAKiC,GAAQ,EAClCvC,EAAOA,EAAMngB,KAAK2T,KAAK8M,EAAKkC,GAAQ,EACpCxC,EAAOA,EAAMngB,KAAK2T,KAAK+M,EAAKgC,GAAQ,EACpCvE,EAAMA,EAAKne,KAAK2T,KAAK+M,EAAKiC,GAAQ,EAClCpF,EAAMA,EAAKvd,KAAK2T,KAAK2M,EAAKuC,GAAQ,EAClC1C,EAAOA,EAAMngB,KAAK2T,KAAK2M,EAAKwC,GAAQ,EACpC3C,EAAOA,EAAMngB,KAAK2T,KAAK4M,EAAKsC,GAAQ,EACpC1E,EAAMA,EAAKne,KAAK2T,KAAK4M,EAAKuC,GAAQ,EAClC,IAAIsB,IAAQzf,EAAI4Y,EAAM,KAAa,KAAN4C,IAAiB,IAAO,EACrDxb,GAAOwZ,GAAMgC,IAAQ,IAAO,IAAMiE,KAAO,IAAO,EAChDA,IAAM,SAEN7G,EAAKvd,KAAK2T,KAAKuN,EAAKkB,GACpBjC,EAAMngB,KAAK2T,KAAKuN,EAAKmB,GACrBlC,EAAOA,EAAMngB,KAAK2T,KAAKwN,EAAKiB,GAAQ,EACpCjE,EAAKne,KAAK2T,KAAKwN,EAAKkB,GACpB9E,EAAMA,EAAKvd,KAAK2T,KAAKoN,EAAKwB,GAAQ,EAClCpC,EAAOA,EAAMngB,KAAK2T,KAAKoN,EAAKyB,GAAQ,EACpCrC,EAAOA,EAAMngB,KAAK2T,KAAKqN,EAAKuB,GAAQ,EACpCpE,EAAMA,EAAKne,KAAK2T,KAAKqN,EAAKwB,GAAQ,EAClCjF,EAAMA,EAAKvd,KAAK2T,KAAKiN,EAAK8B,GAAQ,EAClCvC,EAAOA,EAAMngB,KAAK2T,KAAKiN,EAAK+B,GAAQ,EACpCxC,EAAOA,EAAMngB,KAAK2T,KAAKkN,EAAK6B,GAAQ,EACpCvE,EAAMA,EAAKne,KAAK2T,KAAKkN,EAAK8B,GAAQ,EAClCpF,EAAMA,EAAKvd,KAAK2T,KAAK8M,EAAKoC,GAAQ,EAClC1C,EAAOA,EAAMngB,KAAK2T,KAAK8M,EAAKqC,GAAQ,EACpC3C,EAAOA,EAAMngB,KAAK2T,KAAK+M,EAAKmC,GAAQ,EACpC1E,EAAMA,EAAKne,KAAK2T,KAAK+M,EAAKoC,GAAQ,EAClCvF,EAAMA,EAAKvd,KAAK2T,KAAK2M,EAAK0C,GAAQ,EAClC7C,EAAOA,EAAMngB,KAAK2T,KAAK2M,EAAK2C,IAAQ,EACpC9C,EAAOA,EAAMngB,KAAK2T,KAAK4M,EAAKyC,GAAQ,EACpC7E,EAAMA,EAAKne,KAAK2T,KAAK4M,EAAK0C,IAAQ,EAClC,IAAIoB,IAAQ1f,EAAI4Y,EAAM,KAAa,KAAN4C,IAAiB,IAAO,EACrDxb,GAAOwZ,GAAMgC,IAAQ,IAAO,IAAMkE,KAAO,IAAO,EAChDA,IAAM,SAEN9G,EAAKvd,KAAK2T,KAAK0N,EAAKe,GACpBjC,EAAMngB,KAAK2T,KAAK0N,EAAKgB,GACrBlC,EAAOA,EAAMngB,KAAK2T,KAAK2N,EAAKc,GAAQ,EACpCjE,EAAKne,KAAK2T,KAAK2N,EAAKe,GACpB9E,EAAMA,EAAKvd,KAAK2T,KAAKuN,EAAKqB,GAAQ,EAClCpC,EAAOA,EAAMngB,KAAK2T,KAAKuN,EAAKsB,GAAQ,EACpCrC,EAAOA,EAAMngB,KAAK2T,KAAKwN,EAAKoB,GAAQ,EACpCpE,EAAMA,EAAKne,KAAK2T,KAAKwN,EAAKqB,GAAQ,EAClCjF,EAAMA,EAAKvd,KAAK2T,KAAKoN,EAAK2B,GAAQ,EAClCvC,EAAOA,EAAMngB,KAAK2T,KAAKoN,EAAK4B,GAAQ,EACpCxC,EAAOA,EAAMngB,KAAK2T,KAAKqN,EAAK0B,GAAQ,EACpCvE,EAAMA,EAAKne,KAAK2T,KAAKqN,EAAK2B,GAAQ,EAClCpF,EAAMA,EAAKvd,KAAK2T,KAAKiN,EAAKiC,GAAQ,EAClC1C,EAAOA,EAAMngB,KAAK2T,KAAKiN,EAAKkC,GAAQ,EACpC3C,EAAOA,EAAMngB,KAAK2T,KAAKkN,EAAKgC,GAAQ,EACpC1E,EAAMA,EAAKne,KAAK2T,KAAKkN,EAAKiC,GAAQ,EAClCvF,EAAMA,EAAKvd,KAAK2T,KAAK8M,EAAKuC,GAAQ,EAClC7C,EAAOA,EAAMngB,KAAK2T,KAAK8M,EAAKwC,IAAQ,EACpC9C,EAAOA,EAAMngB,KAAK2T,KAAK+M,EAAKsC,GAAQ,EACpC7E,EAAMA,EAAKne,KAAK2T,KAAK+M,EAAKuC,IAAQ,EAClC1F,EAAMA,EAAKvd,KAAK2T,KAAK2M,EAAK6C,IAAQ,EAClChD,EAAOA,EAAMngB,KAAK2T,KAAK2M,EAAK8C,IAAQ,EACpCjD,EAAOA,EAAMngB,KAAK2T,KAAK4M,EAAK4C,IAAQ,EACpChF,EAAMA,EAAKne,KAAK2T,KAAK4M,EAAK6C,IAAQ,EAClC,IAAIkB,IAAQ3f,EAAI4Y,EAAM,KAAa,KAAN4C,IAAiB,IAAO,EACrDxb,GAAOwZ,GAAMgC,IAAQ,IAAO,IAAMmE,KAAO,IAAO,EAChDA,IAAM,SAEN/G,EAAKvd,KAAK2T,KAAK6N,EAAKY,GACpBjC,EAAMngB,KAAK2T,KAAK6N,EAAKa,GACrBlC,EAAOA,EAAMngB,KAAK2T,KAAK8N,EAAKW,GAAQ,EACpCjE,EAAKne,KAAK2T,KAAK8N,EAAKY,GACpB9E,EAAMA,EAAKvd,KAAK2T,KAAK0N,EAAKkB,GAAQ,EAClCpC,EAAOA,EAAMngB,KAAK2T,KAAK0N,EAAKmB,GAAQ,EACpCrC,EAAOA,EAAMngB,KAAK2T,KAAK2N,EAAKiB,GAAQ,EACpCpE,EAAMA,EAAKne,KAAK2T,KAAK2N,EAAKkB,GAAQ,EAClCjF,EAAMA,EAAKvd,KAAK2T,KAAKuN,EAAKwB,GAAQ,EAClCvC,EAAOA,EAAMngB,KAAK2T,KAAKuN,EAAKyB,GAAQ,EACpCxC,EAAOA,EAAMngB,KAAK2T,KAAKwN,EAAKuB,GAAQ,EACpCvE,EAAMA,EAAKne,KAAK2T,KAAKwN,EAAKwB,GAAQ,EAClCpF,EAAMA,EAAKvd,KAAK2T,KAAKoN,EAAK8B,GAAQ,EAClC1C,EAAOA,EAAMngB,KAAK2T,KAAKoN,EAAK+B,GAAQ,EACpC3C,EAAOA,EAAMngB,KAAK2T,KAAKqN,EAAK6B,GAAQ,EACpC1E,EAAMA,EAAKne,KAAK2T,KAAKqN,EAAK8B,GAAQ,EAClCvF,EAAMA,EAAKvd,KAAK2T,KAAKiN,EAAKoC,GAAQ,EAClC7C,EAAOA,EAAMngB,KAAK2T,KAAKiN,EAAKqC,IAAQ,EACpC9C,EAAOA,EAAMngB,KAAK2T,KAAKkN,EAAKmC,GAAQ,EACpC7E,EAAMA,EAAKne,KAAK2T,KAAKkN,EAAKoC,IAAQ,EAClC1F,EAAMA,EAAKvd,KAAK2T,KAAK8M,EAAK0C,IAAQ,EAClChD,EAAOA,EAAMngB,KAAK2T,KAAK8M,EAAK2C,IAAQ,EACpCjD,EAAOA,EAAMngB,KAAK2T,KAAK+M,EAAKyC,IAAQ,EACpChF,EAAMA,EAAKne,KAAK2T,KAAK+M,EAAK0C,IAAQ,EAClC7F,EAAMA,EAAKvd,KAAK2T,KAAK2M,EAAKgD,IAAQ,EAClCnD,EAAOA,EAAMngB,KAAK2T,KAAK2M,EAAKiD,IAAQ,EACpCpD,EAAOA,EAAMngB,KAAK2T,KAAK4M,EAAK+C,IAAQ,EACpCnF,EAAMA,EAAKne,KAAK2T,KAAK4M,EAAKgD,IAAQ,EAClC,IAAIgB,IAAQ5f,EAAI4Y,EAAM,KAAa,KAAN4C,IAAiB,IAAO,EACrDxb,GAAOwZ,GAAMgC,IAAQ,IAAO,IAAMoE,KAAO,IAAO,EAChDA,IAAM,SAENhH,EAAKvd,KAAK2T,KAAKgO,EAAKS,GACpBjC,EAAMngB,KAAK2T,KAAKgO,EAAKU,GACrBlC,EAAOA,EAAMngB,KAAK2T,KAAKiO,EAAKQ,GAAQ,EACpCjE,EAAKne,KAAK2T,KAAKiO,EAAKS,GACpB9E,EAAMA,EAAKvd,KAAK2T,KAAK6N,EAAKe,GAAQ,EAClCpC,EAAOA,EAAMngB,KAAK2T,KAAK6N,EAAKgB,GAAQ,EACpCrC,EAAOA,EAAMngB,KAAK2T,KAAK8N,EAAKc,GAAQ,EACpCpE,EAAMA,EAAKne,KAAK2T,KAAK8N,EAAKe,GAAQ,EAClCjF,EAAMA,EAAKvd,KAAK2T,KAAK0N,EAAKqB,GAAQ,EAClCvC,EAAOA,EAAMngB,KAAK2T,KAAK0N,EAAKsB,GAAQ,EACpCxC,EAAOA,EAAMngB,KAAK2T,KAAK2N,EAAKoB,GAAQ,EACpCvE,EAAMA,EAAKne,KAAK2T,KAAK2N,EAAKqB,GAAQ,EAClCpF,EAAMA,EAAKvd,KAAK2T,KAAKuN,EAAK2B,GAAQ,EAClC1C,EAAOA,EAAMngB,KAAK2T,KAAKuN,EAAK4B,GAAQ,EACpC3C,EAAOA,EAAMngB,KAAK2T,KAAKwN,EAAK0B,GAAQ,EACpC1E,EAAMA,EAAKne,KAAK2T,KAAKwN,EAAK2B,GAAQ,EAClCvF,EAAMA,EAAKvd,KAAK2T,KAAKoN,EAAKiC,GAAQ,EAClC7C,EAAOA,EAAMngB,KAAK2T,KAAKoN,EAAKkC,IAAQ,EACpC9C,EAAOA,EAAMngB,KAAK2T,KAAKqN,EAAKgC,GAAQ,EACpC7E,EAAMA,EAAKne,KAAK2T,KAAKqN,EAAKiC,IAAQ,EAClC1F,EAAMA,EAAKvd,KAAK2T,KAAKiN,EAAKuC,IAAQ,EAClChD,EAAOA,EAAMngB,KAAK2T,KAAKiN,EAAKwC,IAAQ,EACpCjD,EAAOA,EAAMngB,KAAK2T,KAAKkN,EAAKsC,IAAQ,EACpChF,EAAMA,EAAKne,KAAK2T,KAAKkN,EAAKuC,IAAQ,EAClC7F,EAAMA,EAAKvd,KAAK2T,KAAK8M,EAAK6C,IAAQ,EAClCnD,EAAOA,EAAMngB,KAAK2T,KAAK8M,EAAK8C,IAAQ,EACpCpD,EAAOA,EAAMngB,KAAK2T,KAAK+M,EAAK4C,IAAQ,EACpCnF,EAAMA,EAAKne,KAAK2T,KAAK+M,EAAK6C,IAAQ,EAClChG,EAAMA,EAAKvd,KAAK2T,KAAK2M,EAAKmD,IAAQ,EAClCtD,EAAOA,EAAMngB,KAAK2T,KAAK2M,EAAKoD,IAAQ,EACpCvD,EAAOA,EAAMngB,KAAK2T,KAAK4M,EAAKkD,IAAQ,EACpCtF,EAAMA,EAAKne,KAAK2T,KAAK4M,EAAKmD,IAAQ,EAClC,IAAIc,IAAQ7f,EAAI4Y,EAAM,KAAa,KAAN4C,IAAiB,IAAO,EACrDxb,GAAOwZ,GAAMgC,IAAQ,IAAO,IAAMqE,KAAO,IAAO,EAChDA,IAAM,SAENjH,EAAKvd,KAAK2T,KAAKmO,EAAKM,GACpBjC,EAAMngB,KAAK2T,KAAKmO,EAAKO,GACrBlC,EAAOA,EAAMngB,KAAK2T,KAAKoO,EAAKK,GAAQ,EACpCjE,EAAKne,KAAK2T,KAAKoO,EAAKM,GACpB9E,EAAMA,EAAKvd,KAAK2T,KAAKgO,EAAKY,GAAQ,EAClCpC,EAAOA,EAAMngB,KAAK2T,KAAKgO,EAAKa,GAAQ,EACpCrC,EAAOA,EAAMngB,KAAK2T,KAAKiO,EAAKW,GAAQ,EACpCpE,EAAMA,EAAKne,KAAK2T,KAAKiO,EAAKY,GAAQ,EAClCjF,EAAMA,EAAKvd,KAAK2T,KAAK6N,EAAKkB,GAAQ,EAClCvC,EAAOA,EAAMngB,KAAK2T,KAAK6N,EAAKmB,GAAQ,EACpCxC,EAAOA,EAAMngB,KAAK2T,KAAK8N,EAAKiB,GAAQ,EACpCvE,EAAMA,EAAKne,KAAK2T,KAAK8N,EAAKkB,GAAQ,EAClCpF,EAAMA,EAAKvd,KAAK2T,KAAK0N,EAAKwB,GAAQ,EAClC1C,EAAOA,EAAMngB,KAAK2T,KAAK0N,EAAKyB,GAAQ,EACpC3C,EAAOA,EAAMngB,KAAK2T,KAAK2N,EAAKuB,GAAQ,EACpC1E,EAAMA,EAAKne,KAAK2T,KAAK2N,EAAKwB,GAAQ,EAClCvF,EAAMA,EAAKvd,KAAK2T,KAAKuN,EAAK8B,GAAQ,EAClC7C,EAAOA,EAAMngB,KAAK2T,KAAKuN,EAAK+B,IAAQ,EACpC9C,EAAOA,EAAMngB,KAAK2T,KAAKwN,EAAK6B,GAAQ,EACpC7E,EAAMA,EAAKne,KAAK2T,KAAKwN,EAAK8B,IAAQ,EAClC1F,EAAMA,EAAKvd,KAAK2T,KAAKoN,EAAKoC,IAAQ,EAClChD,EAAOA,EAAMngB,KAAK2T,KAAKoN,EAAKqC,IAAQ,EACpCjD,EAAOA,EAAMngB,KAAK2T,KAAKqN,EAAKmC,IAAQ,EACpChF,EAAMA,EAAKne,KAAK2T,KAAKqN,EAAKoC,IAAQ,EAClC7F,EAAMA,EAAKvd,KAAK2T,KAAKiN,EAAK0C,IAAQ,EAClCnD,EAAOA,EAAMngB,KAAK2T,KAAKiN,EAAK2C,IAAQ,EACpCpD,EAAOA,EAAMngB,KAAK2T,KAAKkN,EAAKyC,IAAQ,EACpCnF,EAAMA,EAAKne,KAAK2T,KAAKkN,EAAK0C,IAAQ,EAClChG,EAAMA,EAAKvd,KAAK2T,KAAK8M,EAAKgD,IAAQ,EAClCtD,EAAOA,EAAMngB,KAAK2T,KAAK8M,EAAKiD,IAAQ,EACpCvD,EAAOA,EAAMngB,KAAK2T,KAAK+M,EAAK+C,IAAQ,EACpCtF,EAAMA,EAAKne,KAAK2T,KAAK+M,EAAKgD,IAAQ,EAClCnG,EAAMA,EAAKvd,KAAK2T,KAAK2M,EAAKsD,IAAQ,EAClCzD,EAAOA,EAAMngB,KAAK2T,KAAK2M,EAAKuD,IAAQ,EACpC1D,EAAOA,EAAMngB,KAAK2T,KAAK4M,EAAKqD,IAAQ,EACpCzF,EAAMA,EAAKne,KAAK2T,KAAK4M,EAAKsD,IAAQ,EAClC,IAAIY,IAAQ9f,EAAI4Y,EAAM,KAAa,KAAN4C,IAAiB,IAAO,EACrDxb,GAAOwZ,GAAMgC,IAAQ,IAAO,IAAMsE,KAAO,IAAO,EAChDA,IAAM,SAENlH,EAAKvd,KAAK2T,KAAKsO,EAAKG,GACpBjC,EAAMngB,KAAK2T,KAAKsO,EAAKI,GACrBlC,EAAOA,EAAMngB,KAAK2T,KAAKuO,EAAKE,GAAQ,EACpCjE,EAAKne,KAAK2T,KAAKuO,EAAKG,GACpB9E,EAAMA,EAAKvd,KAAK2T,KAAKmO,EAAKS,GAAQ,EAClCpC,EAAOA,EAAMngB,KAAK2T,KAAKmO,EAAKU,GAAQ,EACpCrC,EAAOA,EAAMngB,KAAK2T,KAAKoO,EAAKQ,GAAQ,EACpCpE,EAAMA,EAAKne,KAAK2T,KAAKoO,EAAKS,GAAQ,EAClCjF,EAAMA,EAAKvd,KAAK2T,KAAKgO,EAAKe,GAAQ,EAClCvC,EAAOA,EAAMngB,KAAK2T,KAAKgO,EAAKgB,GAAQ,EACpCxC,EAAOA,EAAMngB,KAAK2T,KAAKiO,EAAKc,GAAQ,EACpCvE,EAAMA,EAAKne,KAAK2T,KAAKiO,EAAKe,GAAQ,EAClCpF,EAAMA,EAAKvd,KAAK2T,KAAK6N,EAAKqB,GAAQ,EAClC1C,EAAOA,EAAMngB,KAAK2T,KAAK6N,EAAKsB,GAAQ,EACpC3C,EAAOA,EAAMngB,KAAK2T,KAAK8N,EAAKoB,GAAQ,EACpC1E,EAAMA,EAAKne,KAAK2T,KAAK8N,EAAKqB,GAAQ,EAClCvF,EAAMA,EAAKvd,KAAK2T,KAAK0N,EAAK2B,GAAQ,EAClC7C,EAAOA,EAAMngB,KAAK2T,KAAK0N,EAAK4B,IAAQ,EACpC9C,EAAOA,EAAMngB,KAAK2T,KAAK2N,EAAK0B,GAAQ,EACpC7E,EAAMA,EAAKne,KAAK2T,KAAK2N,EAAK2B,IAAQ,EAClC1F,EAAMA,EAAKvd,KAAK2T,KAAKuN,EAAKiC,IAAQ,EAClChD,EAAOA,EAAMngB,KAAK2T,KAAKuN,EAAKkC,IAAQ,EACpCjD,EAAOA,EAAMngB,KAAK2T,KAAKwN,EAAKgC,IAAQ,EACpChF,EAAMA,EAAKne,KAAK2T,KAAKwN,EAAKiC,IAAQ,EAClC7F,EAAMA,EAAKvd,KAAK2T,KAAKoN,EAAKuC,IAAQ,EAClCnD,EAAOA,EAAMngB,KAAK2T,KAAKoN,EAAKwC,IAAQ,EACpCpD,EAAOA,EAAMngB,KAAK2T,KAAKqN,EAAKsC,IAAQ,EACpCnF,EAAMA,EAAKne,KAAK2T,KAAKqN,EAAKuC,IAAQ,EAClChG,EAAMA,EAAKvd,KAAK2T,KAAKiN,EAAK6C,IAAQ,EAClCtD,EAAOA,EAAMngB,KAAK2T,KAAKiN,EAAK8C,IAAQ,EACpCvD,EAAOA,EAAMngB,KAAK2T,KAAKkN,EAAK4C,IAAQ,EACpCtF,EAAMA,EAAKne,KAAK2T,KAAKkN,EAAK6C,IAAQ,EAClCnG,EAAMA,EAAKvd,KAAK2T,KAAK8M,EAAKmD,IAAQ,EAClCzD,EAAOA,EAAMngB,KAAK2T,KAAK8M,EAAKoD,IAAQ,EACpC1D,EAAOA,EAAMngB,KAAK2T,KAAK+M,EAAKkD,IAAQ,EACpCzF,EAAMA,EAAKne,KAAK2T,KAAK+M,EAAKmD,IAAQ,EAClCtG,EAAMA,EAAKvd,KAAK2T,KAAK2M,EAAKyD,IAAQ,EAClC5D,EAAOA,EAAMngB,KAAK2T,KAAK2M,EAAK0D,IAAQ,EACpC7D,EAAOA,EAAMngB,KAAK2T,KAAK4M,EAAKwD,IAAQ,EACpC5F,EAAMA,EAAKne,KAAK2T,KAAK4M,EAAKyD,IAAQ,EAClC,IAAIU,IAAQ/f,EAAI4Y,EAAM,KAAa,KAAN4C,IAAiB,IAAO,EACrDxb,GAAOwZ,GAAMgC,IAAQ,IAAO,IAAMuE,KAAO,IAAO,EAChDA,IAAM,SAENnH,EAAKvd,KAAK2T,KAAKsO,EAAKM,GACpBpC,EAAMngB,KAAK2T,KAAKsO,EAAKO,GACrBrC,EAAOA,EAAMngB,KAAK2T,KAAKuO,EAAKK,GAAQ,EACpCpE,EAAKne,KAAK2T,KAAKuO,EAAKM,GACpBjF,EAAMA,EAAKvd,KAAK2T,KAAKmO,EAAKY,GAAQ,EAClCvC,EAAOA,EAAMngB,KAAK2T,KAAKmO,EAAKa,GAAQ,EACpCxC,EAAOA,EAAMngB,KAAK2T,KAAKoO,EAAKW,GAAQ,EACpCvE,EAAMA,EAAKne,KAAK2T,KAAKoO,EAAKY,GAAQ,EAClCpF,EAAMA,EAAKvd,KAAK2T,KAAKgO,EAAKkB,GAAQ,EAClC1C,EAAOA,EAAMngB,KAAK2T,KAAKgO,EAAKmB,GAAQ,EACpC3C,EAAOA,EAAMngB,KAAK2T,KAAKiO,EAAKiB,GAAQ,EACpC1E,EAAMA,EAAKne,KAAK2T,KAAKiO,EAAKkB,GAAQ,EAClCvF,EAAMA,EAAKvd,KAAK2T,KAAK6N,EAAKwB,GAAQ,EAClC7C,EAAOA,EAAMngB,KAAK2T,KAAK6N,EAAKyB,IAAQ,EACpC9C,EAAOA,EAAMngB,KAAK2T,KAAK8N,EAAKuB,GAAQ,EACpC7E,EAAMA,EAAKne,KAAK2T,KAAK8N,EAAKwB,IAAQ,EAClC1F,EAAMA,EAAKvd,KAAK2T,KAAK0N,EAAK8B,IAAQ,EAClChD,EAAOA,EAAMngB,KAAK2T,KAAK0N,EAAK+B,IAAQ,EACpCjD,EAAOA,EAAMngB,KAAK2T,KAAK2N,EAAK6B,IAAQ,EACpChF,EAAMA,EAAKne,KAAK2T,KAAK2N,EAAK8B,IAAQ,EAClC7F,EAAMA,EAAKvd,KAAK2T,KAAKuN,EAAKoC,IAAQ,EAClCnD,EAAOA,EAAMngB,KAAK2T,KAAKuN,EAAKqC,IAAQ,EACpCpD,EAAOA,EAAMngB,KAAK2T,KAAKwN,EAAKmC,IAAQ,EACpCnF,EAAMA,EAAKne,KAAK2T,KAAKwN,EAAKoC,IAAQ,EAClChG,EAAMA,EAAKvd,KAAK2T,KAAKoN,EAAK0C,IAAQ,EAClCtD,EAAOA,EAAMngB,KAAK2T,KAAKoN,EAAK2C,IAAQ,EACpCvD,EAAOA,EAAMngB,KAAK2T,KAAKqN,EAAKyC,IAAQ,EACpCtF,EAAMA,EAAKne,KAAK2T,KAAKqN,EAAK0C,IAAQ,EAClCnG,EAAMA,EAAKvd,KAAK2T,KAAKiN,EAAKgD,IAAQ,EAClCzD,EAAOA,EAAMngB,KAAK2T,KAAKiN,EAAKiD,IAAQ,EACpC1D,EAAOA,EAAMngB,KAAK2T,KAAKkN,EAAK+C,IAAQ,EACpCzF,EAAMA,EAAKne,KAAK2T,KAAKkN,EAAKgD,IAAQ,EAClCtG,EAAMA,EAAKvd,KAAK2T,KAAK8M,EAAKsD,IAAQ,EAClC5D,EAAOA,EAAMngB,KAAK2T,KAAK8M,EAAKuD,IAAQ,EACpC7D,EAAOA,EAAMngB,KAAK2T,KAAK+M,EAAKqD,IAAQ,EACpC5F,EAAMA,EAAKne,KAAK2T,KAAK+M,EAAKsD,IAAQ,EAClC,IAAIW,IAAShgB,EAAI4Y,EAAM,KAAa,KAAN4C,IAAiB,IAAO,EACtDxb,GAAOwZ,GAAMgC,IAAQ,IAAO,IAAMwE,KAAQ,IAAO,EACjDA,IAAO,SAEPpH,EAAKvd,KAAK2T,KAAKsO,EAAKS,GACpBvC,EAAMngB,KAAK2T,KAAKsO,EAAKU,GACrBxC,EAAOA,EAAMngB,KAAK2T,KAAKuO,EAAKQ,GAAQ,EACpCvE,EAAKne,KAAK2T,KAAKuO,EAAKS,GACpBpF,EAAMA,EAAKvd,KAAK2T,KAAKmO,EAAKe,GAAQ,EAClC1C,EAAOA,EAAMngB,KAAK2T,KAAKmO,EAAKgB,GAAQ,EACpC3C,EAAOA,EAAMngB,KAAK2T,KAAKoO,EAAKc,GAAQ,EACpC1E,EAAMA,EAAKne,KAAK2T,KAAKoO,EAAKe,GAAQ,EAClCvF,EAAMA,EAAKvd,KAAK2T,KAAKgO,EAAKqB,GAAQ,EAClC7C,EAAOA,EAAMngB,KAAK2T,KAAKgO,EAAKsB,IAAQ,EACpC9C,EAAOA,EAAMngB,KAAK2T,KAAKiO,EAAKoB,GAAQ,EACpC7E,EAAMA,EAAKne,KAAK2T,KAAKiO,EAAKqB,IAAQ,EAClC1F,EAAMA,EAAKvd,KAAK2T,KAAK6N,EAAK2B,IAAQ,EAClChD,EAAOA,EAAMngB,KAAK2T,KAAK6N,EAAK4B,IAAQ,EACpCjD,EAAOA,EAAMngB,KAAK2T,KAAK8N,EAAK0B,IAAQ,EACpChF,EAAMA,EAAKne,KAAK2T,KAAK8N,EAAK2B,IAAQ,EAClC7F,EAAMA,EAAKvd,KAAK2T,KAAK0N,EAAKiC,IAAQ,EAClCnD,EAAOA,EAAMngB,KAAK2T,KAAK0N,EAAKkC,IAAQ,EACpCpD,EAAOA,EAAMngB,KAAK2T,KAAK2N,EAAKgC,IAAQ,EACpCnF,EAAMA,EAAKne,KAAK2T,KAAK2N,EAAKiC,IAAQ,EAClChG,EAAMA,EAAKvd,KAAK2T,KAAKuN,EAAKuC,IAAQ,EAClCtD,EAAOA,EAAMngB,KAAK2T,KAAKuN,EAAKwC,IAAQ,EACpCvD,EAAOA,EAAMngB,KAAK2T,KAAKwN,EAAKsC,IAAQ,EACpCtF,EAAMA,EAAKne,KAAK2T,KAAKwN,EAAKuC,IAAQ,EAClCnG,EAAMA,EAAKvd,KAAK2T,KAAKoN,EAAK6C,IAAQ,EAClCzD,EAAOA,EAAMngB,KAAK2T,KAAKoN,EAAK8C,IAAQ,EACpC1D,EAAOA,EAAMngB,KAAK2T,KAAKqN,EAAK4C,IAAQ,EACpCzF,EAAMA,EAAKne,KAAK2T,KAAKqN,EAAK6C,IAAQ,EAClCtG,EAAMA,EAAKvd,KAAK2T,KAAKiN,EAAKmD,IAAQ,EAClC5D,EAAOA,EAAMngB,KAAK2T,KAAKiN,EAAKoD,IAAQ,EACpC7D,EAAOA,EAAMngB,KAAK2T,KAAKkN,EAAKkD,IAAQ,EACpC5F,EAAMA,EAAKne,KAAK2T,KAAKkN,EAAKmD,IAAQ,EAClC,IAAIY,IAASjgB,EAAI4Y,EAAM,KAAa,KAAN4C,IAAiB,IAAO,EACtDxb,GAAOwZ,GAAMgC,IAAQ,IAAO,IAAMyE,KAAQ,IAAO,EACjDA,IAAO,SAEPrH,EAAKvd,KAAK2T,KAAKsO,EAAKY,GACpB1C,EAAMngB,KAAK2T,KAAKsO,EAAKa,GACrB3C,EAAOA,EAAMngB,KAAK2T,KAAKuO,EAAKW,GAAQ,EACpC1E,EAAKne,KAAK2T,KAAKuO,EAAKY,GACpBvF,EAAMA,EAAKvd,KAAK2T,KAAKmO,EAAKkB,GAAQ,EAClC7C,EAAOA,EAAMngB,KAAK2T,KAAKmO,EAAKmB,IAAQ,EACpC9C,EAAOA,EAAMngB,KAAK2T,KAAKoO,EAAKiB,GAAQ,EACpC7E,EAAMA,EAAKne,KAAK2T,KAAKoO,EAAKkB,IAAQ,EAClC1F,EAAMA,EAAKvd,KAAK2T,KAAKgO,EAAKwB,IAAQ,EAClChD,EAAOA,EAAMngB,KAAK2T,KAAKgO,EAAKyB,IAAQ,EACpCjD,EAAOA,EAAMngB,KAAK2T,KAAKiO,EAAKuB,IAAQ,EACpChF,EAAMA,EAAKne,KAAK2T,KAAKiO,EAAKwB,IAAQ,EAClC7F,EAAMA,EAAKvd,KAAK2T,KAAK6N,EAAK8B,IAAQ,EAClCnD,EAAOA,EAAMngB,KAAK2T,KAAK6N,EAAK+B,IAAQ,EACpCpD,EAAOA,EAAMngB,KAAK2T,KAAK8N,EAAK6B,IAAQ,EACpCnF,EAAMA,EAAKne,KAAK2T,KAAK8N,EAAK8B,IAAQ,EAClChG,EAAMA,EAAKvd,KAAK2T,KAAK0N,EAAKoC,IAAQ,EAClCtD,EAAOA,EAAMngB,KAAK2T,KAAK0N,EAAKqC,IAAQ,EACpCvD,EAAOA,EAAMngB,KAAK2T,KAAK2N,EAAKmC,IAAQ,EACpCtF,EAAMA,EAAKne,KAAK2T,KAAK2N,EAAKoC,IAAQ,EAClCnG,EAAMA,EAAKvd,KAAK2T,KAAKuN,EAAK0C,IAAQ,EAClCzD,EAAOA,EAAMngB,KAAK2T,KAAKuN,EAAK2C,IAAQ,EACpC1D,EAAOA,EAAMngB,KAAK2T,KAAKwN,EAAKyC,IAAQ,EACpCzF,EAAMA,EAAKne,KAAK2T,KAAKwN,EAAK0C,IAAQ,EAClCtG,EAAMA,EAAKvd,KAAK2T,KAAKoN,EAAKgD,IAAQ,EAClC5D,EAAOA,EAAMngB,KAAK2T,KAAKoN,EAAKiD,IAAQ,EACpC7D,EAAOA,EAAMngB,KAAK2T,KAAKqN,EAAK+C,IAAQ,EACpC5F,EAAMA,EAAKne,KAAK2T,KAAKqN,EAAKgD,IAAQ,EAClC,IAAIa,IAASlgB,EAAI4Y,EAAM,KAAa,KAAN4C,IAAiB,IAAO,EACtDxb,GAAOwZ,GAAMgC,IAAQ,IAAO,IAAM0E,KAAQ,IAAO,EACjDA,IAAO,SAEPtH,EAAKvd,KAAK2T,KAAKsO,EAAKe,GACpB7C,EAAMngB,KAAK2T,KAAKsO,EAAKgB,IACrB9C,EAAOA,EAAMngB,KAAK2T,KAAKuO,EAAKc,GAAQ,EACpC7E,EAAKne,KAAK2T,KAAKuO,EAAKe,IACpB1F,EAAMA,EAAKvd,KAAK2T,KAAKmO,EAAKqB,IAAQ,EAClChD,EAAOA,EAAMngB,KAAK2T,KAAKmO,EAAKsB,IAAQ,EACpCjD,EAAOA,EAAMngB,KAAK2T,KAAKoO,EAAKoB,IAAQ,EACpChF,EAAMA,EAAKne,KAAK2T,KAAKoO,EAAKqB,IAAQ,EAClC7F,EAAMA,EAAKvd,KAAK2T,KAAKgO,EAAK2B,IAAQ,EAClCnD,EAAOA,EAAMngB,KAAK2T,KAAKgO,EAAK4B,IAAQ,EACpCpD,EAAOA,EAAMngB,KAAK2T,KAAKiO,EAAK0B,IAAQ,EACpCnF,EAAMA,EAAKne,KAAK2T,KAAKiO,EAAK2B,IAAQ,EAClChG,EAAMA,EAAKvd,KAAK2T,KAAK6N,EAAKiC,IAAQ,EAClCtD,EAAOA,EAAMngB,KAAK2T,KAAK6N,EAAKkC,IAAQ,EACpCvD,EAAOA,EAAMngB,KAAK2T,KAAK8N,EAAKgC,IAAQ,EACpCtF,EAAMA,EAAKne,KAAK2T,KAAK8N,EAAKiC,IAAQ,EAClCnG,EAAMA,EAAKvd,KAAK2T,KAAK0N,EAAKuC,IAAQ,EAClCzD,EAAOA,EAAMngB,KAAK2T,KAAK0N,EAAKwC,IAAQ,EACpC1D,EAAOA,EAAMngB,KAAK2T,KAAK2N,EAAKsC,IAAQ,EACpCzF,EAAMA,EAAKne,KAAK2T,KAAK2N,EAAKuC,IAAQ,EAClCtG,EAAMA,EAAKvd,KAAK2T,KAAKuN,EAAK6C,IAAQ,EAClC5D,EAAOA,EAAMngB,KAAK2T,KAAKuN,EAAK8C,IAAQ,EACpC7D,EAAOA,EAAMngB,KAAK2T,KAAKwN,EAAK4C,IAAQ,EACpC5F,EAAMA,EAAKne,KAAK2T,KAAKwN,EAAK6C,IAAQ,EAClC,IAAIc,IAASngB,EAAI4Y,EAAM,KAAa,KAAN4C,IAAiB,IAAO,EACtDxb,GAAOwZ,GAAMgC,IAAQ,IAAO,IAAM2E,KAAQ,IAAO,EACjDA,IAAO,SAEPvH,EAAKvd,KAAK2T,KAAKsO,EAAKkB,IACpBhD,EAAMngB,KAAK2T,KAAKsO,EAAKmB,IACrBjD,EAAOA,EAAMngB,KAAK2T,KAAKuO,EAAKiB,IAAQ,EACpChF,EAAKne,KAAK2T,KAAKuO,EAAKkB,IACpB7F,EAAMA,EAAKvd,KAAK2T,KAAKmO,EAAKwB,IAAQ,EAClCnD,EAAOA,EAAMngB,KAAK2T,KAAKmO,EAAKyB,IAAQ,EACpCpD,EAAOA,EAAMngB,KAAK2T,KAAKoO,EAAKuB,IAAQ,EACpCnF,EAAMA,EAAKne,KAAK2T,KAAKoO,EAAKwB,IAAQ,EAClChG,EAAMA,EAAKvd,KAAK2T,KAAKgO,EAAK8B,IAAQ,EAClCtD,EAAOA,EAAMngB,KAAK2T,KAAKgO,EAAK+B,IAAQ,EACpCvD,EAAOA,EAAMngB,KAAK2T,KAAKiO,EAAK6B,IAAQ,EACpCtF,EAAMA,EAAKne,KAAK2T,KAAKiO,EAAK8B,IAAQ,EAClCnG,EAAMA,EAAKvd,KAAK2T,KAAK6N,EAAKoC,IAAQ,EAClCzD,EAAOA,EAAMngB,KAAK2T,KAAK6N,EAAKqC,IAAQ,EACpC1D,EAAOA,EAAMngB,KAAK2T,KAAK8N,EAAKmC,IAAQ,EACpCzF,EAAMA,EAAKne,KAAK2T,KAAK8N,EAAKoC,IAAQ,EAClCtG,EAAMA,EAAKvd,KAAK2T,KAAK0N,EAAK0C,IAAQ,EAClC5D,EAAOA,EAAMngB,KAAK2T,KAAK0N,EAAK2C,IAAQ,EACpC7D,EAAOA,EAAMngB,KAAK2T,KAAK2N,EAAKyC,IAAQ,EACpC5F,EAAMA,EAAKne,KAAK2T,KAAK2N,EAAK0C,IAAQ,EAClC,IAAIe,IAASpgB,EAAI4Y,EAAM,KAAa,KAAN4C,IAAiB,IAAO,EACtDxb,GAAOwZ,GAAMgC,IAAQ,IAAO,IAAM4E,KAAQ,IAAO,EACjDA,IAAO,SAEPxH,EAAKvd,KAAK2T,KAAKsO,EAAKqB,IACpBnD,EAAMngB,KAAK2T,KAAKsO,EAAKsB,IACrBpD,EAAOA,EAAMngB,KAAK2T,KAAKuO,EAAKoB,IAAQ,EACpCnF,EAAKne,KAAK2T,KAAKuO,EAAKqB,IACpBhG,EAAMA,EAAKvd,KAAK2T,KAAKmO,EAAK2B,IAAQ,EAClCtD,EAAOA,EAAMngB,KAAK2T,KAAKmO,EAAK4B,IAAQ,EACpCvD,EAAOA,EAAMngB,KAAK2T,KAAKoO,EAAK0B,IAAQ,EACpCtF,EAAMA,EAAKne,KAAK2T,KAAKoO,EAAK2B,IAAQ,EAClCnG,EAAMA,EAAKvd,KAAK2T,KAAKgO,EAAKiC,IAAQ,EAClCzD,EAAOA,EAAMngB,KAAK2T,KAAKgO,EAAKkC,IAAQ,EACpC1D,EAAOA,EAAMngB,KAAK2T,KAAKiO,EAAKgC,IAAQ,EACpCzF,EAAMA,EAAKne,KAAK2T,KAAKiO,EAAKiC,IAAQ,EAClCtG,EAAMA,EAAKvd,KAAK2T,KAAK6N,EAAKuC,IAAQ,EAClC5D,EAAOA,EAAMngB,KAAK2T,KAAK6N,EAAKwC,IAAQ,EACpC7D,EAAOA,EAAMngB,KAAK2T,KAAK8N,EAAKsC,IAAQ,EACpC5F,EAAMA,EAAKne,KAAK2T,KAAK8N,EAAKuC,IAAQ,EAClC,IAAIgB,IAASrgB,EAAI4Y,EAAM,KAAa,KAAN4C,IAAiB,IAAO,EACtDxb,GAAOwZ,GAAMgC,IAAQ,IAAO,IAAM6E,KAAQ,IAAO,EACjDA,IAAO,SAEPzH,EAAKvd,KAAK2T,KAAKsO,EAAKwB,IACpBtD,EAAMngB,KAAK2T,KAAKsO,EAAKyB,IACrBvD,EAAOA,EAAMngB,KAAK2T,KAAKuO,EAAKuB,IAAQ,EACpCtF,EAAKne,KAAK2T,KAAKuO,EAAKwB,IACpBnG,EAAMA,EAAKvd,KAAK2T,KAAKmO,EAAK8B,IAAQ,EAClCzD,EAAOA,EAAMngB,KAAK2T,KAAKmO,EAAK+B,IAAQ,EACpC1D,EAAOA,EAAMngB,KAAK2T,KAAKoO,EAAK6B,IAAQ,EACpCzF,EAAMA,EAAKne,KAAK2T,KAAKoO,EAAK8B,IAAQ,EAClCtG,EAAMA,EAAKvd,KAAK2T,KAAKgO,EAAKoC,IAAQ,EAClC5D,EAAOA,EAAMngB,KAAK2T,KAAKgO,EAAKqC,IAAQ,EACpC7D,EAAOA,EAAMngB,KAAK2T,KAAKiO,EAAKmC,IAAQ,EACpC5F,EAAMA,EAAKne,KAAK2T,KAAKiO,EAAKoC,IAAQ,EAClC,IAAIiB,IAAStgB,EAAI4Y,EAAM,KAAa,KAAN4C,IAAiB,IAAO,EACtDxb,GAAOwZ,GAAMgC,IAAQ,IAAO,IAAM8E,KAAQ,IAAO,EACjDA,IAAO,SAEP1H,EAAKvd,KAAK2T,KAAKsO,EAAK2B,IACpBzD,EAAMngB,KAAK2T,KAAKsO,EAAK4B,IACrB1D,EAAOA,EAAMngB,KAAK2T,KAAKuO,EAAK0B,IAAQ,EACpCzF,EAAKne,KAAK2T,KAAKuO,EAAK2B,IACpBtG,EAAMA,EAAKvd,KAAK2T,KAAKmO,EAAKiC,IAAQ,EAClC5D,EAAOA,EAAMngB,KAAK2T,KAAKmO,EAAKkC,IAAQ,EACpC7D,EAAOA,EAAMngB,KAAK2T,KAAKoO,EAAKgC,IAAQ,EACpC5F,EAAMA,EAAKne,KAAK2T,KAAKoO,EAAKiC,IAAQ,EAClC,IAAIkB,IAASvgB,EAAI4Y,EAAM,KAAa,KAAN4C,IAAiB,IAAO,EACtDxb,GAAOwZ,GAAMgC,IAAQ,IAAO,IAAM+E,KAAQ,IAAO,EACjDA,IAAO,SAEP3H,EAAKvd,KAAK2T,KAAKsO,EAAK8B,IACpB5D,EAAMngB,KAAK2T,KAAKsO,EAAK+B,IACrB7D,EAAOA,EAAMngB,KAAK2T,KAAKuO,EAAK6B,IAAQ,EACpC5F,EAAKne,KAAK2T,KAAKuO,EAAK8B,IACpB,IAAImB,IAASxgB,EAAI4Y,EAAM,KAAa,KAAN4C,IAAiB,IAAO,EA0BtD,OAzBAxb,GAAOwZ,GAAMgC,IAAQ,IAAO,IAAMgF,KAAQ,IAAO,EACjDA,IAAO,SACP/E,EAAE,GAAK6D,GACP7D,EAAE,GAAK8D,GACP9D,EAAE,GAAK+D,GACP/D,EAAE,GAAKgE,GACPhE,EAAE,GAAKiE,GACPjE,EAAE,GAAKkE,GACPlE,EAAE,GAAKmE,GACPnE,EAAE,GAAKoE,GACPpE,EAAE,GAAKqE,GACPrE,EAAE,GAAKsE,GACPtE,EAAE,IAAMuE,GACRvE,EAAE,IAAMwE,GACRxE,EAAE,IAAMyE,GACRzE,EAAE,IAAM0E,GACR1E,EAAE,IAAM2E,GACR3E,EAAE,IAAM4E,GACR5E,EAAE,IAAM6E,GACR7E,EAAE,IAAM8E,GACR9E,EAAE,IAAM+E,GACE,IAANxgB,IACFyb,EAAE,IAAMzb,EACR+I,EAAInM,UAECmM,GAQT,SAAS0X,EAAUrU,EAAM4J,EAAKjN,GAC5BA,EAAIqM,SAAWY,EAAIZ,SAAWhJ,EAAKgJ,SACnCrM,EAAInM,OAASwP,EAAKxP,OAASoZ,EAAIpZ,OAI/B,IAFA,IAAIgb,EAAQ,EACR8I,EAAU,EACLzS,EAAI,EAAGA,EAAIlF,EAAInM,OAAS,EAAGqR,IAAK,CAGvC,IAAI4K,EAAS6H,EACbA,EAAU,EAGV,IAFA,IAAI5H,EAAgB,SAARlB,EACRmB,EAAO1d,KAAKmV,IAAIvC,EAAG+H,EAAIpZ,OAAS,GAC3B+Z,EAAItb,KAAK4a,IAAI,EAAGhI,EAAI7B,EAAKxP,OAAS,GAAI+Z,GAAKoC,EAAMpC,IAAK,CAC7D,IAAIja,EAAIuR,EAAI0I,EACRlG,EAAoB,EAAhBrE,EAAKiJ,MAAM3Y,GACfgU,EAAmB,EAAfsF,EAAIX,MAAMsB,GACdpI,EAAIkC,EAAIC,EAERkI,EAAS,SAAJrK,EACTsK,EAAUA,GAAWtK,EAAI,SAAa,GAAM,EAC5CqK,EAAMA,EAAKE,EAAS,EACpBA,EAAa,SAALF,EACRC,EAAUA,GAAUD,IAAO,IAAO,EAElC8H,GAAW7H,IAAW,GACtBA,GAAU,SAEZ9P,EAAIsM,MAAMpH,GAAK6K,EACflB,EAAQiB,EACRA,EAAS6H,EAQX,OANc,IAAV9I,EACF7O,EAAIsM,MAAMpH,GAAK2J,EAEf7O,EAAInM,SAGCmM,EAAI0N,SAGb,SAASkK,EAAYvU,EAAM4J,EAAKjN,GAI9B,OAAO0X,EAASrU,EAAM4J,EAAKjN,GAsB7B,SAAS6X,EAAM1S,EAAG2D,GAChB/S,KAAKoP,EAAIA,EACTpP,KAAK+S,EAAIA,EAzENxW,KAAK2T,OACRuM,EAAc5C,GAmDhBlM,EAAGvO,UAAU2iB,MAAQ,SAAgB7K,EAAKjN,GACxC,IAAIuG,EACA/H,EAAMzI,KAAKlC,OAASoZ,EAAIpZ,OAW5B,OATE0S,EADkB,KAAhBxQ,KAAKlC,QAAgC,KAAfoZ,EAAIpZ,OACtB2e,EAAYzc,KAAMkX,EAAKjN,GACpBxB,EAAM,GACToR,EAAW7Z,KAAMkX,EAAKjN,GACnBxB,EAAM,KACTkZ,EAAS3hB,KAAMkX,EAAKjN,GAEpB4X,EAAW7hB,KAAMkX,EAAKjN,GAGvBuG,GAWTsR,EAAK1iB,UAAU4iB,QAAU,SAAkBC,GAGzC,IAFA,IAAI7Q,EAAI,IAAI7O,MAAM0f,GACd7Y,EAAIuE,EAAGvO,UAAUob,WAAWyH,GAAK,EAC5BrkB,EAAI,EAAGA,EAAIqkB,EAAGrkB,IACrBwT,EAAExT,GAAKoC,KAAKkiB,OAAOtkB,EAAGwL,EAAG6Y,GAG3B,OAAO7Q,GAIT0Q,EAAK1iB,UAAU8iB,OAAS,SAAiB9S,EAAGhG,EAAG6Y,GAC7C,GAAU,IAAN7S,GAAWA,IAAM6S,EAAI,EAAG,OAAO7S,EAGnC,IADA,IAAI+S,EAAK,EACAvkB,EAAI,EAAGA,EAAIwL,EAAGxL,IACrBukB,IAAW,EAAJ/S,IAAWhG,EAAIxL,EAAI,EAC1BwR,IAAM,EAGR,OAAO+S,GAKTL,EAAK1iB,UAAUgjB,QAAU,SAAkBC,EAAKC,EAAKC,EAAKC,EAAMC,EAAMR,GACpE,IAAK,IAAIrkB,EAAI,EAAGA,EAAIqkB,EAAGrkB,IACrB4kB,EAAK5kB,GAAK0kB,EAAID,EAAIzkB,IAClB6kB,EAAK7kB,GAAK2kB,EAAIF,EAAIzkB,KAItBkkB,EAAK1iB,UAAUsjB,UAAY,SAAoBJ,EAAKC,EAAKC,EAAMC,EAAMR,EAAGI,GACtEriB,KAAKoiB,QAAQC,EAAKC,EAAKC,EAAKC,EAAMC,EAAMR,GAExC,IAAK,IAAIzhB,EAAI,EAAGA,EAAIyhB,EAAGzhB,IAAM,EAM3B,IALA,IAAI4I,EAAI5I,GAAK,EAETmiB,EAAQpmB,KAAKqmB,IAAI,EAAIrmB,KAAKsmB,GAAKzZ,GAC/B0Z,EAAQvmB,KAAKwmB,IAAI,EAAIxmB,KAAKsmB,GAAKzZ,GAE1B3I,EAAI,EAAGA,EAAIwhB,EAAGxhB,GAAK2I,EAI1B,IAHA,IAAI4Z,EAASL,EACTM,EAASH,EAEJjL,EAAI,EAAGA,EAAIrX,EAAGqX,IAAK,CAC1B,IAAIqL,EAAKV,EAAK/hB,EAAIoX,GACdsL,EAAKV,EAAKhiB,EAAIoX,GAEduL,EAAKZ,EAAK/hB,EAAIoX,EAAIrX,GAClB6iB,EAAKZ,EAAKhiB,EAAIoX,EAAIrX,GAElB8iB,EAAKN,EAASI,EAAKH,EAASI,EAEhCA,EAAKL,EAASK,EAAKJ,EAASG,EAC5BA,EAAKE,EAELd,EAAK/hB,EAAIoX,GAAKqL,EAAKE,EACnBX,EAAKhiB,EAAIoX,GAAKsL,EAAKE,EAEnBb,EAAK/hB,EAAIoX,EAAIrX,GAAK0iB,EAAKE,EACvBX,EAAKhiB,EAAIoX,EAAIrX,GAAK2iB,EAAKE,EAGnBxL,IAAMzO,IACRka,EAAKX,EAAQK,EAASF,EAAQG,EAE9BA,EAASN,EAAQM,EAASH,EAAQE,EAClCA,EAASM,KAOnBxB,EAAK1iB,UAAUmkB,YAAc,SAAsB7iB,EAAG8iB,GACpD,IAAIvB,EAAqB,EAAjB1lB,KAAK4a,IAAIqM,EAAG9iB,GAChB+iB,EAAU,EAAJxB,EACNrkB,EAAI,EACR,IAAKqkB,EAAIA,EAAI,EAAI,EAAGA,EAAGA,KAAU,EAC/BrkB,IAGF,OAAO,GAAKA,EAAI,EAAI6lB,GAGtB3B,EAAK1iB,UAAUskB,UAAY,SAAoBpB,EAAKC,EAAKN,GACvD,KAAIA,GAAK,GAET,IAAK,IAAIrkB,EAAI,EAAGA,EAAIqkB,EAAI,EAAGrkB,IAAK,CAC9B,IAAIwT,EAAIkR,EAAI1kB,GAEZ0kB,EAAI1kB,GAAK0kB,EAAIL,EAAIrkB,EAAI,GACrB0kB,EAAIL,EAAIrkB,EAAI,GAAKwT,EAEjBA,EAAImR,EAAI3kB,GAER2kB,EAAI3kB,IAAM2kB,EAAIN,EAAIrkB,EAAI,GACtB2kB,EAAIN,EAAIrkB,EAAI,IAAMwT,IAItB0Q,EAAK1iB,UAAUukB,aAAe,SAAuBC,EAAI3B,GAEvD,IADA,IAAInJ,EAAQ,EACHlb,EAAI,EAAGA,EAAIqkB,EAAI,EAAGrkB,IAAK,CAC9B,IAAI0V,EAAoC,KAAhC/W,KAAKsnB,MAAMD,EAAG,EAAIhmB,EAAI,GAAKqkB,GACjC1lB,KAAKsnB,MAAMD,EAAG,EAAIhmB,GAAKqkB,GACvBnJ,EAEF8K,EAAGhmB,GAAS,SAAJ0V,EAGNwF,EADExF,EAAI,SACE,EAEAA,EAAI,SAAY,EAI5B,OAAOsQ,GAGT9B,EAAK1iB,UAAU0kB,WAAa,SAAqBF,EAAInb,EAAK6Z,EAAKL,GAE7D,IADA,IAAInJ,EAAQ,EACHlb,EAAI,EAAGA,EAAI6K,EAAK7K,IACvBkb,GAAyB,EAAR8K,EAAGhmB,GAEpB0kB,EAAI,EAAI1kB,GAAa,KAARkb,EAAgBA,KAAkB,GAC/CwJ,EAAI,EAAI1kB,EAAI,GAAa,KAARkb,EAAgBA,KAAkB,GAIrD,IAAKlb,EAAI,EAAI6K,EAAK7K,EAAIqkB,IAAKrkB,EACzB0kB,EAAI1kB,GAAK,EAGX8X,EAAiB,IAAVoD,GACPpD,EAA6B,MAAb,KAARoD,KAGVgJ,EAAK1iB,UAAU2kB,KAAO,SAAe9B,GAEnC,IADA,IAAI+B,EAAK,IAAIzhB,MAAM0f,GACVrkB,EAAI,EAAGA,EAAIqkB,EAAGrkB,IACrBomB,EAAGpmB,GAAK,EAGV,OAAOomB,GAGTlC,EAAK1iB,UAAU6kB,KAAO,SAAe7U,EAAG2D,EAAG9I,GACzC,IAAIgY,EAAI,EAAIjiB,KAAKujB,YAAYnU,EAAEtR,OAAQiV,EAAEjV,QAErCukB,EAAMriB,KAAKgiB,QAAQC,GAEnB3gB,EAAItB,KAAK+jB,KAAK9B,GAEdK,EAAM,IAAI/f,MAAM0f,GAChBiC,EAAO,IAAI3hB,MAAM0f,GACjBkC,EAAO,IAAI5hB,MAAM0f,GAEjBmC,EAAO,IAAI7hB,MAAM0f,GACjBoC,EAAQ,IAAI9hB,MAAM0f,GAClBqC,EAAQ,IAAI/hB,MAAM0f,GAElBsC,EAAOta,EAAIsM,MACfgO,EAAKzmB,OAASmkB,EAEdjiB,KAAK8jB,WAAW1U,EAAEmH,MAAOnH,EAAEtR,OAAQwkB,EAAKL,GACxCjiB,KAAK8jB,WAAW/Q,EAAEwD,MAAOxD,EAAEjV,OAAQsmB,EAAMnC,GAEzCjiB,KAAK0iB,UAAUJ,EAAKhhB,EAAG4iB,EAAMC,EAAMlC,EAAGI,GACtCriB,KAAK0iB,UAAU0B,EAAM9iB,EAAG+iB,EAAOC,EAAOrC,EAAGI,GAEzC,IAAK,IAAIzkB,EAAI,EAAGA,EAAIqkB,EAAGrkB,IAAK,CAC1B,IAAI0lB,EAAKY,EAAKtmB,GAAKymB,EAAMzmB,GAAKumB,EAAKvmB,GAAK0mB,EAAM1mB,GAC9CumB,EAAKvmB,GAAKsmB,EAAKtmB,GAAK0mB,EAAM1mB,GAAKumB,EAAKvmB,GAAKymB,EAAMzmB,GAC/CsmB,EAAKtmB,GAAK0lB,EAUZ,OAPAtjB,KAAK0jB,UAAUQ,EAAMC,EAAMlC,GAC3BjiB,KAAK0iB,UAAUwB,EAAMC,EAAMI,EAAMjjB,EAAG2gB,EAAGI,GACvCriB,KAAK0jB,UAAUa,EAAMjjB,EAAG2gB,GACxBjiB,KAAK2jB,aAAaY,EAAMtC,GAExBhY,EAAIqM,SAAWlH,EAAEkH,SAAWvD,EAAEuD,SAC9BrM,EAAInM,OAASsR,EAAEtR,OAASiV,EAAEjV,OACnBmM,EAAI0N,UAIbhK,EAAGvO,UAAUgR,IAAM,SAAc8G,GAC/B,IAAIjN,EAAM,IAAI0D,EAAG,MAEjB,OADA1D,EAAIsM,MAAQ,IAAIhU,MAAMvC,KAAKlC,OAASoZ,EAAIpZ,QACjCkC,KAAK+hB,MAAM7K,EAAKjN,IAIzB0D,EAAGvO,UAAUolB,KAAO,SAAetN,GACjC,IAAIjN,EAAM,IAAI0D,EAAG,MAEjB,OADA1D,EAAIsM,MAAQ,IAAIhU,MAAMvC,KAAKlC,OAASoZ,EAAIpZ,QACjC+jB,EAAW7hB,KAAMkX,EAAKjN,IAI/B0D,EAAGvO,UAAU8Q,KAAO,SAAegH,GACjC,OAAOlX,KAAKsY,QAAQyJ,MAAM7K,EAAKlX,OAGjC2N,EAAGvO,UAAU8Y,MAAQ,SAAgBhB,GACnC,IAAIuN,EAAWvN,EAAM,EACjBuN,IAAUvN,GAAOA,GAErBxB,EAAsB,kBAARwB,GACdxB,EAAOwB,EAAM,UAIb,IADA,IAAI4B,EAAQ,EACHlb,EAAI,EAAGA,EAAIoC,KAAKlC,OAAQF,IAAK,CACpC,IAAI0V,GAAqB,EAAhBtT,KAAKuW,MAAM3Y,IAAUsZ,EAC1B4C,GAAU,SAAJxG,IAA0B,SAARwF,GAC5BA,IAAU,GACVA,GAAUxF,EAAI,SAAa,EAE3BwF,GAASgB,IAAO,GAChB9Z,KAAKuW,MAAM3Y,GAAU,SAALkc,EAQlB,OALc,IAAVhB,IACF9Y,KAAKuW,MAAM3Y,GAAKkb,EAChB9Y,KAAKlC,UAGA2mB,EAAWzkB,KAAKob,OAASpb,MAGlC2N,EAAGvO,UAAUslB,KAAO,SAAexN,GACjC,OAAOlX,KAAKsY,QAAQJ,MAAMhB,IAI5BvJ,EAAGvO,UAAUulB,IAAM,WACjB,OAAO3kB,KAAKoQ,IAAIpQ,OAIlB2N,EAAGvO,UAAUwlB,KAAO,WAClB,OAAO5kB,KAAKkQ,KAAKlQ,KAAKsY,UAIxB3K,EAAGvO,UAAUgZ,IAAM,SAAclB,GAC/B,IAAI5D,EAAIoG,EAAWxC,GACnB,GAAiB,IAAb5D,EAAExV,OAAc,OAAO,IAAI6P,EAAG,GAIlC,IADA,IAAI6C,EAAMxQ,KACDpC,EAAI,EAAGA,EAAI0V,EAAExV,OAAQF,IAAK4S,EAAMA,EAAImU,MAC3C,GAAa,IAATrR,EAAE1V,GAAU,MAGlB,KAAMA,EAAI0V,EAAExV,OACV,IAAK,IAAIyR,EAAIiB,EAAImU,MAAO/mB,EAAI0V,EAAExV,OAAQF,IAAK2R,EAAIA,EAAEoV,MAClC,IAATrR,EAAE1V,KAEN4S,EAAMA,EAAIJ,IAAIb,IAIlB,OAAOiB,GAIT7C,EAAGvO,UAAUylB,OAAS,SAAiB5T,GACrCyE,EAAuB,kBAATzE,GAAqBA,GAAQ,GAC3C,IAGIrT,EAHA6R,EAAIwB,EAAO,GACXzQ,GAAKyQ,EAAOxB,GAAK,GACjBqV,EAAa,WAAe,GAAKrV,GAAQ,GAAKA,EAGlD,GAAU,IAANA,EAAS,CACX,IAAIqJ,EAAQ,EAEZ,IAAKlb,EAAI,EAAGA,EAAIoC,KAAKlC,OAAQF,IAAK,CAChC,IAAImnB,EAAW/kB,KAAKuW,MAAM3Y,GAAKknB,EAC3B5jB,GAAsB,EAAhBlB,KAAKuW,MAAM3Y,IAAUmnB,GAAatV,EAC5CzP,KAAKuW,MAAM3Y,GAAKsD,EAAI4X,EACpBA,EAAQiM,IAAc,GAAKtV,EAGzBqJ,IACF9Y,KAAKuW,MAAM3Y,GAAKkb,EAChB9Y,KAAKlC,UAIT,GAAU,IAAN0C,EAAS,CACX,IAAK5C,EAAIoC,KAAKlC,OAAS,EAAGF,GAAK,EAAGA,IAChCoC,KAAKuW,MAAM3Y,EAAI4C,GAAKR,KAAKuW,MAAM3Y,GAGjC,IAAKA,EAAI,EAAGA,EAAI4C,EAAG5C,IACjBoC,KAAKuW,MAAM3Y,GAAK,EAGlBoC,KAAKlC,QAAU0C,EAGjB,OAAOR,KAAK2X,UAGdhK,EAAGvO,UAAU4lB,MAAQ,SAAgB/T,GAGnC,OADAyE,EAAyB,IAAlB1V,KAAKsW,UACLtW,KAAK6kB,OAAO5T,IAMrBtD,EAAGvO,UAAU6lB,OAAS,SAAiBhU,EAAMiU,EAAMC,GAEjD,IAAIC,EADJ1P,EAAuB,kBAATzE,GAAqBA,GAAQ,GAGzCmU,EADEF,GACGA,EAAQA,EAAO,IAAO,GAEvB,EAGN,IAAIzV,EAAIwB,EAAO,GACXzQ,EAAIjE,KAAKmV,KAAKT,EAAOxB,GAAK,GAAIzP,KAAKlC,QACnCunB,EAAO,SAAc,WAAc5V,GAAMA,EACzC6V,EAAcH,EAMlB,GAJAC,GAAK5kB,EACL4kB,EAAI7oB,KAAK4a,IAAI,EAAGiO,GAGZE,EAAa,CACf,IAAK,IAAI1nB,EAAI,EAAGA,EAAI4C,EAAG5C,IACrB0nB,EAAY/O,MAAM3Y,GAAKoC,KAAKuW,MAAM3Y,GAEpC0nB,EAAYxnB,OAAS0C,EAGvB,GAAU,IAANA,QAEG,GAAIR,KAAKlC,OAAS0C,EAEvB,IADAR,KAAKlC,QAAU0C,EACV5C,EAAI,EAAGA,EAAIoC,KAAKlC,OAAQF,IAC3BoC,KAAKuW,MAAM3Y,GAAKoC,KAAKuW,MAAM3Y,EAAI4C,QAGjCR,KAAKuW,MAAM,GAAK,EAChBvW,KAAKlC,OAAS,EAGhB,IAAIgb,EAAQ,EACZ,IAAKlb,EAAIoC,KAAKlC,OAAS,EAAGF,GAAK,IAAgB,IAAVkb,GAAelb,GAAKwnB,GAAIxnB,IAAK,CAChE,IAAIqa,EAAuB,EAAhBjY,KAAKuW,MAAM3Y,GACtBoC,KAAKuW,MAAM3Y,GAAMkb,GAAU,GAAKrJ,EAAOwI,IAASxI,EAChDqJ,EAAQb,EAAOoN,EAajB,OATIC,GAAyB,IAAVxM,IACjBwM,EAAY/O,MAAM+O,EAAYxnB,UAAYgb,GAGxB,IAAhB9Y,KAAKlC,SACPkC,KAAKuW,MAAM,GAAK,EAChBvW,KAAKlC,OAAS,GAGTkC,KAAK2X,UAGdhK,EAAGvO,UAAU+R,MAAQ,SAAgBF,EAAMiU,EAAMC,GAG/C,OADAzP,EAAyB,IAAlB1V,KAAKsW,UACLtW,KAAKilB,OAAOhU,EAAMiU,EAAMC,IAIjCxX,EAAGvO,UAAUmmB,KAAO,SAAetU,GACjC,OAAOjR,KAAKsY,QAAQ0M,MAAM/T,IAG5BtD,EAAGvO,UAAUomB,MAAQ,SAAgBvU,GACnC,OAAOjR,KAAKsY,QAAQuM,OAAO5T,IAI7BtD,EAAGvO,UAAUqmB,KAAO,SAAexU,GACjC,OAAOjR,KAAKsY,QAAQnH,MAAMF,IAG5BtD,EAAGvO,UAAUsmB,MAAQ,SAAgBzU,GACnC,OAAOjR,KAAKsY,QAAQ2M,OAAOhU,IAI7BtD,EAAGvO,UAAU8b,MAAQ,SAAgBvB,GACnCjE,EAAsB,kBAARiE,GAAoBA,GAAO,GACzC,IAAIlK,EAAIkK,EAAM,GACVnZ,GAAKmZ,EAAMlK,GAAK,GAChBF,EAAI,GAAKE,EAGb,GAAIzP,KAAKlC,QAAU0C,EAAG,OAAO,EAG7B,IAAI8S,EAAItT,KAAKuW,MAAM/V,GAEnB,SAAU8S,EAAI/D,IAIhB5B,EAAGvO,UAAUumB,OAAS,SAAiB1U,GACrCyE,EAAuB,kBAATzE,GAAqBA,GAAQ,GAC3C,IAAIxB,EAAIwB,EAAO,GACXzQ,GAAKyQ,EAAOxB,GAAK,GAIrB,GAFAiG,EAAyB,IAAlB1V,KAAKsW,SAAgB,2CAExBtW,KAAKlC,QAAU0C,EACjB,OAAOR,KAQT,GALU,IAANyP,GACFjP,IAEFR,KAAKlC,OAASvB,KAAKmV,IAAIlR,EAAGR,KAAKlC,QAErB,IAAN2R,EAAS,CACX,IAAI4V,EAAO,SAAc,WAAc5V,GAAMA,EAC7CzP,KAAKuW,MAAMvW,KAAKlC,OAAS,IAAMunB,EAGjC,OAAOrlB,KAAK2X,UAIdhK,EAAGvO,UAAUwmB,MAAQ,SAAgB3U,GACnC,OAAOjR,KAAKsY,QAAQqN,OAAO1U,IAI7BtD,EAAGvO,UAAU4b,MAAQ,SAAgB9D,GAGnC,OAFAxB,EAAsB,kBAARwB,GACdxB,EAAOwB,EAAM,UACTA,EAAM,EAAUlX,KAAK6lB,OAAO3O,GAGV,IAAlBlX,KAAKsW,SACa,IAAhBtW,KAAKlC,SAAiC,EAAhBkC,KAAKuW,MAAM,KAAWW,GAC9ClX,KAAKuW,MAAM,GAAKW,GAAuB,EAAhBlX,KAAKuW,MAAM,IAClCvW,KAAKsW,SAAW,EACTtW,OAGTA,KAAKsW,SAAW,EAChBtW,KAAK6lB,MAAM3O,GACXlX,KAAKsW,SAAW,EACTtW,MAIFA,KAAKmY,OAAOjB,IAGrBvJ,EAAGvO,UAAU+Y,OAAS,SAAiBjB,GACrClX,KAAKuW,MAAM,IAAMW,EAGjB,IAAK,IAAItZ,EAAI,EAAGA,EAAIoC,KAAKlC,QAAUkC,KAAKuW,MAAM3Y,IAAM,SAAWA,IAC7DoC,KAAKuW,MAAM3Y,IAAM,SACbA,IAAMoC,KAAKlC,OAAS,EACtBkC,KAAKuW,MAAM3Y,EAAI,GAAK,EAEpBoC,KAAKuW,MAAM3Y,EAAI,KAKnB,OAFAoC,KAAKlC,OAASvB,KAAK4a,IAAInX,KAAKlC,OAAQF,EAAI,GAEjCoC,MAIT2N,EAAGvO,UAAUymB,MAAQ,SAAgB3O,GAGnC,GAFAxB,EAAsB,kBAARwB,GACdxB,EAAOwB,EAAM,UACTA,EAAM,EAAG,OAAOlX,KAAKgb,OAAO9D,GAEhC,GAAsB,IAAlBlX,KAAKsW,SAIP,OAHAtW,KAAKsW,SAAW,EAChBtW,KAAKgb,MAAM9D,GACXlX,KAAKsW,SAAW,EACTtW,KAKT,GAFAA,KAAKuW,MAAM,IAAMW,EAEG,IAAhBlX,KAAKlC,QAAgBkC,KAAKuW,MAAM,GAAK,EACvCvW,KAAKuW,MAAM,IAAMvW,KAAKuW,MAAM,GAC5BvW,KAAKsW,SAAW,OAGhB,IAAK,IAAI1Y,EAAI,EAAGA,EAAIoC,KAAKlC,QAAUkC,KAAKuW,MAAM3Y,GAAK,EAAGA,IACpDoC,KAAKuW,MAAM3Y,IAAM,SACjBoC,KAAKuW,MAAM3Y,EAAI,IAAM,EAIzB,OAAOoC,KAAK2X,UAGdhK,EAAGvO,UAAU0mB,KAAO,SAAe5O,GACjC,OAAOlX,KAAKsY,QAAQ0C,MAAM9D,IAG5BvJ,EAAGvO,UAAU2mB,KAAO,SAAe7O,GACjC,OAAOlX,KAAKsY,QAAQuN,MAAM3O,IAG5BvJ,EAAGvO,UAAU4mB,KAAO,WAGlB,OAFAhmB,KAAKsW,SAAW,EAETtW,MAGT2N,EAAGvO,UAAU0b,IAAM,WACjB,OAAO9a,KAAKsY,QAAQ0N,QAGtBrY,EAAGvO,UAAU6mB,aAAe,SAAuB/O,EAAK9G,EAAKrP,GAC3D,IACInD,EAIA0V,EALA7K,EAAMyO,EAAIpZ,OAASiD,EAGvBf,KAAKuY,QAAQ9P,GAGb,IAAIqQ,EAAQ,EACZ,IAAKlb,EAAI,EAAGA,EAAIsZ,EAAIpZ,OAAQF,IAAK,CAC/B0V,GAA6B,EAAxBtT,KAAKuW,MAAM3Y,EAAImD,IAAc+X,EAClC,IAAIzB,GAAwB,EAAfH,EAAIX,MAAM3Y,IAAUwS,EACjCkD,GAAa,SAAR+D,EACLyB,GAASxF,GAAK,KAAQ+D,EAAQ,SAAa,GAC3CrX,KAAKuW,MAAM3Y,EAAImD,GAAa,SAAJuS,EAE1B,KAAO1V,EAAIoC,KAAKlC,OAASiD,EAAOnD,IAC9B0V,GAA6B,EAAxBtT,KAAKuW,MAAM3Y,EAAImD,IAAc+X,EAClCA,EAAQxF,GAAK,GACbtT,KAAKuW,MAAM3Y,EAAImD,GAAa,SAAJuS,EAG1B,GAAc,IAAVwF,EAAa,OAAO9Y,KAAK2X,SAK7B,IAFAjC,GAAkB,IAAXoD,GACPA,EAAQ,EACHlb,EAAI,EAAGA,EAAIoC,KAAKlC,OAAQF,IAC3B0V,IAAsB,EAAhBtT,KAAKuW,MAAM3Y,IAAUkb,EAC3BA,EAAQxF,GAAK,GACbtT,KAAKuW,MAAM3Y,GAAS,SAAJ0V,EAIlB,OAFAtT,KAAKsW,SAAW,EAETtW,KAAK2X,UAGdhK,EAAGvO,UAAU8mB,SAAW,SAAmBhP,EAAKiP,GAC9C,IAAIplB,EAAQf,KAAKlC,OAASoZ,EAAIpZ,OAE1B6T,EAAI3R,KAAKsY,QACT1G,EAAIsF,EAGJkP,EAA8B,EAAxBxU,EAAE2E,MAAM3E,EAAE9T,OAAS,GACzBuoB,EAAUrmB,KAAKwa,WAAW4L,GAC9BrlB,EAAQ,GAAKslB,EACC,IAAVtlB,IACF6Q,EAAIA,EAAE4T,MAAMzkB,GACZ4Q,EAAEkT,OAAO9jB,GACTqlB,EAA8B,EAAxBxU,EAAE2E,MAAM3E,EAAE9T,OAAS,IAI3B,IACIyR,EADAiU,EAAI7R,EAAE7T,OAAS8T,EAAE9T,OAGrB,GAAa,QAATqoB,EAAgB,CAClB5W,EAAI,IAAI5B,EAAG,MACX4B,EAAEzR,OAAS0lB,EAAI,EACfjU,EAAEgH,MAAQ,IAAIhU,MAAMgN,EAAEzR,QACtB,IAAK,IAAIF,EAAI,EAAGA,EAAI2R,EAAEzR,OAAQF,IAC5B2R,EAAEgH,MAAM3Y,GAAK,EAIjB,IAAI0oB,EAAO3U,EAAE2G,QAAQ2N,aAAarU,EAAG,EAAG4R,GAClB,IAAlB8C,EAAKhQ,WACP3E,EAAI2U,EACA/W,IACFA,EAAEgH,MAAMiN,GAAK,IAIjB,IAAK,IAAI3L,EAAI2L,EAAI,EAAG3L,GAAK,EAAGA,IAAK,CAC/B,IAAI0O,EAAmC,UAAL,EAAxB5U,EAAE4E,MAAM3E,EAAE9T,OAAS+Z,KACE,EAA5BlG,EAAE4E,MAAM3E,EAAE9T,OAAS+Z,EAAI,IAI1B0O,EAAKhqB,KAAKmV,IAAK6U,EAAKH,EAAO,EAAG,UAE9BzU,EAAEsU,aAAarU,EAAG2U,EAAI1O,GACtB,MAAsB,IAAflG,EAAE2E,SACPiQ,IACA5U,EAAE2E,SAAW,EACb3E,EAAEsU,aAAarU,EAAG,EAAGiG,GAChBlG,EAAEsH,WACLtH,EAAE2E,UAAY,GAGd/G,IACFA,EAAEgH,MAAMsB,GAAK0O,GAajB,OAVIhX,GACFA,EAAEoI,SAEJhG,EAAEgG,SAGW,QAATwO,GAA4B,IAAVplB,GACpB4Q,EAAEsT,OAAOlkB,GAGJ,CACLylB,IAAKjX,GAAK,KACVK,IAAK+B,IAQThE,EAAGvO,UAAUqnB,OAAS,SAAiBvP,EAAKiP,EAAMO,GAGhD,OAFAhR,GAAQwB,EAAI+B,UAERjZ,KAAKiZ,SACA,CACLuN,IAAK,IAAI7Y,EAAG,GACZiC,IAAK,IAAIjC,EAAG,IAKM,IAAlB3N,KAAKsW,UAAmC,IAAjBY,EAAIZ,UAC7B9F,EAAMxQ,KAAKsb,MAAMmL,OAAOvP,EAAKiP,GAEhB,QAATA,IACFK,EAAMhW,EAAIgW,IAAIlL,OAGH,QAAT6K,IACFvW,EAAMY,EAAIZ,IAAI0L,MACVoL,GAA6B,IAAjB9W,EAAI0G,UAClB1G,EAAI0M,KAAKpF,IAIN,CACLsP,IAAKA,EACL5W,IAAKA,IAIa,IAAlB5P,KAAKsW,UAAmC,IAAjBY,EAAIZ,UAC7B9F,EAAMxQ,KAAKymB,OAAOvP,EAAIoE,MAAO6K,GAEhB,QAATA,IACFK,EAAMhW,EAAIgW,IAAIlL,OAGT,CACLkL,IAAKA,EACL5W,IAAKY,EAAIZ,MAI0B,KAAlC5P,KAAKsW,SAAWY,EAAIZ,WACvB9F,EAAMxQ,KAAKsb,MAAMmL,OAAOvP,EAAIoE,MAAO6K,GAEtB,QAATA,IACFvW,EAAMY,EAAIZ,IAAI0L,MACVoL,GAA6B,IAAjB9W,EAAI0G,UAClB1G,EAAI2M,KAAKrF,IAIN,CACLsP,IAAKhW,EAAIgW,IACT5W,IAAKA,IAOLsH,EAAIpZ,OAASkC,KAAKlC,QAAUkC,KAAKqR,IAAI6F,GAAO,EACvC,CACLsP,IAAK,IAAI7Y,EAAG,GACZiC,IAAK5P,MAKU,IAAfkX,EAAIpZ,OACO,QAATqoB,EACK,CACLK,IAAKxmB,KAAK2mB,KAAKzP,EAAIX,MAAM,IACzB3G,IAAK,MAII,QAATuW,EACK,CACLK,IAAK,KACL5W,IAAK,IAAIjC,EAAG3N,KAAKkZ,MAAMhC,EAAIX,MAAM,MAI9B,CACLiQ,IAAKxmB,KAAK2mB,KAAKzP,EAAIX,MAAM,IACzB3G,IAAK,IAAIjC,EAAG3N,KAAKkZ,MAAMhC,EAAIX,MAAM,MAI9BvW,KAAKkmB,SAAShP,EAAKiP,GAlF1B,IAAIK,EAAK5W,EAAKY,GAsFhB7C,EAAGvO,UAAUonB,IAAM,SAActP,GAC/B,OAAOlX,KAAKymB,OAAOvP,EAAK,OAAO,GAAOsP,KAIxC7Y,EAAGvO,UAAUwQ,IAAM,SAAcsH,GAC/B,OAAOlX,KAAKymB,OAAOvP,EAAK,OAAO,GAAOtH,KAGxCjC,EAAGvO,UAAUwnB,KAAO,SAAe1P,GACjC,OAAOlX,KAAKymB,OAAOvP,EAAK,OAAO,GAAMtH,KAIvCjC,EAAGvO,UAAUynB,SAAW,SAAmB3P,GACzC,IAAI4P,EAAK9mB,KAAKymB,OAAOvP,GAGrB,GAAI4P,EAAGlX,IAAIqJ,SAAU,OAAO6N,EAAGN,IAE/B,IAAI5W,EAA0B,IAApBkX,EAAGN,IAAIlQ,SAAiBwQ,EAAGlX,IAAI2M,KAAKrF,GAAO4P,EAAGlX,IAEpDmX,EAAO7P,EAAIwO,MAAM,GACjBsB,EAAK9P,EAAI+P,MAAM,GACf5V,EAAMzB,EAAIyB,IAAI0V,GAGlB,OAAI1V,EAAM,GAAa,IAAP2V,GAAoB,IAAR3V,EAAmByV,EAAGN,IAGvB,IAApBM,EAAGN,IAAIlQ,SAAiBwQ,EAAGN,IAAIX,MAAM,GAAKiB,EAAGN,IAAIxL,MAAM,IAGhErN,EAAGvO,UAAU8Z,MAAQ,SAAgBhC,GACnC,IAAIuN,EAAWvN,EAAM,EACjBuN,IAAUvN,GAAOA,GAErBxB,EAAOwB,GAAO,UAId,IAHA,IAAIzW,GAAK,GAAK,IAAMyW,EAEhBgQ,EAAM,EACDtpB,EAAIoC,KAAKlC,OAAS,EAAGF,GAAK,EAAGA,IACpCspB,GAAOzmB,EAAIymB,GAAuB,EAAhBlnB,KAAKuW,MAAM3Y,KAAWsZ,EAG1C,OAAOuN,GAAYyC,EAAMA,GAI3BvZ,EAAGvO,UAAU+nB,KAAO,SAAejQ,GACjC,OAAOlX,KAAKkZ,MAAMhC,IAIpBvJ,EAAGvO,UAAU+Z,MAAQ,SAAgBjC,GACnC,IAAIuN,EAAWvN,EAAM,EACjBuN,IAAUvN,GAAOA,GAErBxB,EAAOwB,GAAO,UAGd,IADA,IAAI4B,EAAQ,EACHlb,EAAIoC,KAAKlC,OAAS,EAAGF,GAAK,EAAGA,IAAK,CACzC,IAAI0V,GAAqB,EAAhBtT,KAAKuW,MAAM3Y,IAAkB,SAARkb,EAC9B9Y,KAAKuW,MAAM3Y,GAAM0V,EAAI4D,EAAO,EAC5B4B,EAAQxF,EAAI4D,EAId,OADAlX,KAAK2X,SACE8M,EAAWzkB,KAAKob,OAASpb,MAGlC2N,EAAGvO,UAAUunB,KAAO,SAAezP,GACjC,OAAOlX,KAAKsY,QAAQa,MAAMjC,IAG5BvJ,EAAGvO,UAAUgoB,KAAO,SAAe3mB,GACjCiV,EAAsB,IAAfjV,EAAE6V,UACTZ,GAAQjV,EAAEwY,UAEV,IAAI7J,EAAIpP,KACJ+S,EAAItS,EAAE6X,QAGRlJ,EADiB,IAAfA,EAAEkH,SACAlH,EAAEwX,KAAKnmB,GAEP2O,EAAEkJ,QAIR,IAAI+O,EAAI,IAAI1Z,EAAG,GACX2Z,EAAI,IAAI3Z,EAAG,GAGX4Z,EAAI,IAAI5Z,EAAG,GACX6Z,EAAI,IAAI7Z,EAAG,GAEX6B,EAAI,EAER,MAAOJ,EAAEqY,UAAY1U,EAAE0U,SACrBrY,EAAE6V,OAAO,GACTlS,EAAEkS,OAAO,KACPzV,EAGJ,IAAIkY,EAAK3U,EAAEuF,QACPqP,EAAKvY,EAAEkJ,QAEX,OAAQlJ,EAAE6J,SAAU,CAClB,IAAK,IAAIrb,EAAI,EAAGgqB,EAAK,EAAyB,KAArBxY,EAAEmH,MAAM,GAAKqR,IAAahqB,EAAI,KAAMA,EAAGgqB,IAAO,GACvE,GAAIhqB,EAAI,EAAG,CACTwR,EAAE6V,OAAOrnB,GACT,MAAOA,KAAM,GACPypB,EAAEQ,SAAWP,EAAEO,WACjBR,EAAE/K,KAAKoL,GACPJ,EAAE/K,KAAKoL,IAGTN,EAAEpC,OAAO,GACTqC,EAAErC,OAAO,GAIb,IAAK,IAAIpN,EAAI,EAAGiQ,EAAK,EAAyB,KAArB/U,EAAEwD,MAAM,GAAKuR,IAAajQ,EAAI,KAAMA,EAAGiQ,IAAO,GACvE,GAAIjQ,EAAI,EAAG,CACT9E,EAAEkS,OAAOpN,GACT,MAAOA,KAAM,GACP0P,EAAEM,SAAWL,EAAEK,WACjBN,EAAEjL,KAAKoL,GACPF,EAAEjL,KAAKoL,IAGTJ,EAAEtC,OAAO,GACTuC,EAAEvC,OAAO,GAIT7V,EAAEiC,IAAI0B,IAAM,GACd3D,EAAEmN,KAAKxJ,GACPsU,EAAE9K,KAAKgL,GACPD,EAAE/K,KAAKiL,KAEPzU,EAAEwJ,KAAKnN,GACPmY,EAAEhL,KAAK8K,GACPG,EAAEjL,KAAK+K,IAIX,MAAO,CACL3V,EAAG4V,EACH3V,EAAG4V,EACHO,IAAKhV,EAAE8R,OAAOrV,KAOlB7B,EAAGvO,UAAU4oB,OAAS,SAAiBvnB,GACrCiV,EAAsB,IAAfjV,EAAE6V,UACTZ,GAAQjV,EAAEwY,UAEV,IAAItH,EAAI3R,KACJ4R,EAAInR,EAAE6X,QAGR3G,EADiB,IAAfA,EAAE2E,SACA3E,EAAEiV,KAAKnmB,GAEPkR,EAAE2G,QAGR,IAuCI9H,EAvCAyX,EAAK,IAAIta,EAAG,GACZua,EAAK,IAAIva,EAAG,GAEZwa,EAAQvW,EAAE0G,QAEd,MAAO3G,EAAEtB,KAAK,GAAK,GAAKuB,EAAEvB,KAAK,GAAK,EAAG,CACrC,IAAK,IAAIzS,EAAI,EAAGgqB,EAAK,EAAyB,KAArBjW,EAAE4E,MAAM,GAAKqR,IAAahqB,EAAI,KAAMA,EAAGgqB,IAAO,GACvE,GAAIhqB,EAAI,EAAG,CACT+T,EAAEsT,OAAOrnB,GACT,MAAOA,KAAM,EACPqqB,EAAGJ,SACLI,EAAG3L,KAAK6L,GAGVF,EAAGhD,OAAO,GAId,IAAK,IAAIpN,EAAI,EAAGiQ,EAAK,EAAyB,KAArBlW,EAAE2E,MAAM,GAAKuR,IAAajQ,EAAI,KAAMA,EAAGiQ,IAAO,GACvE,GAAIjQ,EAAI,EAAG,CACTjG,EAAEqT,OAAOpN,GACT,MAAOA,KAAM,EACPqQ,EAAGL,SACLK,EAAG5L,KAAK6L,GAGVD,EAAGjD,OAAO,GAIVtT,EAAEN,IAAIO,IAAM,GACdD,EAAE4K,KAAK3K,GACPqW,EAAG1L,KAAK2L,KAERtW,EAAE2K,KAAK5K,GACPuW,EAAG3L,KAAK0L,IAeZ,OATEzX,EADgB,IAAdmB,EAAEtB,KAAK,GACH4X,EAEAC,EAGJ1X,EAAIH,KAAK,GAAK,GAChBG,EAAI8L,KAAK7b,GAGJ+P,GAGT7C,EAAGvO,UAAU2oB,IAAM,SAAc7Q,GAC/B,GAAIlX,KAAKiZ,SAAU,OAAO/B,EAAI4D,MAC9B,GAAI5D,EAAI+B,SAAU,OAAOjZ,KAAK8a,MAE9B,IAAInJ,EAAI3R,KAAKsY,QACT1G,EAAIsF,EAAIoB,QACZ3G,EAAE2E,SAAW,EACb1E,EAAE0E,SAAW,EAGb,IAAK,IAAIvV,EAAQ,EAAG4Q,EAAE8V,UAAY7V,EAAE6V,SAAU1mB,IAC5C4Q,EAAEsT,OAAO,GACTrT,EAAEqT,OAAO,GAGX,EAAG,CACD,MAAOtT,EAAE8V,SACP9V,EAAEsT,OAAO,GAEX,MAAOrT,EAAE6V,SACP7V,EAAEqT,OAAO,GAGX,IAAIxV,EAAIkC,EAAEN,IAAIO,GACd,GAAInC,EAAI,EAAG,CAET,IAAI2B,EAAIO,EACRA,EAAIC,EACJA,EAAIR,OACC,GAAU,IAAN3B,GAAyB,IAAdmC,EAAEvB,KAAK,GAC3B,MAGFsB,EAAE4K,KAAK3K,SACA,GAET,OAAOA,EAAEiT,OAAO9jB,IAIlB4M,EAAGvO,UAAU6Q,KAAO,SAAeiH,GACjC,OAAOlX,KAAKonB,KAAKlQ,GAAKvF,EAAEiV,KAAK1P,IAG/BvJ,EAAGvO,UAAUqoB,OAAS,WACpB,OAA+B,KAAP,EAAhBznB,KAAKuW,MAAM,KAGrB5I,EAAGvO,UAAUyoB,MAAQ,WACnB,OAA+B,KAAP,EAAhB7nB,KAAKuW,MAAM,KAIrB5I,EAAGvO,UAAU6nB,MAAQ,SAAgB/P,GACnC,OAAOlX,KAAKuW,MAAM,GAAKW,GAIzBvJ,EAAGvO,UAAUgpB,MAAQ,SAAgBzO,GACnCjE,EAAsB,kBAARiE,GACd,IAAIlK,EAAIkK,EAAM,GACVnZ,GAAKmZ,EAAMlK,GAAK,GAChBF,EAAI,GAAKE,EAGb,GAAIzP,KAAKlC,QAAU0C,EAGjB,OAFAR,KAAKuY,QAAQ/X,EAAI,GACjBR,KAAKuW,MAAM/V,IAAM+O,EACVvP,KAKT,IADA,IAAI8Y,EAAQvJ,EACH3R,EAAI4C,EAAa,IAAVsY,GAAelb,EAAIoC,KAAKlC,OAAQF,IAAK,CACnD,IAAI0V,EAAoB,EAAhBtT,KAAKuW,MAAM3Y,GACnB0V,GAAKwF,EACLA,EAAQxF,IAAM,GACdA,GAAK,SACLtT,KAAKuW,MAAM3Y,GAAK0V,EAMlB,OAJc,IAAVwF,IACF9Y,KAAKuW,MAAM3Y,GAAKkb,EAChB9Y,KAAKlC,UAEAkC,MAGT2N,EAAGvO,UAAU6Z,OAAS,WACpB,OAAuB,IAAhBjZ,KAAKlC,QAAkC,IAAlBkC,KAAKuW,MAAM,IAGzC5I,EAAGvO,UAAUiR,KAAO,SAAe6G,GACjC,IAOI1G,EAPA8F,EAAWY,EAAM,EAErB,GAAsB,IAAlBlX,KAAKsW,WAAmBA,EAAU,OAAQ,EAC9C,GAAsB,IAAlBtW,KAAKsW,UAAkBA,EAAU,OAAO,EAK5C,GAHAtW,KAAK2X,SAGD3X,KAAKlC,OAAS,EAChB0S,EAAM,MACD,CACD8F,IACFY,GAAOA,GAGTxB,EAAOwB,GAAO,SAAW,qBAEzB,IAAI5D,EAAoB,EAAhBtT,KAAKuW,MAAM,GACnB/F,EAAM8C,IAAM4D,EAAM,EAAI5D,EAAI4D,GAAO,EAAI,EAEvC,OAAsB,IAAlBlX,KAAKsW,SAA8B,GAAN9F,EAC1BA,GAOT7C,EAAGvO,UAAUiS,IAAM,SAAc6F,GAC/B,GAAsB,IAAlBlX,KAAKsW,UAAmC,IAAjBY,EAAIZ,SAAgB,OAAQ,EACvD,GAAsB,IAAlBtW,KAAKsW,UAAmC,IAAjBY,EAAIZ,SAAgB,OAAO,EAEtD,IAAI9F,EAAMxQ,KAAKqoB,KAAKnR,GACpB,OAAsB,IAAlBlX,KAAKsW,SAA8B,GAAN9F,EAC1BA,GAIT7C,EAAGvO,UAAUipB,KAAO,SAAenR,GAEjC,GAAIlX,KAAKlC,OAASoZ,EAAIpZ,OAAQ,OAAO,EACrC,GAAIkC,KAAKlC,OAASoZ,EAAIpZ,OAAQ,OAAQ,EAGtC,IADA,IAAI0S,EAAM,EACD5S,EAAIoC,KAAKlC,OAAS,EAAGF,GAAK,EAAGA,IAAK,CACzC,IAAI+T,EAAoB,EAAhB3R,KAAKuW,MAAM3Y,GACfgU,EAAmB,EAAfsF,EAAIX,MAAM3Y,GAElB,GAAI+T,IAAMC,EAAV,CACID,EAAIC,EACNpB,GAAO,EACEmB,EAAIC,IACbpB,EAAM,GAER,OAEF,OAAOA,GAGT7C,EAAGvO,UAAUkpB,IAAM,SAAcpR,GAC/B,OAA0B,IAAnBlX,KAAKqQ,KAAK6G,IAGnBvJ,EAAGvO,UAAUmpB,GAAK,SAAarR,GAC7B,OAAyB,IAAlBlX,KAAKqR,IAAI6F,IAGlBvJ,EAAGvO,UAAUopB,KAAO,SAAetR,GACjC,OAAOlX,KAAKqQ,KAAK6G,IAAQ,GAG3BvJ,EAAGvO,UAAUqpB,IAAM,SAAcvR,GAC/B,OAAOlX,KAAKqR,IAAI6F,IAAQ,GAG1BvJ,EAAGvO,UAAUspB,IAAM,SAAcxR,GAC/B,OAA2B,IAApBlX,KAAKqQ,KAAK6G,IAGnBvJ,EAAGvO,UAAUupB,GAAK,SAAazR,GAC7B,OAA0B,IAAnBlX,KAAKqR,IAAI6F,IAGlBvJ,EAAGvO,UAAUwpB,KAAO,SAAe1R,GACjC,OAAOlX,KAAKqQ,KAAK6G,IAAQ,GAG3BvJ,EAAGvO,UAAUypB,IAAM,SAAc3R,GAC/B,OAAOlX,KAAKqR,IAAI6F,IAAQ,GAG1BvJ,EAAGvO,UAAU0pB,IAAM,SAAc5R,GAC/B,OAA0B,IAAnBlX,KAAKqQ,KAAK6G,IAGnBvJ,EAAGvO,UAAU2pB,GAAK,SAAa7R,GAC7B,OAAyB,IAAlBlX,KAAKqR,IAAI6F,IAOlBvJ,EAAG+E,IAAM,SAAcwE,GACrB,OAAO,IAAI8R,EAAI9R,IAGjBvJ,EAAGvO,UAAUkS,MAAQ,SAAgB2X,GAGnC,OAFAvT,GAAQ1V,KAAK0S,IAAK,yCAClBgD,EAAyB,IAAlB1V,KAAKsW,SAAgB,iCACrB2S,EAAIC,UAAUlpB,MAAMmpB,UAAUF,IAGvCtb,EAAGvO,UAAUqS,QAAU,WAErB,OADAiE,EAAO1V,KAAK0S,IAAK,wDACV1S,KAAK0S,IAAI0W,YAAYppB,OAG9B2N,EAAGvO,UAAU+pB,UAAY,SAAoBF,GAE3C,OADAjpB,KAAK0S,IAAMuW,EACJjpB,MAGT2N,EAAGvO,UAAUiqB,SAAW,SAAmBJ,GAEzC,OADAvT,GAAQ1V,KAAK0S,IAAK,yCACX1S,KAAKmpB,UAAUF,IAGxBtb,EAAGvO,UAAUkqB,OAAS,SAAiBpS,GAErC,OADAxB,EAAO1V,KAAK0S,IAAK,sCACV1S,KAAK0S,IAAIvC,IAAInQ,KAAMkX,IAG5BvJ,EAAGvO,UAAUmqB,QAAU,SAAkBrS,GAEvC,OADAxB,EAAO1V,KAAK0S,IAAK,uCACV1S,KAAK0S,IAAI4J,KAAKtc,KAAMkX,IAG7BvJ,EAAGvO,UAAUoqB,OAAS,SAAiBtS,GAErC,OADAxB,EAAO1V,KAAK0S,IAAK,sCACV1S,KAAK0S,IAAI8J,IAAIxc,KAAMkX,IAG5BvJ,EAAGvO,UAAUqqB,QAAU,SAAkBvS,GAEvC,OADAxB,EAAO1V,KAAK0S,IAAK,uCACV1S,KAAK0S,IAAI6J,KAAKvc,KAAMkX,IAG7BvJ,EAAGvO,UAAUsqB,OAAS,SAAiBxS,GAErC,OADAxB,EAAO1V,KAAK0S,IAAK,sCACV1S,KAAK0S,IAAIiX,IAAI3pB,KAAMkX,IAG5BvJ,EAAGvO,UAAUwqB,OAAS,SAAiB1S,GAGrC,OAFAxB,EAAO1V,KAAK0S,IAAK,sCACjB1S,KAAK0S,IAAImX,SAAS7pB,KAAMkX,GACjBlX,KAAK0S,IAAItC,IAAIpQ,KAAMkX,IAG5BvJ,EAAGvO,UAAU0qB,QAAU,SAAkB5S,GAGvC,OAFAxB,EAAO1V,KAAK0S,IAAK,sCACjB1S,KAAK0S,IAAImX,SAAS7pB,KAAMkX,GACjBlX,KAAK0S,IAAIxC,KAAKlQ,KAAMkX,IAG7BvJ,EAAGvO,UAAU2qB,OAAS,WAGpB,OAFArU,EAAO1V,KAAK0S,IAAK,sCACjB1S,KAAK0S,IAAIsX,SAAShqB,MACXA,KAAK0S,IAAIiS,IAAI3kB,OAGtB2N,EAAGvO,UAAU6qB,QAAU,WAGrB,OAFAvU,EAAO1V,KAAK0S,IAAK,uCACjB1S,KAAK0S,IAAIsX,SAAShqB,MACXA,KAAK0S,IAAIkS,KAAK5kB,OAIvB2N,EAAGvO,UAAU8qB,QAAU,WAGrB,OAFAxU,EAAO1V,KAAK0S,IAAK,uCACjB1S,KAAK0S,IAAIsX,SAAShqB,MACXA,KAAK0S,IAAIyX,KAAKnqB,OAGvB2N,EAAGvO,UAAUgrB,QAAU,WAGrB,OAFA1U,EAAO1V,KAAK0S,IAAK,uCACjB1S,KAAK0S,IAAIsX,SAAShqB,MACXA,KAAK0S,IAAIzC,KAAKjQ,OAIvB2N,EAAGvO,UAAUirB,OAAS,WAGpB,OAFA3U,EAAO1V,KAAK0S,IAAK,sCACjB1S,KAAK0S,IAAIsX,SAAShqB,MACXA,KAAK0S,IAAI4I,IAAItb,OAGtB2N,EAAGvO,UAAUoS,OAAS,SAAiB0F,GAGrC,OAFAxB,EAAO1V,KAAK0S,MAAQwE,EAAIxE,IAAK,qBAC7B1S,KAAK0S,IAAIsX,SAAShqB,MACXA,KAAK0S,IAAI0F,IAAIpY,KAAMkX,IAI5B,IAAIoT,EAAS,CACXC,KAAM,KACNC,KAAM,KACNC,KAAM,KACNC,OAAQ,MAIV,SAASC,EAAQluB,EAAMgE,GAErBT,KAAKvD,KAAOA,EACZuD,KAAKS,EAAI,IAAIkN,EAAGlN,EAAG,IACnBT,KAAKU,EAAIV,KAAKS,EAAEyQ,YAChBlR,KAAKmP,EAAI,IAAIxB,EAAG,GAAGkX,OAAO7kB,KAAKU,GAAG6b,KAAKvc,KAAKS,GAE5CT,KAAK4qB,IAAM5qB,KAAK6qB,OA2ClB,SAASC,IACPH,EAAO7qB,KACLE,KACA,OACA,2EA+DJ,SAAS+qB,IACPJ,EAAO7qB,KACLE,KACA,OACA,kEAIJ,SAASgrB,IACPL,EAAO7qB,KACLE,KACA,OACA,yDAIJ,SAASirB,IAEPN,EAAO7qB,KACLE,KACA,QACA,uEA8CJ,SAASgpB,EAAKxF,GACZ,GAAiB,kBAANA,EAAgB,CACzB,IAAI0H,EAAQvd,EAAGwd,OAAO3H,GACtBxjB,KAAKwjB,EAAI0H,EAAMzqB,EACfT,KAAKkrB,MAAQA,OAEbxV,EAAO8N,EAAE8E,IAAI,GAAI,kCACjBtoB,KAAKwjB,EAAIA,EACTxjB,KAAKkrB,MAAQ,KAoOjB,SAASE,EAAM5H,GACbwF,EAAIlpB,KAAKE,KAAMwjB,GAEfxjB,KAAKe,MAAQf,KAAKwjB,EAAEtS,YAChBlR,KAAKe,MAAQ,KAAO,IACtBf,KAAKe,OAAS,GAAMf,KAAKe,MAAQ,IAGnCf,KAAKyP,EAAI,IAAI9B,EAAG,GAAGkX,OAAO7kB,KAAKe,OAC/Bf,KAAKgnB,GAAKhnB,KAAKqrB,KAAKrrB,KAAKyP,EAAEkV,OAC3B3kB,KAAKsrB,KAAOtrB,KAAKyP,EAAEuY,OAAOhoB,KAAKwjB,GAE/BxjB,KAAKurB,KAAOvrB,KAAKsrB,KAAKlb,IAAIpQ,KAAKyP,GAAGoW,MAAM,GAAGW,IAAIxmB,KAAKwjB,GACpDxjB,KAAKurB,KAAOvrB,KAAKurB,KAAK3E,KAAK5mB,KAAKyP,GAChCzP,KAAKurB,KAAOvrB,KAAKyP,EAAE+M,IAAIxc,KAAKurB,MAxa9BZ,EAAOvrB,UAAUyrB,KAAO,WACtB,IAAID,EAAM,IAAIjd,EAAG,MAEjB,OADAid,EAAIrU,MAAQ,IAAIhU,MAAMhG,KAAKqb,KAAK5X,KAAKU,EAAI,KAClCkqB,GAGTD,EAAOvrB,UAAUosB,QAAU,SAAkBtU,GAG3C,IACIuU,EADAhc,EAAIyH,EAGR,GACElX,KAAK0rB,MAAMjc,EAAGzP,KAAK4qB,KACnBnb,EAAIzP,KAAK2rB,MAAMlc,GACfA,EAAIA,EAAE6M,KAAKtc,KAAK4qB,KAChBa,EAAOhc,EAAEyB,kBACFua,EAAOzrB,KAAKU,GAErB,IAAI2Q,EAAMoa,EAAOzrB,KAAKU,GAAK,EAAI+O,EAAE4Y,KAAKroB,KAAKS,GAU3C,OATY,IAAR4Q,GACF5B,EAAE8G,MAAM,GAAK,EACb9G,EAAE3R,OAAS,GACFuT,EAAM,EACf5B,EAAE8M,KAAKvc,KAAKS,GAEZgP,EAAEkI,SAGGlI,GAGTkb,EAAOvrB,UAAUssB,MAAQ,SAAgBE,EAAO3hB,GAC9C2hB,EAAM3G,OAAOjlB,KAAKU,EAAG,EAAGuJ,IAG1B0gB,EAAOvrB,UAAUusB,MAAQ,SAAgBzU,GACvC,OAAOA,EAAIhH,KAAKlQ,KAAKmP,IASvB0F,EAASiW,EAAMH,GAEfG,EAAK1rB,UAAUssB,MAAQ,SAAgBE,EAAOC,GAK5C,IAHA,IAAIxG,EAAO,QAEPyG,EAASvvB,KAAKmV,IAAIka,EAAM9tB,OAAQ,GAC3BF,EAAI,EAAGA,EAAIkuB,EAAQluB,IAC1BiuB,EAAOtV,MAAM3Y,GAAKguB,EAAMrV,MAAM3Y,GAIhC,GAFAiuB,EAAO/tB,OAASguB,EAEZF,EAAM9tB,QAAU,EAGlB,OAFA8tB,EAAMrV,MAAM,GAAK,OACjBqV,EAAM9tB,OAAS,GAKjB,IAAIiuB,EAAOH,EAAMrV,MAAM,GAGvB,IAFAsV,EAAOtV,MAAMsV,EAAO/tB,UAAYiuB,EAAO1G,EAElCznB,EAAI,GAAIA,EAAIguB,EAAM9tB,OAAQF,IAAK,CAClC,IAAI0C,EAAwB,EAAjBsrB,EAAMrV,MAAM3Y,GACvBguB,EAAMrV,MAAM3Y,EAAI,KAAQ0C,EAAO+kB,IAAS,EAAM0G,IAAS,GACvDA,EAAOzrB,EAETyrB,KAAU,GACVH,EAAMrV,MAAM3Y,EAAI,IAAMmuB,EACT,IAATA,GAAcH,EAAM9tB,OAAS,GAC/B8tB,EAAM9tB,QAAU,GAEhB8tB,EAAM9tB,QAAU,GAIpBgtB,EAAK1rB,UAAUusB,MAAQ,SAAgBzU,GAErCA,EAAIX,MAAMW,EAAIpZ,QAAU,EACxBoZ,EAAIX,MAAMW,EAAIpZ,OAAS,GAAK,EAC5BoZ,EAAIpZ,QAAU,EAId,IADA,IAAIgc,EAAK,EACAlc,EAAI,EAAGA,EAAIsZ,EAAIpZ,OAAQF,IAAK,CACnC,IAAI0V,EAAmB,EAAf4D,EAAIX,MAAM3Y,GAClBkc,GAAU,IAAJxG,EACN4D,EAAIX,MAAM3Y,GAAU,SAALkc,EACfA,EAAS,GAAJxG,GAAawG,EAAK,SAAa,GAUtC,OANkC,IAA9B5C,EAAIX,MAAMW,EAAIpZ,OAAS,KACzBoZ,EAAIpZ,SAC8B,IAA9BoZ,EAAIX,MAAMW,EAAIpZ,OAAS,IACzBoZ,EAAIpZ,UAGDoZ,GASTrC,EAASkW,EAAMJ,GAQf9V,EAASmW,EAAML,GASf9V,EAASoW,EAAQN,GAEjBM,EAAO7rB,UAAUusB,MAAQ,SAAgBzU,GAGvC,IADA,IAAI4B,EAAQ,EACHlb,EAAI,EAAGA,EAAIsZ,EAAIpZ,OAAQF,IAAK,CACnC,IAAI8c,EAA0B,IAAL,EAAfxD,EAAIX,MAAM3Y,IAAiBkb,EACjCgB,EAAU,SAALY,EACTA,KAAQ,GAERxD,EAAIX,MAAM3Y,GAAKkc,EACfhB,EAAQ4B,EAKV,OAHc,IAAV5B,IACF5B,EAAIX,MAAMW,EAAIpZ,UAAYgb,GAErB5B,GAITvJ,EAAGwd,OAAS,SAAgB1uB,GAE1B,GAAI6tB,EAAO7tB,GAAO,OAAO6tB,EAAO7tB,GAEhC,IAAIyuB,EACJ,GAAa,SAATzuB,EACFyuB,EAAQ,IAAIJ,OACP,GAAa,SAATruB,EACTyuB,EAAQ,IAAIH,OACP,GAAa,SAATtuB,EACTyuB,EAAQ,IAAIF,MACP,IAAa,WAATvuB,EAGT,MAAM,IAAI4R,MAAM,iBAAmB5R,GAFnCyuB,EAAQ,IAAID,EAMd,OAFAX,EAAO7tB,GAAQyuB,EAERA,GAkBTlC,EAAI5pB,UAAU4qB,SAAW,SAAmBrY,GAC1C+D,EAAsB,IAAf/D,EAAE2E,SAAgB,iCACzBZ,EAAO/D,EAAEe,IAAK,oCAGhBsW,EAAI5pB,UAAUyqB,SAAW,SAAmBlY,EAAGC,GAC7C8D,EAAqC,KAA7B/D,EAAE2E,SAAW1E,EAAE0E,UAAiB,iCACxCZ,EAAO/D,EAAEe,KAAOf,EAAEe,MAAQd,EAAEc,IAC1B,oCAGJsW,EAAI5pB,UAAUisB,KAAO,SAAe1Z,GAClC,OAAI3R,KAAKkrB,MAAclrB,KAAKkrB,MAAMM,QAAQ7Z,GAAGwX,UAAUnpB,OAEvDgX,EAAKrF,EAAGA,EAAEiV,KAAK5mB,KAAKwjB,GAAG2F,UAAUnpB,OAC1B2R,IAGTqX,EAAI5pB,UAAUkc,IAAM,SAAc3J,GAChC,OAAIA,EAAEsH,SACGtH,EAAE2G,QAGJtY,KAAKwjB,EAAEhH,IAAI7K,GAAGwX,UAAUnpB,OAGjCgpB,EAAI5pB,UAAU+Q,IAAM,SAAcwB,EAAGC,GACnC5R,KAAK6pB,SAASlY,EAAGC,GAEjB,IAAIpB,EAAMmB,EAAExB,IAAIyB,GAIhB,OAHIpB,EAAIa,IAAIrR,KAAKwjB,IAAM,GACrBhT,EAAI+L,KAAKvc,KAAKwjB,GAEThT,EAAI2Y,UAAUnpB,OAGvBgpB,EAAI5pB,UAAUkd,KAAO,SAAe3K,EAAGC,GACrC5R,KAAK6pB,SAASlY,EAAGC,GAEjB,IAAIpB,EAAMmB,EAAE2K,KAAK1K,GAIjB,OAHIpB,EAAIa,IAAIrR,KAAKwjB,IAAM,GACrBhT,EAAI+L,KAAKvc,KAAKwjB,GAEThT,GAGTwY,EAAI5pB,UAAUod,IAAM,SAAc7K,EAAGC,GACnC5R,KAAK6pB,SAASlY,EAAGC,GAEjB,IAAIpB,EAAMmB,EAAE6K,IAAI5K,GAIhB,OAHIpB,EAAIH,KAAK,GAAK,GAChBG,EAAI8L,KAAKtc,KAAKwjB,GAEThT,EAAI2Y,UAAUnpB,OAGvBgpB,EAAI5pB,UAAUmd,KAAO,SAAe5K,EAAGC,GACrC5R,KAAK6pB,SAASlY,EAAGC,GAEjB,IAAIpB,EAAMmB,EAAE4K,KAAK3K,GAIjB,OAHIpB,EAAIH,KAAK,GAAK,GAChBG,EAAI8L,KAAKtc,KAAKwjB,GAEThT,GAGTwY,EAAI5pB,UAAUuqB,IAAM,SAAchY,EAAGuF,GAEnC,OADAlX,KAAKgqB,SAASrY,GACP3R,KAAKqrB,KAAK1Z,EAAE6T,MAAMtO,KAG3B8R,EAAI5pB,UAAU8Q,KAAO,SAAeyB,EAAGC,GAErC,OADA5R,KAAK6pB,SAASlY,EAAGC,GACV5R,KAAKqrB,KAAK1Z,EAAEzB,KAAK0B,KAG1BoX,EAAI5pB,UAAUgR,IAAM,SAAcuB,EAAGC,GAEnC,OADA5R,KAAK6pB,SAASlY,EAAGC,GACV5R,KAAKqrB,KAAK1Z,EAAEvB,IAAIwB,KAGzBoX,EAAI5pB,UAAUwlB,KAAO,SAAejT,GAClC,OAAO3R,KAAKkQ,KAAKyB,EAAGA,EAAE2G,UAGxB0Q,EAAI5pB,UAAUulB,IAAM,SAAchT,GAChC,OAAO3R,KAAKoQ,IAAIuB,EAAGA,IAGrBqX,EAAI5pB,UAAU+qB,KAAO,SAAexY,GAClC,GAAIA,EAAEsH,SAAU,OAAOtH,EAAE2G,QAEzB,IAAI0T,EAAOhsB,KAAKwjB,EAAEyD,MAAM,GAIxB,GAHAvR,EAAOsW,EAAO,IAAM,GAGP,IAATA,EAAY,CACd,IAAI5T,EAAMpY,KAAKwjB,EAAErT,IAAI,IAAIxC,EAAG,IAAIsX,OAAO,GACvC,OAAOjlB,KAAKoY,IAAIzG,EAAGyG,GAMrB,IAAI7I,EAAIvP,KAAKwjB,EAAEuC,KAAK,GAChBvlB,EAAI,EACR,OAAQ+O,EAAE0J,UAA2B,IAAf1J,EAAE0X,MAAM,GAC5BzmB,IACA+O,EAAE0V,OAAO,GAEXvP,GAAQnG,EAAE0J,UAEV,IAAIgT,EAAM,IAAIte,EAAG,GAAG2D,MAAMtR,MACtBksB,EAAOD,EAAI5B,SAIX8B,EAAOnsB,KAAKwjB,EAAEuC,KAAK,GAAGd,OAAO,GAC7BpO,EAAI7W,KAAKwjB,EAAEtS,YACf2F,EAAI,IAAIlJ,EAAG,EAAIkJ,EAAIA,GAAGvF,MAAMtR,MAE5B,MAAuC,IAAhCA,KAAKoY,IAAIvB,EAAGsV,GAAM9a,IAAI6a,GAC3BrV,EAAE0S,QAAQ2C,GAGZ,IAAIhrB,EAAIlB,KAAKoY,IAAIvB,EAAGtH,GAChBE,EAAIzP,KAAKoY,IAAIzG,EAAGpC,EAAEuW,KAAK,GAAGb,OAAO,IACjC7T,EAAIpR,KAAKoY,IAAIzG,EAAGpC,GAChBiU,EAAIhjB,EACR,MAAsB,IAAf4Q,EAAEC,IAAI4a,GAAY,CAEvB,IADA,IAAIrB,EAAMxZ,EACDxT,EAAI,EAAoB,IAAjBgtB,EAAIvZ,IAAI4a,GAAYruB,IAClCgtB,EAAMA,EAAIb,SAEZrU,EAAO9X,EAAI4lB,GACX,IAAI5R,EAAI5R,KAAKoY,IAAIlX,EAAG,IAAIyM,EAAG,GAAGkX,OAAOrB,EAAI5lB,EAAI,IAE7C6R,EAAIA,EAAEma,OAAOhY,GACb1Q,EAAI0Q,EAAEmY,SACN3Y,EAAIA,EAAEwY,OAAO1oB,GACbsiB,EAAI5lB,EAGN,OAAO6R,GAGTuZ,EAAI5pB,UAAU6Q,KAAO,SAAe0B,GAClC,IAAIya,EAAMza,EAAEqW,OAAOhoB,KAAKwjB,GACxB,OAAqB,IAAjB4I,EAAI9V,UACN8V,EAAI9V,SAAW,EACRtW,KAAKqrB,KAAKe,GAAK/B,UAEfrqB,KAAKqrB,KAAKe,IAIrBpD,EAAI5pB,UAAUgZ,IAAM,SAAczG,EAAGuF,GACnC,GAAIA,EAAI+B,SAAU,OAAO,IAAItL,EAAG,GAAG2D,MAAMtR,MACzC,GAAoB,IAAhBkX,EAAI7G,KAAK,GAAU,OAAOsB,EAAE2G,QAEhC,IAAI+T,EAAa,EACbC,EAAM,IAAI/pB,MAAM,GAAK8pB,GACzBC,EAAI,GAAK,IAAI3e,EAAG,GAAG2D,MAAMtR,MACzBssB,EAAI,GAAK3a,EACT,IAAK,IAAI/T,EAAI,EAAGA,EAAI0uB,EAAIxuB,OAAQF,IAC9B0uB,EAAI1uB,GAAKoC,KAAKoQ,IAAIkc,EAAI1uB,EAAI,GAAI+T,GAGhC,IAAInB,EAAM8b,EAAI,GACVtiB,EAAU,EACVuiB,EAAa,EACb3V,EAAQM,EAAIhG,YAAc,GAK9B,IAJc,IAAV0F,IACFA,EAAQ,IAGLhZ,EAAIsZ,EAAIpZ,OAAS,EAAGF,GAAK,EAAGA,IAAK,CAEpC,IADA,IAAIqa,EAAOf,EAAIX,MAAM3Y,GACZia,EAAIjB,EAAQ,EAAGiB,GAAK,EAAGA,IAAK,CACnC,IAAI8B,EAAO1B,GAAQJ,EAAK,EACpBrH,IAAQ8b,EAAI,KACd9b,EAAMxQ,KAAK2kB,IAAInU,IAGL,IAARmJ,GAAyB,IAAZ3P,GAKjBA,IAAY,EACZA,GAAW2P,EACX4S,KACIA,IAAeF,GAAqB,IAANzuB,GAAiB,IAANia,KAE7CrH,EAAMxQ,KAAKoQ,IAAII,EAAK8b,EAAItiB,IACxBuiB,EAAa,EACbviB,EAAU,IAXRuiB,EAAa,EAajB3V,EAAQ,GAGV,OAAOpG,GAGTwY,EAAI5pB,UAAU8pB,UAAY,SAAoBhS,GAC5C,IAAIzH,EAAIyH,EAAI0P,KAAK5mB,KAAKwjB,GAEtB,OAAO/T,IAAMyH,EAAMzH,EAAE6I,QAAU7I,GAGjCuZ,EAAI5pB,UAAUgqB,YAAc,SAAsBlS,GAChD,IAAI1G,EAAM0G,EAAIoB,QAEd,OADA9H,EAAIkC,IAAM,KACHlC,GAOT7C,EAAG4D,KAAO,SAAe2F,GACvB,OAAO,IAAIkU,EAAKlU,IAmBlBrC,EAASuW,EAAMpC,GAEfoC,EAAKhsB,UAAU8pB,UAAY,SAAoBhS,GAC7C,OAAOlX,KAAKqrB,KAAKnU,EAAIsO,MAAMxlB,KAAKe,SAGlCqqB,EAAKhsB,UAAUgqB,YAAc,SAAsBlS,GACjD,IAAIzH,EAAIzP,KAAKqrB,KAAKnU,EAAI9G,IAAIpQ,KAAKsrB,OAE/B,OADA7b,EAAEiD,IAAM,KACDjD,GAGT2b,EAAKhsB,UAAU8Q,KAAO,SAAeyB,EAAGC,GACtC,GAAID,EAAEsH,UAAYrH,EAAEqH,SAGlB,OAFAtH,EAAE4E,MAAM,GAAK,EACb5E,EAAE7T,OAAS,EACJ6T,EAGT,IAAIP,EAAIO,EAAEzB,KAAK0B,GACX1Q,EAAIkQ,EAAEwU,MAAM5lB,KAAKe,OAAOqP,IAAIpQ,KAAKurB,MAAM5F,OAAO3lB,KAAKe,OAAOqP,IAAIpQ,KAAKwjB,GACnEgJ,EAAIpb,EAAEmL,KAAKrb,GAAG+jB,OAAOjlB,KAAKe,OAC1ByP,EAAMgc,EAQV,OANIA,EAAEnb,IAAIrR,KAAKwjB,IAAM,EACnBhT,EAAMgc,EAAEjQ,KAAKvc,KAAKwjB,GACTgJ,EAAEnc,KAAK,GAAK,IACrBG,EAAMgc,EAAElQ,KAAKtc,KAAKwjB,IAGbhT,EAAI2Y,UAAUnpB,OAGvBorB,EAAKhsB,UAAUgR,IAAM,SAAcuB,EAAGC,GACpC,GAAID,EAAEsH,UAAYrH,EAAEqH,SAAU,OAAO,IAAItL,EAAG,GAAGwb,UAAUnpB,MAEzD,IAAIoR,EAAIO,EAAEvB,IAAIwB,GACV1Q,EAAIkQ,EAAEwU,MAAM5lB,KAAKe,OAAOqP,IAAIpQ,KAAKurB,MAAM5F,OAAO3lB,KAAKe,OAAOqP,IAAIpQ,KAAKwjB,GACnEgJ,EAAIpb,EAAEmL,KAAKrb,GAAG+jB,OAAOjlB,KAAKe,OAC1ByP,EAAMgc,EAOV,OANIA,EAAEnb,IAAIrR,KAAKwjB,IAAM,EACnBhT,EAAMgc,EAAEjQ,KAAKvc,KAAKwjB,GACTgJ,EAAEnc,KAAK,GAAK,IACrBG,EAAMgc,EAAElQ,KAAKtc,KAAKwjB,IAGbhT,EAAI2Y,UAAUnpB,OAGvBorB,EAAKhsB,UAAU6Q,KAAO,SAAe0B,GAEnC,IAAInB,EAAMxQ,KAAKqrB,KAAK1Z,EAAEqW,OAAOhoB,KAAKwjB,GAAGpT,IAAIpQ,KAAKgnB,KAC9C,OAAOxW,EAAI2Y,UAAUnpB,QAv8GzB,CAy8GoCrD,EAAQqD,Q,+PCz8G5C,cAyBA,IAAI4B,EAHJjF,EAAOC,QAAU8E,EAMjBA,EAAS+qB,cAAgBA,EAGhB,EAAQ,QAAUC,aAA3B,IAEIC,EAAkB,SAAyBC,EAASre,GACtD,OAAOqe,EAAQC,UAAUte,GAAMzQ,QAO7B2D,EAAS,EAAQ,QAIjBnC,EAAS,EAAQ,QAAUA,OAE3BmF,EAAgBC,EAAOC,YAAc,aAEzC,SAASC,EAAoBC,GAC3B,OAAOvF,EAAOwF,KAAKD,GAGrB,SAASE,EAAczG,GACrB,OAAOgB,EAAO0F,SAAS1G,IAAQA,aAAemG,EAKhD,IAEIqoB,EAFAC,EAAY,EAAQ,GAKtBD,EADEC,GAAaA,EAAUC,SACjBD,EAAUC,SAAS,UAEnB,aAKV,IAcIC,EACArgB,EACA9H,EAhBA/E,EAAa,EAAQ,QAErBmF,EAAc,EAAQ,QAEtB7F,EAAW,EAAQ,QACnBlD,EAAmBkD,EAASlD,iBAE5BgJ,EAAiB,EAAQ,QAAatJ,MACtCuJ,EAAuBD,EAAeC,qBACtC8nB,EAA4B/nB,EAAe+nB,0BAC3C7nB,EAA6BF,EAAeE,2BAC5C8nB,EAAqChoB,EAAegoB,mCAOxD,EAAQ,OAAR,CAAoBzrB,EAAUD,GAE9B,IAAImE,EAAiBV,EAAYU,eAC7BwnB,EAAe,CAAC,QAAS,QAAS,UAAW,QAAS,UAE1D,SAASC,EAAgBT,EAASU,EAAO3Z,GAGvC,GAAuC,oBAA5BiZ,EAAQS,gBAAgC,OAAOT,EAAQS,gBAAgBC,EAAO3Z,GAKpFiZ,EAAQW,SAAYX,EAAQW,QAAQD,GAAuC/qB,MAAMyR,QAAQ4Y,EAAQW,QAAQD,IAASV,EAAQW,QAAQD,GAAOE,QAAQ7Z,GAASiZ,EAAQW,QAAQD,GAAS,CAAC3Z,EAAIiZ,EAAQW,QAAQD,IAA5JV,EAAQ7oB,GAAGupB,EAAO3Z,GAGrE,SAAS8Y,EAAc1wB,EAAS4G,EAAQ3G,GACtC4F,EAASA,GAAU,EAAQ,QAC3B7F,EAAUA,GAAW,GAMG,mBAAbC,IAAwBA,EAAW2G,aAAkBf,GAGhE5B,KAAKtD,aAAeX,EAAQW,WACxBV,IAAUgE,KAAKtD,WAAasD,KAAKtD,cAAgBX,EAAQ0xB,oBAG7DztB,KAAK9D,cAAgBC,EAAiB6D,KAAMjE,EAAS,wBAAyBC,GAI9EgE,KAAKqJ,OAAS,IAAItJ,EAClBC,KAAKlC,OAAS,EACdkC,KAAK0tB,MAAQ,KACb1tB,KAAK2tB,WAAa,EAClB3tB,KAAK4tB,QAAU,KACf5tB,KAAK4D,OAAQ,EACb5D,KAAKuD,YAAa,EAClBvD,KAAKkS,SAAU,EAKflS,KAAKwG,MAAO,EAGZxG,KAAK6tB,cAAe,EACpB7tB,KAAK8tB,iBAAkB,EACvB9tB,KAAK+tB,mBAAoB,EACzB/tB,KAAKguB,iBAAkB,EACvBhuB,KAAKiuB,QAAS,EAEdjuB,KAAKmH,WAAkC,IAAtBpL,EAAQoL,UAEzBnH,KAAKoH,cAAgBrL,EAAQqL,YAE7BpH,KAAKkG,WAAY,EAIjBlG,KAAKqG,gBAAkBtK,EAAQsK,iBAAmB,OAElDrG,KAAKkuB,WAAa,EAElBluB,KAAKmuB,aAAc,EACnBnuB,KAAKouB,QAAU,KACfpuB,KAAKqI,SAAW,KAEZtM,EAAQsM,WACL4kB,IAAeA,EAAgB,EAAQ,QAAmBA,eAC/DjtB,KAAKouB,QAAU,IAAInB,EAAclxB,EAAQsM,UACzCrI,KAAKqI,SAAWtM,EAAQsM,UAI5B,SAAS3G,EAAS3F,GAEhB,GADA6F,EAASA,GAAU,EAAQ,UACrB5B,gBAAgB0B,GAAW,OAAO,IAAIA,EAAS3F,GAGrD,IAAIC,EAAWgE,gBAAgB4B,EAC/B5B,KAAKsD,eAAiB,IAAImpB,EAAc1wB,EAASiE,KAAMhE,GAEvDgE,KAAKgD,UAAW,EAEZjH,IAC0B,oBAAjBA,EAAQ+P,OAAqB9L,KAAKquB,MAAQtyB,EAAQ+P,MAC9B,oBAApB/P,EAAQ4L,UAAwB3H,KAAK4H,SAAW7L,EAAQ4L,UAGrElG,EAAO3B,KAAKE,MAiEd,SAASsuB,EAAiB3rB,EAAQkC,EAAOwD,EAAUkmB,EAAYC,GAC7D1B,EAAM,mBAAoBjoB,GAC1B,IAMM8B,EANFvK,EAAQuG,EAAOW,eAEnB,GAAc,OAAVuB,EACFzI,EAAM8V,SAAU,EAChBuc,EAAW9rB,EAAQvG,QAKnB,GAFKoyB,IAAgB7nB,EAAK+nB,EAAatyB,EAAOyI,IAE1C8B,EACFf,EAAejD,EAAQgE,QAClB,GAAIvK,EAAMM,YAAcmI,GAASA,EAAM/G,OAAS,EAKrD,GAJqB,kBAAV+G,GAAuBzI,EAAMM,YAAcO,OAAOoP,eAAexH,KAAWvF,EAAOF,YAC5FyF,EAAQD,EAAoBC,IAG1B0pB,EACEnyB,EAAMmH,WAAYqC,EAAejD,EAAQ,IAAIwqB,GAA2CwB,EAAShsB,EAAQvG,EAAOyI,GAAO,QACtH,GAAIzI,EAAMwH,MACfgC,EAAejD,EAAQ,IAAIuqB,OACtB,IAAI9wB,EAAM8J,UACf,OAAO,EAEP9J,EAAM8V,SAAU,EAEZ9V,EAAMgyB,UAAY/lB,GACpBxD,EAAQzI,EAAMgyB,QAAQ7mB,MAAM1C,GACxBzI,EAAMM,YAA+B,IAAjBmI,EAAM/G,OAAc6wB,EAAShsB,EAAQvG,EAAOyI,GAAO,GAAY+pB,EAAcjsB,EAAQvG,IAE7GuyB,EAAShsB,EAAQvG,EAAOyI,GAAO,QAGzB0pB,IACVnyB,EAAM8V,SAAU,EAChB0c,EAAcjsB,EAAQvG,IAO1B,OAAQA,EAAMwH,QAAUxH,EAAM0B,OAAS1B,EAAMF,eAAkC,IAAjBE,EAAM0B,QAGtE,SAAS6wB,EAAShsB,EAAQvG,EAAOyI,EAAO0pB,GAClCnyB,EAAMwxB,SAA4B,IAAjBxxB,EAAM0B,SAAiB1B,EAAMoK,MAChDpK,EAAM8xB,WAAa,EACnBvrB,EAAOwG,KAAK,OAAQtE,KAGpBzI,EAAM0B,QAAU1B,EAAMM,WAAa,EAAImI,EAAM/G,OACzCywB,EAAYnyB,EAAMiN,OAAOmkB,QAAQ3oB,GAAYzI,EAAMiN,OAAO7L,KAAKqH,GAC/DzI,EAAMyxB,cAAcgB,EAAalsB,IAGvCisB,EAAcjsB,EAAQvG,GAGxB,SAASsyB,EAAatyB,EAAOyI,GAC3B,IAAI8B,EAMJ,OAJK5B,EAAcF,IAA2B,kBAAVA,QAAgCgG,IAAVhG,GAAwBzI,EAAMM,aACtFiK,EAAK,IAAIvB,EAAqB,QAAS,CAAC,SAAU,SAAU,cAAeP,IAGtE8B,EAjIT1J,OAAOoB,eAAeqD,EAAStC,UAAW,YAAa,CAIrD7B,YAAY,EACZ2M,IAAK,WACH,YAA4BW,IAAxB7K,KAAKsD,gBAIFtD,KAAKsD,eAAe4C,WAE7B4E,IAAK,SAAavM,GAGXyB,KAAKsD,iBAMVtD,KAAKsD,eAAe4C,UAAY3H,MAGpCmD,EAAStC,UAAUuI,QAAUzC,EAAYyC,QACzCjG,EAAStC,UAAU2L,WAAa7F,EAAY8F,UAE5CtJ,EAAStC,UAAUwI,SAAW,SAAUlE,EAAKsE,GAC3CA,EAAGtE,IAOLhC,EAAStC,UAAU5B,KAAO,SAAUqH,EAAOwD,GACzC,IACImmB,EADApyB,EAAQ4D,KAAKsD,eAkBjB,OAfKlH,EAAMM,WAYT8xB,GAAiB,EAXI,kBAAV3pB,IACTwD,EAAWA,GAAYjM,EAAMiK,gBAEzBgC,IAAajM,EAAMiM,WACrBxD,EAAQvF,EAAOwF,KAAKD,EAAOwD,GAC3BA,EAAW,IAGbmmB,GAAiB,GAMdF,EAAiBtuB,KAAM6E,EAAOwD,GAAU,EAAOmmB,IAIxD9sB,EAAStC,UAAUouB,QAAU,SAAU3oB,GACrC,OAAOypB,EAAiBtuB,KAAM6E,EAAO,MAAM,GAAM,IAyEnDnD,EAAStC,UAAU0vB,SAAW,WAC5B,OAAuC,IAAhC9uB,KAAKsD,eAAesqB,SAI7BlsB,EAAStC,UAAU2vB,YAAc,SAAUvZ,GACpCyX,IAAeA,EAAgB,EAAQ,QAAmBA,eAC/D,IAAImB,EAAU,IAAInB,EAAczX,GAChCxV,KAAKsD,eAAe8qB,QAAUA,EAE9BpuB,KAAKsD,eAAe+E,SAAWrI,KAAKsD,eAAe8qB,QAAQ/lB,SAE3D,IAAI5H,EAAIT,KAAKsD,eAAe+F,OAAOpJ,KAC/B+uB,EAAU,GAEd,MAAa,OAANvuB,EACLuuB,GAAWZ,EAAQ7mB,MAAM9G,EAAEJ,MAC3BI,EAAIA,EAAEH,KAOR,OAJAN,KAAKsD,eAAe+F,OAAO4lB,QAEX,KAAZD,GAAgBhvB,KAAKsD,eAAe+F,OAAO7L,KAAKwxB,GACpDhvB,KAAKsD,eAAexF,OAASkxB,EAAQlxB,OAC9BkC,MAIT,IAAIkvB,EAAU,WAEd,SAASC,EAAwBzuB,GAgB/B,OAfIA,GAAKwuB,EAEPxuB,EAAIwuB,GAIJxuB,IACAA,GAAKA,IAAM,EACXA,GAAKA,IAAM,EACXA,GAAKA,IAAM,EACXA,GAAKA,IAAM,EACXA,GAAKA,IAAM,GACXA,KAGKA,EAKT,SAAS0uB,EAAc1uB,EAAGtE,GACxB,OAAIsE,GAAK,GAAsB,IAAjBtE,EAAM0B,QAAgB1B,EAAMwH,MAAc,EACpDxH,EAAMM,WAAmB,EAEzBgE,IAAMA,EAEJtE,EAAMwxB,SAAWxxB,EAAM0B,OAAe1B,EAAMiN,OAAOpJ,KAAKI,KAAKvC,OAAmB1B,EAAM0B,QAIxF4C,EAAItE,EAAMF,gBAAeE,EAAMF,cAAgBizB,EAAwBzuB,IACvEA,GAAKtE,EAAM0B,OAAe4C,EAEzBtE,EAAMwH,MAKJxH,EAAM0B,QAJX1B,EAAMyxB,cAAe,EACd,IAsGX,SAASY,EAAW9rB,EAAQvG,GAE1B,GADA0wB,EAAM,eACF1wB,EAAMwH,MAAV,CAEA,GAAIxH,EAAMgyB,QAAS,CACjB,IAAIvpB,EAAQzI,EAAMgyB,QAAQxjB,MAEtB/F,GAASA,EAAM/G,SACjB1B,EAAMiN,OAAO7L,KAAKqH,GAClBzI,EAAM0B,QAAU1B,EAAMM,WAAa,EAAImI,EAAM/G,QAIjD1B,EAAMwH,OAAQ,EAEVxH,EAAMoK,KAIRqoB,EAAalsB,IAGbvG,EAAMyxB,cAAe,EAEhBzxB,EAAM0xB,kBACT1xB,EAAM0xB,iBAAkB,EACxBuB,EAAc1sB,MAQpB,SAASksB,EAAalsB,GACpB,IAAIvG,EAAQuG,EAAOW,eACnBwpB,EAAM,eAAgB1wB,EAAMyxB,aAAczxB,EAAM0xB,iBAChD1xB,EAAMyxB,cAAe,EAEhBzxB,EAAM0xB,kBACThB,EAAM,eAAgB1wB,EAAMwxB,SAC5BxxB,EAAM0xB,iBAAkB,EACxB7lB,EAAQC,SAASmnB,EAAe1sB,IAIpC,SAAS0sB,EAAc1sB,GACrB,IAAIvG,EAAQuG,EAAOW,eACnBwpB,EAAM,gBAAiB1wB,EAAM8J,UAAW9J,EAAM0B,OAAQ1B,EAAMwH,OAEvDxH,EAAM8J,YAAc9J,EAAM0B,SAAU1B,EAAMwH,QAC7CjB,EAAOwG,KAAK,YACZ/M,EAAM0xB,iBAAkB,GAS1B1xB,EAAMyxB,cAAgBzxB,EAAMwxB,UAAYxxB,EAAMwH,OAASxH,EAAM0B,QAAU1B,EAAMF,cAC7EozB,EAAK3sB,GASP,SAASisB,EAAcjsB,EAAQvG,GACxBA,EAAM+xB,cACT/xB,EAAM+xB,aAAc,EACpBlmB,EAAQC,SAASqnB,EAAgB5sB,EAAQvG,IAI7C,SAASmzB,EAAe5sB,EAAQvG,GAwB9B,OAAQA,EAAM8V,UAAY9V,EAAMwH,QAAUxH,EAAM0B,OAAS1B,EAAMF,eAAiBE,EAAMwxB,SAA4B,IAAjBxxB,EAAM0B,QAAe,CACpH,IAAI2K,EAAMrM,EAAM0B,OAGhB,GAFAgvB,EAAM,wBACNnqB,EAAOmJ,KAAK,GACRrD,IAAQrM,EAAM0B,OAChB,MAGJ1B,EAAM+xB,aAAc,EAgJtB,SAASqB,EAAY7vB,GACnB,OAAO,WACL,IAAIvD,EAAQuD,EAAI2D,eAChBwpB,EAAM,cAAe1wB,EAAM8xB,YACvB9xB,EAAM8xB,YAAY9xB,EAAM8xB,aAEH,IAArB9xB,EAAM8xB,YAAoBvB,EAAgBhtB,EAAK,UACjDvD,EAAMwxB,SAAU,EAChB0B,EAAK3vB,KAqHX,SAAS8vB,EAAwBniB,GAC/B,IAAIlR,EAAQkR,EAAKhK,eACjBlH,EAAM2xB,kBAAoBzgB,EAAKoiB,cAAc,YAAc,EAEvDtzB,EAAM4xB,kBAAoB5xB,EAAM6xB,OAGlC7xB,EAAMwxB,SAAU,EACPtgB,EAAKoiB,cAAc,QAAU,GACtCpiB,EAAKqiB,SAIT,SAASC,EAAiBtiB,GACxBwf,EAAM,4BACNxf,EAAKxB,KAAK,GAqBZ,SAAS6jB,EAAOhtB,EAAQvG,GACjBA,EAAM4xB,kBACT5xB,EAAM4xB,iBAAkB,EACxB/lB,EAAQC,SAAS2nB,EAASltB,EAAQvG,IAItC,SAASyzB,EAAQltB,EAAQvG,GACvB0wB,EAAM,SAAU1wB,EAAM8V,SAEjB9V,EAAM8V,SACTvP,EAAOmJ,KAAK,GAGd1P,EAAM4xB,iBAAkB,EACxBrrB,EAAOwG,KAAK,UACZmmB,EAAK3sB,GACDvG,EAAMwxB,UAAYxxB,EAAM8V,SAASvP,EAAOmJ,KAAK,GAgBnD,SAASwjB,EAAK3sB,GACZ,IAAIvG,EAAQuG,EAAOW,eACnBwpB,EAAM,OAAQ1wB,EAAMwxB,SAEpB,MAAOxxB,EAAMwxB,SAA6B,OAAlBjrB,EAAOmJ,SA4HjC,SAASgkB,EAASpvB,EAAGtE,GAEnB,OAAqB,IAAjBA,EAAM0B,OAAqB,MAE3B1B,EAAMM,WAAY6D,EAAMnE,EAAMiN,OAAOtI,SAAkBL,GAAKA,GAAKtE,EAAM0B,QAEtDyC,EAAfnE,EAAMgyB,QAAehyB,EAAMiN,OAAOyF,KAAK,IAAqC,IAAxB1S,EAAMiN,OAAOvL,OAAoB1B,EAAMiN,OAAO0mB,QAAmB3zB,EAAMiN,OAAOoF,OAAOrS,EAAM0B,QACnJ1B,EAAMiN,OAAO4lB,SAGb1uB,EAAMnE,EAAMiN,OAAO2mB,QAAQtvB,EAAGtE,EAAMgyB,SAE/B7tB,GATP,IAAIA,EAYN,SAAS0vB,EAAYttB,GACnB,IAAIvG,EAAQuG,EAAOW,eACnBwpB,EAAM,cAAe1wB,EAAMmH,YAEtBnH,EAAMmH,aACTnH,EAAMwH,OAAQ,EACdqE,EAAQC,SAASgoB,EAAe9zB,EAAOuG,IAI3C,SAASutB,EAAc9zB,EAAOuG,GAG5B,GAFAmqB,EAAM,gBAAiB1wB,EAAMmH,WAAYnH,EAAM0B,SAE1C1B,EAAMmH,YAA+B,IAAjBnH,EAAM0B,SAC7B1B,EAAMmH,YAAa,EACnBZ,EAAOK,UAAW,EAClBL,EAAOwG,KAAK,OAER/M,EAAMgL,aAAa,CAGrB,IAAI+K,EAASxP,EAAOS,iBAEf+O,GAAUA,EAAO/K,aAAe+K,EAAOpQ,WAC1CY,EAAOgF,WAgBf,SAASgD,EAAQwlB,EAAI/gB,GACnB,IAAK,IAAIxR,EAAI,EAAGwL,EAAI+mB,EAAGryB,OAAQF,EAAIwL,EAAGxL,IACpC,GAAIuyB,EAAGvyB,KAAOwR,EAAG,OAAOxR,EAG1B,OAAQ,EA3tBV8D,EAAStC,UAAU0M,KAAO,SAAUpL,GAClCosB,EAAM,OAAQpsB,GACdA,EAAI0vB,SAAS1vB,EAAG,IAChB,IAAItE,EAAQ4D,KAAKsD,eACb+sB,EAAQ3vB,EAKZ,GAJU,IAANA,IAAStE,EAAM0xB,iBAAkB,GAI3B,IAANptB,GAAWtE,EAAMyxB,gBAA0C,IAAxBzxB,EAAMF,cAAsBE,EAAM0B,QAAU1B,EAAMF,cAAgBE,EAAM0B,OAAS,IAAM1B,EAAMwH,OAGlI,OAFAkpB,EAAM,qBAAsB1wB,EAAM0B,OAAQ1B,EAAMwH,OAC3B,IAAjBxH,EAAM0B,QAAgB1B,EAAMwH,MAAOqsB,EAAYjwB,MAAW6uB,EAAa7uB,MACpE,KAKT,GAFAU,EAAI0uB,EAAc1uB,EAAGtE,GAEX,IAANsE,GAAWtE,EAAMwH,MAEnB,OADqB,IAAjBxH,EAAM0B,QAAcmyB,EAAYjwB,MAC7B,KAyBT,IA4BIO,EA5BA+vB,EAASl0B,EAAMyxB,aAgDnB,OA/CAf,EAAM,gBAAiBwD,IAEF,IAAjBl0B,EAAM0B,QAAgB1B,EAAM0B,OAAS4C,EAAItE,EAAMF,iBACjDo0B,GAAS,EACTxD,EAAM,6BAA8BwD,IAKlCl0B,EAAMwH,OAASxH,EAAM8V,SACvBoe,GAAS,EACTxD,EAAM,mBAAoBwD,IACjBA,IACTxD,EAAM,WACN1wB,EAAM8V,SAAU,EAChB9V,EAAMoK,MAAO,EAEQ,IAAjBpK,EAAM0B,SAAc1B,EAAMyxB,cAAe,GAE7C7tB,KAAKquB,MAAMjyB,EAAMF,eAEjBE,EAAMoK,MAAO,EAGRpK,EAAM8V,UAASxR,EAAI0uB,EAAciB,EAAOj0B,KAIpCmE,EAAPG,EAAI,EAASovB,EAASpvB,EAAGtE,GAAkB,KAEnC,OAARmE,GACFnE,EAAMyxB,aAAezxB,EAAM0B,QAAU1B,EAAMF,cAC3CwE,EAAI,IAEJtE,EAAM0B,QAAU4C,EAChBtE,EAAM8xB,WAAa,GAGA,IAAjB9xB,EAAM0B,SAGH1B,EAAMwH,QAAOxH,EAAMyxB,cAAe,GAEnCwC,IAAU3vB,GAAKtE,EAAMwH,OAAOqsB,EAAYjwB,OAGlC,OAARO,GAAcP,KAAKmJ,KAAK,OAAQ5I,GAC7BA,GAwHTmB,EAAStC,UAAUivB,MAAQ,SAAU3tB,GACnCkF,EAAe5F,KAAM,IAAIqF,EAA2B,aAGtD3D,EAAStC,UAAUkL,KAAO,SAAU2M,EAAMsZ,GACxC,IAAI5wB,EAAMK,KACN5D,EAAQ4D,KAAKsD,eAEjB,OAAQlH,EAAMuxB,YACZ,KAAK,EACHvxB,EAAMsxB,MAAQzW,EACd,MAEF,KAAK,EACH7a,EAAMsxB,MAAQ,CAACtxB,EAAMsxB,MAAOzW,GAC5B,MAEF,QACE7a,EAAMsxB,MAAMlwB,KAAKyZ,GACjB,MAGJ7a,EAAMuxB,YAAc,EACpBb,EAAM,wBAAyB1wB,EAAMuxB,WAAY4C,GACjD,IAAIC,IAAUD,IAA6B,IAAjBA,EAAS3lB,MAAkBqM,IAAShP,EAAQwoB,QAAUxZ,IAAShP,EAAQyoB,OAC7FC,EAAQH,EAAQhtB,EAAQotB,EAI5B,SAASC,EAAS7tB,EAAU8tB,GAC1BhE,EAAM,YAEF9pB,IAAarD,GACXmxB,IAAwC,IAA1BA,EAAWC,aAC3BD,EAAWC,YAAa,EACxBC,KAKN,SAASxtB,IACPspB,EAAM,SACN7V,EAAKrM,MAhBHxO,EAAMmH,WAAY0E,EAAQC,SAASyoB,GAAYhxB,EAAIuC,KAAK,MAAOyuB,GACnE1Z,EAAKlT,GAAG,SAAU8sB,GAsBlB,IAAII,EAAUzB,EAAY7vB,GAC1BsX,EAAKlT,GAAG,QAASktB,GACjB,IAAIC,GAAY,EAEhB,SAASF,IACPlE,EAAM,WAEN7V,EAAKhT,eAAe,QAASN,GAC7BsT,EAAKhT,eAAe,SAAUf,GAC9B+T,EAAKhT,eAAe,QAASgtB,GAC7Bha,EAAKhT,eAAe,QAASR,GAC7BwT,EAAKhT,eAAe,SAAU4sB,GAC9BlxB,EAAIsE,eAAe,MAAOT,GAC1B7D,EAAIsE,eAAe,MAAO2sB,GAC1BjxB,EAAIsE,eAAe,OAAQktB,GAC3BD,GAAY,GAMR90B,EAAM8xB,YAAgBjX,EAAK7T,iBAAkB6T,EAAK7T,eAAe4C,WAAYirB,IAKnF,SAASE,EAAOtsB,GACdioB,EAAM,UACN,IAAIvsB,EAAM0W,EAAK1P,MAAM1C,GACrBioB,EAAM,aAAcvsB,IAER,IAARA,KAKwB,IAArBnE,EAAMuxB,YAAoBvxB,EAAMsxB,QAAUzW,GAAQ7a,EAAMuxB,WAAa,IAAqC,IAAhChjB,EAAQvO,EAAMsxB,MAAOzW,MAAkBia,IACpHpE,EAAM,8BAA+B1wB,EAAM8xB,YAC3C9xB,EAAM8xB,cAGRvuB,EAAIyxB,SAMR,SAAS3tB,EAAQkD,GACfmmB,EAAM,UAAWnmB,GACjBiqB,IACA3Z,EAAKhT,eAAe,QAASR,GACU,IAAnCkpB,EAAgB1V,EAAM,UAAgBrR,EAAeqR,EAAMtQ,GAMjE,SAAShD,IACPsT,EAAKhT,eAAe,SAAUf,GAC9B0tB,IAKF,SAAS1tB,IACP4pB,EAAM,YACN7V,EAAKhT,eAAe,QAASN,GAC7BitB,IAKF,SAASA,IACP9D,EAAM,UACNntB,EAAIixB,OAAO3Z,GAWb,OA7DAtX,EAAIoE,GAAG,OAAQotB,GA+Bf9D,EAAgBpW,EAAM,QAASxT,GAO/BwT,EAAK/U,KAAK,QAASyB,GAQnBsT,EAAK/U,KAAK,SAAUgB,GAQpB+T,EAAK9N,KAAK,OAAQxJ,GAEbvD,EAAMwxB,UACTd,EAAM,eACNntB,EAAIgwB,UAGC1Y,GAgBTvV,EAAStC,UAAUwxB,OAAS,SAAU3Z,GACpC,IAAI7a,EAAQ4D,KAAKsD,eACbwtB,EAAa,CACfC,YAAY,GAGd,GAAyB,IAArB30B,EAAMuxB,WAAkB,OAAO3tB,KAEnC,GAAyB,IAArB5D,EAAMuxB,WAER,OAAI1W,GAAQA,IAAS7a,EAAMsxB,QACtBzW,IAAMA,EAAO7a,EAAMsxB,OAExBtxB,EAAMsxB,MAAQ,KACdtxB,EAAMuxB,WAAa,EACnBvxB,EAAMwxB,SAAU,EACZ3W,GAAMA,EAAK9N,KAAK,SAAUnJ,KAAM8wB,IANK9wB,KAW3C,IAAKiX,EAAM,CAET,IAAIoa,EAAQj1B,EAAMsxB,MACdjlB,EAAMrM,EAAMuxB,WAChBvxB,EAAMsxB,MAAQ,KACdtxB,EAAMuxB,WAAa,EACnBvxB,EAAMwxB,SAAU,EAEhB,IAAK,IAAIhwB,EAAI,EAAGA,EAAI6K,EAAK7K,IACvByzB,EAAMzzB,GAAGuL,KAAK,SAAUnJ,KAAM,CAC5B+wB,YAAY,IAIhB,OAAO/wB,KAIT,IAAIsxB,EAAQ3mB,EAAQvO,EAAMsxB,MAAOzW,GACjC,OAAe,IAAXqa,IACJl1B,EAAMsxB,MAAM6D,OAAOD,EAAO,GAC1Bl1B,EAAMuxB,YAAc,EACK,IAArBvxB,EAAMuxB,aAAkBvxB,EAAMsxB,MAAQtxB,EAAMsxB,MAAM,IACtDzW,EAAK9N,KAAK,SAAUnJ,KAAM8wB,IAJD9wB,MAU3B0B,EAAStC,UAAU2E,GAAK,SAAUytB,EAAI7d,GACpC,IAAInD,EAAM/O,EAAOrC,UAAU2E,GAAGjE,KAAKE,KAAMwxB,EAAI7d,GACzCvX,EAAQ4D,KAAKsD,eAuBjB,MArBW,SAAPkuB,GAGFp1B,EAAM2xB,kBAAoB/tB,KAAK0vB,cAAc,YAAc,GAErC,IAAlBtzB,EAAMwxB,SAAmB5tB,KAAK2vB,UAClB,aAAP6B,IACJp1B,EAAMmH,YAAenH,EAAM2xB,oBAC9B3xB,EAAM2xB,kBAAoB3xB,EAAMyxB,cAAe,EAC/CzxB,EAAMwxB,SAAU,EAChBxxB,EAAM0xB,iBAAkB,EACxBhB,EAAM,cAAe1wB,EAAM0B,OAAQ1B,EAAM8V,SAErC9V,EAAM0B,OACR+wB,EAAa7uB,MACH5D,EAAM8V,SAChBjK,EAAQC,SAAS0nB,EAAkB5vB,QAKlCwQ,GAGT9O,EAAStC,UAAUqyB,YAAc/vB,EAAStC,UAAU2E,GAEpDrC,EAAStC,UAAU6E,eAAiB,SAAUutB,EAAI7d,GAChD,IAAInD,EAAM/O,EAAOrC,UAAU6E,eAAenE,KAAKE,KAAMwxB,EAAI7d,GAYzD,MAVW,aAAP6d,GAOFvpB,EAAQC,SAASunB,EAAyBzvB,MAGrCwQ,GAGT9O,EAAStC,UAAUsyB,mBAAqB,SAAUF,GAChD,IAAIhhB,EAAM/O,EAAOrC,UAAUsyB,mBAAmBj0B,MAAMuC,KAAMnC,WAY1D,MAVW,aAAP2zB,QAA4B3mB,IAAP2mB,GAOvBvpB,EAAQC,SAASunB,EAAyBzvB,MAGrCwQ,GAuBT9O,EAAStC,UAAUuwB,OAAS,WAC1B,IAAIvzB,EAAQ4D,KAAKsD,eAYjB,OAVKlH,EAAMwxB,UACTd,EAAM,UAIN1wB,EAAMwxB,SAAWxxB,EAAM2xB,kBACvB4B,EAAO3vB,KAAM5D,IAGfA,EAAM6xB,QAAS,EACRjuB,MAuBT0B,EAAStC,UAAUgyB,MAAQ,WAUzB,OATAtE,EAAM,wBAAyB9sB,KAAKsD,eAAesqB,UAEf,IAAhC5tB,KAAKsD,eAAesqB,UACtBd,EAAM,SACN9sB,KAAKsD,eAAesqB,SAAU,EAC9B5tB,KAAKmJ,KAAK,UAGZnJ,KAAKsD,eAAe2qB,QAAS,EACtBjuB,MAeT0B,EAAStC,UAAUuyB,KAAO,SAAUhvB,GAClC,IAAIwB,EAAQnE,KAER5D,EAAQ4D,KAAKsD,eACb2qB,GAAS,EA0Bb,IAAK,IAAIrwB,KAzBT+E,EAAOoB,GAAG,OAAO,WAGf,GAFA+oB,EAAM,eAEF1wB,EAAMgyB,UAAYhyB,EAAMwH,MAAO,CACjC,IAAIiB,EAAQzI,EAAMgyB,QAAQxjB,MACtB/F,GAASA,EAAM/G,QAAQqG,EAAM3G,KAAKqH,GAGxCV,EAAM3G,KAAK,SAEbmF,EAAOoB,GAAG,QAAQ,SAAUc,GAI1B,GAHAioB,EAAM,gBACF1wB,EAAMgyB,UAASvpB,EAAQzI,EAAMgyB,QAAQ7mB,MAAM1C,MAE3CzI,EAAMM,YAAyB,OAAVmI,QAA4BgG,IAAVhG,KAAuCzI,EAAMM,YAAgBmI,GAAUA,EAAM/G,QAA3C,CAE7E,IAAIyC,EAAM4D,EAAM3G,KAAKqH,GAEhBtE,IACH0tB,GAAS,EACTtrB,EAAOyuB,aAKGzuB,OACIkI,IAAZ7K,KAAKpC,IAAyC,oBAAd+E,EAAO/E,KACzCoC,KAAKpC,GAAK,SAAoBuP,GAC5B,OAAO,WACL,OAAOxK,EAAOwK,GAAQ1P,MAAMkF,EAAQ9E,YAF9B,CAIRD,IAKN,IAAK,IAAI8C,EAAI,EAAGA,EAAI0sB,EAAatvB,OAAQ4C,IACvCiC,EAAOoB,GAAGqpB,EAAa1sB,GAAIV,KAAKmJ,KAAK8D,KAAKjN,KAAMotB,EAAa1sB,KAc/D,OATAV,KAAKquB,MAAQ,SAAU3tB,GACrBosB,EAAM,gBAAiBpsB,GAEnButB,IACFA,GAAS,EACTtrB,EAAOgtB,WAIJ3vB,MAGa,oBAAXmK,SACTzI,EAAStC,UAAU+K,OAAOuC,eAAiB,WAKzC,YAJ0C7B,IAAtC+B,IACFA,EAAoC,EAAQ,SAGvCA,EAAkC5M,QAI7C/C,OAAOoB,eAAeqD,EAAStC,UAAW,wBAAyB,CAIjE7B,YAAY,EACZ2M,IAAK,WACH,OAAOlK,KAAKsD,eAAepH,iBAG/Be,OAAOoB,eAAeqD,EAAStC,UAAW,iBAAkB,CAI1D7B,YAAY,EACZ2M,IAAK,WACH,OAAOlK,KAAKsD,gBAAkBtD,KAAKsD,eAAe+F,UAGtDpM,OAAOoB,eAAeqD,EAAStC,UAAW,kBAAmB,CAI3D7B,YAAY,EACZ2M,IAAK,WACH,OAAOlK,KAAKsD,eAAesqB,SAE7B9iB,IAAK,SAAa1O,GACZ4D,KAAKsD,iBACPtD,KAAKsD,eAAesqB,QAAUxxB,MAKpCsF,EAASkwB,UAAY9B,EACrB7yB,OAAOoB,eAAeqD,EAAStC,UAAW,iBAAkB,CAI1D7B,YAAY,EACZ2M,IAAK,WACH,OAAOlK,KAAKsD,eAAexF,UAoDT,oBAAXqM,SACTzI,EAASoD,KAAO,SAAU+sB,EAAU9uB,GAKlC,YAJa8H,IAAT/F,IACFA,EAAO,EAAQ,SAGVA,EAAKpD,EAAUmwB,EAAU9uB,O,kECvlCpC,SAAS+uB,EAAeC,EAAUC,GAAcD,EAAS3yB,UAAYnC,OAAO8P,OAAOilB,EAAW5yB,WAAY2yB,EAAS3yB,UAAU6W,YAAc8b,EAAUA,EAASE,UAAYD,EAE1K,IAAIn2B,EAAQ,GAEZ,SAASq2B,EAAgBllB,EAAMmlB,EAASC,GAKtC,SAASC,EAAWC,EAAMC,EAAMC,GAC9B,MAAuB,kBAAZL,EACFA,EAEAA,EAAQG,EAAMC,EAAMC,GAR1BJ,IACHA,EAAO/jB,OAWT,IAAIokB,EAEJ,SAAUC,GAGR,SAASD,EAAUH,EAAMC,EAAMC,GAC7B,OAAOE,EAAM5yB,KAAKE,KAAMqyB,EAAWC,EAAMC,EAAMC,KAAUxyB,KAG3D,OANA8xB,EAAeW,EAAWC,GAMnBD,EAPT,CAQEL,GAEFK,EAAUrzB,UAAU3C,KAAO21B,EAAK31B,KAChCg2B,EAAUrzB,UAAU4N,KAAOA,EAC3BnR,EAAMmR,GAAQylB,EAIhB,SAASE,EAAMC,EAAUC,GACvB,GAAItwB,MAAMyR,QAAQ4e,GAAW,CAC3B,IAAInqB,EAAMmqB,EAAS90B,OAKnB,OAJA80B,EAAWA,EAAS1e,KAAI,SAAUtW,GAChC,OAAOk1B,OAAOl1B,MAGZ6K,EAAM,EACD,UAAUgG,OAAOokB,EAAO,KAAKpkB,OAAOmkB,EAAS9xB,MAAM,EAAG2H,EAAM,GAAGqG,KAAK,MAAO,SAAW8jB,EAASnqB,EAAM,GAC3F,IAARA,EACF,UAAUgG,OAAOokB,EAAO,KAAKpkB,OAAOmkB,EAAS,GAAI,QAAQnkB,OAAOmkB,EAAS,IAEzE,MAAMnkB,OAAOokB,EAAO,KAAKpkB,OAAOmkB,EAAS,IAGlD,MAAO,MAAMnkB,OAAOokB,EAAO,KAAKpkB,OAAOqkB,OAAOF,IAKlD,SAASG,EAAW5xB,EAAK6xB,EAAQC,GAC/B,OAAO9xB,EAAI+xB,QAAQD,GAAOA,EAAM,EAAI,GAAKA,EAAKD,EAAOl1B,UAAYk1B,EAInE,SAASG,EAAShyB,EAAK6xB,EAAQI,GAK7B,YAJiBvoB,IAAbuoB,GAA0BA,EAAWjyB,EAAIrD,UAC3Cs1B,EAAWjyB,EAAIrD,QAGVqD,EAAIkyB,UAAUD,EAAWJ,EAAOl1B,OAAQs1B,KAAcJ,EAI/D,SAASM,EAASnyB,EAAK6xB,EAAQpc,GAK7B,MAJqB,kBAAVA,IACTA,EAAQ,KAGNA,EAAQoc,EAAOl1B,OAASqD,EAAIrD,UAGS,IAAhCqD,EAAIwJ,QAAQqoB,EAAQpc,GAI/Bsb,EAAgB,yBAAyB,SAAUz1B,EAAM8B,GACvD,MAAO,cAAgBA,EAAQ,4BAA8B9B,EAAO,MACnEoC,WACHqzB,EAAgB,wBAAwB,SAAUz1B,EAAMm2B,EAAUW,GAEhE,IAAIC,EASA5d,EAEJ,GATwB,kBAAbgd,GAAyBG,EAAWH,EAAU,SACvDY,EAAa,cACbZ,EAAWA,EAASpb,QAAQ,QAAS,KAErCgc,EAAa,UAKXL,EAAS12B,EAAM,aAEjBmZ,EAAM,OAAOnH,OAAOhS,EAAM,KAAKgS,OAAO+kB,EAAY,KAAK/kB,OAAOkkB,EAAMC,EAAU,aACzE,CACL,IAAIrkB,EAAO+kB,EAAS72B,EAAM,KAAO,WAAa,WAC9CmZ,EAAM,QAASnH,OAAOhS,EAAM,MAAOgS,OAAOF,EAAM,KAAKE,OAAO+kB,EAAY,KAAK/kB,OAAOkkB,EAAMC,EAAU,SAItG,OADAhd,GAAO,mBAAmBnH,cAAc8kB,GACjC3d,IACN/W,WACHqzB,EAAgB,4BAA6B,2BAC7CA,EAAgB,8BAA8B,SAAUz1B,GACtD,MAAO,OAASA,EAAO,gCAEzBy1B,EAAgB,6BAA8B,mBAC9CA,EAAgB,wBAAwB,SAAUz1B,GAChD,MAAO,eAAiBA,EAAO,mCAEjCy1B,EAAgB,wBAAyB,kCACzCA,EAAgB,yBAA0B,6BAC1CA,EAAgB,6BAA8B,mBAC9CA,EAAgB,yBAA0B,sCAAuCrzB,WACjFqzB,EAAgB,wBAAwB,SAAUuB,GAChD,MAAO,qBAAuBA,IAC7B50B,WACHqzB,EAAgB,qCAAsC,oCACtDv1B,EAAOC,QAAQf,MAAQA,G,qBC9HvBc,EAAOC,QAAU,EAAQ,QAAU8vB,c,kCC+DnC/vB,EAAOC,QAAUiF,EAEjB,IAAIsD,EAAiB,EAAQ,QAAatJ,MACtCwJ,EAA6BF,EAAeE,2BAC5CC,EAAwBH,EAAeG,sBACvCouB,EAAqCvuB,EAAeuuB,mCACpDC,EAA8BxuB,EAAewuB,4BAE7C/xB,EAAS,EAAQ,QAIrB,SAASgyB,EAAejtB,EAAItG,GAC1B,IAAIwzB,EAAK7zB,KAAK8zB,gBACdD,EAAGE,cAAe,EAClB,IAAI/rB,EAAK6rB,EAAGjtB,QAEZ,GAAW,OAAPoB,EACF,OAAOhI,KAAKmJ,KAAK,QAAS,IAAI7D,GAGhCuuB,EAAGG,WAAa,KAChBH,EAAGjtB,QAAU,KACD,MAARvG,GACFL,KAAKxC,KAAK6C,GACZ2H,EAAGrB,GACH,IAAIstB,EAAKj0B,KAAKsD,eACd2wB,EAAG/hB,SAAU,GAET+hB,EAAGpG,cAAgBoG,EAAGn2B,OAASm2B,EAAG/3B,gBACpC8D,KAAKquB,MAAM4F,EAAG/3B,eAIlB,SAAS2F,EAAU9F,GACjB,KAAMiE,gBAAgB6B,GAAY,OAAO,IAAIA,EAAU9F,GACvD6F,EAAO9B,KAAKE,KAAMjE,GAClBiE,KAAK8zB,gBAAkB,CACrBF,eAAgBA,EAAe3mB,KAAKjN,MACpCk0B,eAAe,EACfH,cAAc,EACdntB,QAAS,KACTotB,WAAY,KACZG,cAAe,MAGjBn0B,KAAKsD,eAAeuqB,cAAe,EAInC7tB,KAAKsD,eAAekD,MAAO,EAEvBzK,IAC+B,oBAAtBA,EAAQ2mB,YAA0B1iB,KAAKuT,WAAaxX,EAAQ2mB,WAC1C,oBAAlB3mB,EAAQq4B,QAAsBp0B,KAAKq0B,OAASt4B,EAAQq4B,QAIjEp0B,KAAK+D,GAAG,YAAa2F,GAGvB,SAASA,IACP,IAAIvF,EAAQnE,KAEe,oBAAhBA,KAAKq0B,QAA0Br0B,KAAKsD,eAAe4C,UAK5DwF,EAAK1L,KAAM,KAAM,MAJjBA,KAAKq0B,QAAO,SAAU1tB,EAAItG,GACxBqL,EAAKvH,EAAOwC,EAAItG,MA6DtB,SAASqL,EAAK/I,EAAQgE,EAAItG,GACxB,GAAIsG,EAAI,OAAOhE,EAAOwG,KAAK,QAASxC,GAMpC,GALY,MAARtG,GACFsC,EAAOnF,KAAK6C,GAIVsC,EAAOS,eAAetF,OAAQ,MAAM,IAAI61B,EAC5C,GAAIhxB,EAAOmxB,gBAAgBC,aAAc,MAAM,IAAIL,EACnD,OAAO/wB,EAAOnF,KAAK,MA9HrB,EAAQ,OAAR,CAAoBqE,EAAWD,GA+D/BC,EAAUzC,UAAU5B,KAAO,SAAUqH,EAAOwD,GAE1C,OADArI,KAAK8zB,gBAAgBI,eAAgB,EAC9BtyB,EAAOxC,UAAU5B,KAAKsC,KAAKE,KAAM6E,EAAOwD,IAajDxG,EAAUzC,UAAUmU,WAAa,SAAU1O,EAAOwD,EAAUL,GAC1DA,EAAG,IAAI3C,EAA2B,kBAGpCxD,EAAUzC,UAAUoI,OAAS,SAAU3C,EAAOwD,EAAUL,GACtD,IAAI6rB,EAAK7zB,KAAK8zB,gBAKd,GAJAD,EAAGjtB,QAAUoB,EACb6rB,EAAGG,WAAanvB,EAChBgvB,EAAGM,cAAgB9rB,GAEdwrB,EAAGE,aAAc,CACpB,IAAIE,EAAKj0B,KAAKsD,gBACVuwB,EAAGK,eAAiBD,EAAGpG,cAAgBoG,EAAGn2B,OAASm2B,EAAG/3B,gBAAe8D,KAAKquB,MAAM4F,EAAG/3B,iBAO3F2F,EAAUzC,UAAUivB,MAAQ,SAAU3tB,GACpC,IAAImzB,EAAK7zB,KAAK8zB,gBAEQ,OAAlBD,EAAGG,YAAwBH,EAAGE,aAOhCF,EAAGK,eAAgB,GANnBL,EAAGE,cAAe,EAElB/zB,KAAKuT,WAAWsgB,EAAGG,WAAYH,EAAGM,cAAeN,EAAGD,kBAQxD/xB,EAAUzC,UAAUwI,SAAW,SAAUlE,EAAKsE,GAC5CpG,EAAOxC,UAAUwI,SAAS9H,KAAKE,KAAM0D,GAAK,SAAU4wB,GAClDtsB,EAAGssB,Q,mBC1LP33B,EAAOC,QAAU,WACf,MAAM,IAAIyR,MAAM","file":"js/chunk-vendors~38d28a58.b1037c62.js","sourcesContent":["'use strict';\n\nvar ERR_INVALID_OPT_VALUE = require('../../../errors').codes.ERR_INVALID_OPT_VALUE;\n\nfunction highWaterMarkFrom(options, isDuplex, duplexKey) {\n  return options.highWaterMark != null ? options.highWaterMark : isDuplex ? options[duplexKey] : null;\n}\n\nfunction getHighWaterMark(state, options, duplexKey, isDuplex) {\n  var hwm = highWaterMarkFrom(options, isDuplex, duplexKey);\n\n  if (hwm != null) {\n    if (!(isFinite(hwm) && Math.floor(hwm) === hwm) || hwm < 0) {\n      var name = isDuplex ? duplexKey : 'highWaterMark';\n      throw new ERR_INVALID_OPT_VALUE(name, hwm);\n    }\n\n    return Math.floor(hwm);\n  } // Default value\n\n\n  return state.objectMode ? 16 : 16 * 1024;\n}\n\nmodule.exports = {\n  getHighWaterMark: getHighWaterMark\n};","module.exports = require('./browser/algorithms.json')\n","'use strict';\n\nfunction ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); if (enumerableOnly) symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; }); keys.push.apply(keys, symbols); } return keys; }\n\nfunction _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i] != null ? arguments[i] : {}; if (i % 2) { ownKeys(Object(source), true).forEach(function (key) { _defineProperty(target, key, source[key]); }); } else if (Object.getOwnPropertyDescriptors) { Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)); } else { ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } } return target; }\n\nfunction _defineProperty(obj, key, value) { if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }\n\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if (\"value\" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } }\n\nfunction _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); return Constructor; }\n\nvar _require = require('buffer'),\n    Buffer = _require.Buffer;\n\nvar _require2 = require('util'),\n    inspect = _require2.inspect;\n\nvar custom = inspect && inspect.custom || 'inspect';\n\nfunction copyBuffer(src, target, offset) {\n  Buffer.prototype.copy.call(src, target, offset);\n}\n\nmodule.exports =\n/*#__PURE__*/\nfunction () {\n  function BufferList() {\n    _classCallCheck(this, BufferList);\n\n    this.head = null;\n    this.tail = null;\n    this.length = 0;\n  }\n\n  _createClass(BufferList, [{\n    key: \"push\",\n    value: function push(v) {\n      var entry = {\n        data: v,\n        next: null\n      };\n      if (this.length > 0) this.tail.next = entry;else this.head = entry;\n      this.tail = entry;\n      ++this.length;\n    }\n  }, {\n    key: \"unshift\",\n    value: function unshift(v) {\n      var entry = {\n        data: v,\n        next: this.head\n      };\n      if (this.length === 0) this.tail = entry;\n      this.head = entry;\n      ++this.length;\n    }\n  }, {\n    key: \"shift\",\n    value: function shift() {\n      if (this.length === 0) return;\n      var ret = this.head.data;\n      if (this.length === 1) this.head = this.tail = null;else this.head = this.head.next;\n      --this.length;\n      return ret;\n    }\n  }, {\n    key: \"clear\",\n    value: function clear() {\n      this.head = this.tail = null;\n      this.length = 0;\n    }\n  }, {\n    key: \"join\",\n    value: function join(s) {\n      if (this.length === 0) return '';\n      var p = this.head;\n      var ret = '' + p.data;\n\n      while (p = p.next) {\n        ret += s + p.data;\n      }\n\n      return ret;\n    }\n  }, {\n    key: \"concat\",\n    value: function concat(n) {\n      if (this.length === 0) return Buffer.alloc(0);\n      var ret = Buffer.allocUnsafe(n >>> 0);\n      var p = this.head;\n      var i = 0;\n\n      while (p) {\n        copyBuffer(p.data, ret, i);\n        i += p.data.length;\n        p = p.next;\n      }\n\n      return ret;\n    } // Consumes a specified amount of bytes or characters from the buffered data.\n\n  }, {\n    key: \"consume\",\n    value: function consume(n, hasStrings) {\n      var ret;\n\n      if (n < this.head.data.length) {\n        // `slice` is the same for buffers and strings.\n        ret = this.head.data.slice(0, n);\n        this.head.data = this.head.data.slice(n);\n      } else if (n === this.head.data.length) {\n        // First chunk is a perfect match.\n        ret = this.shift();\n      } else {\n        // Result spans more than one buffer.\n        ret = hasStrings ? this._getString(n) : this._getBuffer(n);\n      }\n\n      return ret;\n    }\n  }, {\n    key: \"first\",\n    value: function first() {\n      return this.head.data;\n    } // Consumes a specified amount of characters from the buffered data.\n\n  }, {\n    key: \"_getString\",\n    value: function _getString(n) {\n      var p = this.head;\n      var c = 1;\n      var ret = p.data;\n      n -= ret.length;\n\n      while (p = p.next) {\n        var str = p.data;\n        var nb = n > str.length ? str.length : n;\n        if (nb === str.length) ret += str;else ret += str.slice(0, n);\n        n -= nb;\n\n        if (n === 0) {\n          if (nb === str.length) {\n            ++c;\n            if (p.next) this.head = p.next;else this.head = this.tail = null;\n          } else {\n            this.head = p;\n            p.data = str.slice(nb);\n          }\n\n          break;\n        }\n\n        ++c;\n      }\n\n      this.length -= c;\n      return ret;\n    } // Consumes a specified amount of bytes from the buffered data.\n\n  }, {\n    key: \"_getBuffer\",\n    value: function _getBuffer(n) {\n      var ret = Buffer.allocUnsafe(n);\n      var p = this.head;\n      var c = 1;\n      p.data.copy(ret);\n      n -= p.data.length;\n\n      while (p = p.next) {\n        var buf = p.data;\n        var nb = n > buf.length ? buf.length : n;\n        buf.copy(ret, ret.length - n, 0, nb);\n        n -= nb;\n\n        if (n === 0) {\n          if (nb === buf.length) {\n            ++c;\n            if (p.next) this.head = p.next;else this.head = this.tail = null;\n          } else {\n            this.head = p;\n            p.data = buf.slice(nb);\n          }\n\n          break;\n        }\n\n        ++c;\n      }\n\n      this.length -= c;\n      return ret;\n    } // Make sure the linked list only shows the minimal necessary information.\n\n  }, {\n    key: custom,\n    value: function value(_, options) {\n      return inspect(this, _objectSpread({}, options, {\n        // Only inspect one level.\n        depth: 0,\n        // It should not recurse.\n        customInspect: false\n      }));\n    }\n  }]);\n\n  return BufferList;\n}();","exports = module.exports = require('./lib/_stream_readable.js');\nexports.Stream = exports;\nexports.Readable = exports;\nexports.Writable = require('./lib/_stream_writable.js');\nexports.Duplex = require('./lib/_stream_duplex.js');\nexports.Transform = require('./lib/_stream_transform.js');\nexports.PassThrough = require('./lib/_stream_passthrough.js');\nexports.finished = require('./lib/internal/streams/end-of-stream.js');\nexports.pipeline = require('./lib/internal/streams/pipeline.js');\n","// Ported from https://github.com/mafintosh/end-of-stream with\n// permission from the author, Mathias Buus (@mafintosh).\n'use strict';\n\nvar ERR_STREAM_PREMATURE_CLOSE = require('../../../errors').codes.ERR_STREAM_PREMATURE_CLOSE;\n\nfunction once(callback) {\n  var called = false;\n  return function () {\n    if (called) return;\n    called = true;\n\n    for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n      args[_key] = arguments[_key];\n    }\n\n    callback.apply(this, args);\n  };\n}\n\nfunction noop() {}\n\nfunction isRequest(stream) {\n  return stream.setHeader && typeof stream.abort === 'function';\n}\n\nfunction eos(stream, opts, callback) {\n  if (typeof opts === 'function') return eos(stream, null, opts);\n  if (!opts) opts = {};\n  callback = once(callback || noop);\n  var readable = opts.readable || opts.readable !== false && stream.readable;\n  var writable = opts.writable || opts.writable !== false && stream.writable;\n\n  var onlegacyfinish = function onlegacyfinish() {\n    if (!stream.writable) onfinish();\n  };\n\n  var writableEnded = stream._writableState && stream._writableState.finished;\n\n  var onfinish = function onfinish() {\n    writable = false;\n    writableEnded = true;\n    if (!readable) callback.call(stream);\n  };\n\n  var readableEnded = stream._readableState && stream._readableState.endEmitted;\n\n  var onend = function onend() {\n    readable = false;\n    readableEnded = true;\n    if (!writable) callback.call(stream);\n  };\n\n  var onerror = function onerror(err) {\n    callback.call(stream, err);\n  };\n\n  var onclose = function onclose() {\n    var err;\n\n    if (readable && !readableEnded) {\n      if (!stream._readableState || !stream._readableState.ended) err = new ERR_STREAM_PREMATURE_CLOSE();\n      return callback.call(stream, err);\n    }\n\n    if (writable && !writableEnded) {\n      if (!stream._writableState || !stream._writableState.ended) err = new ERR_STREAM_PREMATURE_CLOSE();\n      return callback.call(stream, err);\n    }\n  };\n\n  var onrequest = function onrequest() {\n    stream.req.on('finish', onfinish);\n  };\n\n  if (isRequest(stream)) {\n    stream.on('complete', onfinish);\n    stream.on('abort', onclose);\n    if (stream.req) onrequest();else stream.on('request', onrequest);\n  } else if (writable && !stream._writableState) {\n    // legacy streams\n    stream.on('end', onlegacyfinish);\n    stream.on('close', onlegacyfinish);\n  }\n\n  stream.on('end', onend);\n  stream.on('finish', onfinish);\n  if (opts.error !== false) stream.on('error', onerror);\n  stream.on('close', onclose);\n  return function () {\n    stream.removeListener('complete', onfinish);\n    stream.removeListener('abort', onclose);\n    stream.removeListener('request', onrequest);\n    if (stream.req) stream.req.removeListener('finish', onfinish);\n    stream.removeListener('end', onlegacyfinish);\n    stream.removeListener('close', onlegacyfinish);\n    stream.removeListener('finish', onfinish);\n    stream.removeListener('end', onend);\n    stream.removeListener('error', onerror);\n    stream.removeListener('close', onclose);\n  };\n}\n\nmodule.exports = eos;","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n// A bit simpler than readable streams.\n// Implement an async ._write(chunk, encoding, cb), and it'll handle all\n// the drain event emission and buffering.\n'use strict';\n\nmodule.exports = Writable;\n/* <replacement> */\n\nfunction WriteReq(chunk, encoding, cb) {\n  this.chunk = chunk;\n  this.encoding = encoding;\n  this.callback = cb;\n  this.next = null;\n} // It seems a linked list but it is not\n// there will be only 2 of these for each stream\n\n\nfunction CorkedRequest(state) {\n  var _this = this;\n\n  this.next = null;\n  this.entry = null;\n\n  this.finish = function () {\n    onCorkedFinish(_this, state);\n  };\n}\n/* </replacement> */\n\n/*<replacement>*/\n\n\nvar Duplex;\n/*</replacement>*/\n\nWritable.WritableState = WritableState;\n/*<replacement>*/\n\nvar internalUtil = {\n  deprecate: require('util-deprecate')\n};\n/*</replacement>*/\n\n/*<replacement>*/\n\nvar Stream = require('./internal/streams/stream');\n/*</replacement>*/\n\n\nvar Buffer = require('buffer').Buffer;\n\nvar OurUint8Array = global.Uint8Array || function () {};\n\nfunction _uint8ArrayToBuffer(chunk) {\n  return Buffer.from(chunk);\n}\n\nfunction _isUint8Array(obj) {\n  return Buffer.isBuffer(obj) || obj instanceof OurUint8Array;\n}\n\nvar destroyImpl = require('./internal/streams/destroy');\n\nvar _require = require('./internal/streams/state'),\n    getHighWaterMark = _require.getHighWaterMark;\n\nvar _require$codes = require('../errors').codes,\n    ERR_INVALID_ARG_TYPE = _require$codes.ERR_INVALID_ARG_TYPE,\n    ERR_METHOD_NOT_IMPLEMENTED = _require$codes.ERR_METHOD_NOT_IMPLEMENTED,\n    ERR_MULTIPLE_CALLBACK = _require$codes.ERR_MULTIPLE_CALLBACK,\n    ERR_STREAM_CANNOT_PIPE = _require$codes.ERR_STREAM_CANNOT_PIPE,\n    ERR_STREAM_DESTROYED = _require$codes.ERR_STREAM_DESTROYED,\n    ERR_STREAM_NULL_VALUES = _require$codes.ERR_STREAM_NULL_VALUES,\n    ERR_STREAM_WRITE_AFTER_END = _require$codes.ERR_STREAM_WRITE_AFTER_END,\n    ERR_UNKNOWN_ENCODING = _require$codes.ERR_UNKNOWN_ENCODING;\n\nvar errorOrDestroy = destroyImpl.errorOrDestroy;\n\nrequire('inherits')(Writable, Stream);\n\nfunction nop() {}\n\nfunction WritableState(options, stream, isDuplex) {\n  Duplex = Duplex || require('./_stream_duplex');\n  options = options || {}; // Duplex streams are both readable and writable, but share\n  // the same options object.\n  // However, some cases require setting options to different\n  // values for the readable and the writable sides of the duplex stream,\n  // e.g. options.readableObjectMode vs. options.writableObjectMode, etc.\n\n  if (typeof isDuplex !== 'boolean') isDuplex = stream instanceof Duplex; // object stream flag to indicate whether or not this stream\n  // contains buffers or objects.\n\n  this.objectMode = !!options.objectMode;\n  if (isDuplex) this.objectMode = this.objectMode || !!options.writableObjectMode; // the point at which write() starts returning false\n  // Note: 0 is a valid value, means that we always return false if\n  // the entire buffer is not flushed immediately on write()\n\n  this.highWaterMark = getHighWaterMark(this, options, 'writableHighWaterMark', isDuplex); // if _final has been called\n\n  this.finalCalled = false; // drain event flag.\n\n  this.needDrain = false; // at the start of calling end()\n\n  this.ending = false; // when end() has been called, and returned\n\n  this.ended = false; // when 'finish' is emitted\n\n  this.finished = false; // has it been destroyed\n\n  this.destroyed = false; // should we decode strings into buffers before passing to _write?\n  // this is here so that some node-core streams can optimize string\n  // handling at a lower level.\n\n  var noDecode = options.decodeStrings === false;\n  this.decodeStrings = !noDecode; // Crypto is kind of old and crusty.  Historically, its default string\n  // encoding is 'binary' so we have to make this configurable.\n  // Everything else in the universe uses 'utf8', though.\n\n  this.defaultEncoding = options.defaultEncoding || 'utf8'; // not an actual buffer we keep track of, but a measurement\n  // of how much we're waiting to get pushed to some underlying\n  // socket or file.\n\n  this.length = 0; // a flag to see when we're in the middle of a write.\n\n  this.writing = false; // when true all writes will be buffered until .uncork() call\n\n  this.corked = 0; // a flag to be able to tell if the onwrite cb is called immediately,\n  // or on a later tick.  We set this to true at first, because any\n  // actions that shouldn't happen until \"later\" should generally also\n  // not happen before the first write call.\n\n  this.sync = true; // a flag to know if we're processing previously buffered items, which\n  // may call the _write() callback in the same tick, so that we don't\n  // end up in an overlapped onwrite situation.\n\n  this.bufferProcessing = false; // the callback that's passed to _write(chunk,cb)\n\n  this.onwrite = function (er) {\n    onwrite(stream, er);\n  }; // the callback that the user supplies to write(chunk,encoding,cb)\n\n\n  this.writecb = null; // the amount that is being written when _write is called.\n\n  this.writelen = 0;\n  this.bufferedRequest = null;\n  this.lastBufferedRequest = null; // number of pending user-supplied write callbacks\n  // this must be 0 before 'finish' can be emitted\n\n  this.pendingcb = 0; // emit prefinish if the only thing we're waiting for is _write cbs\n  // This is relevant for synchronous Transform streams\n\n  this.prefinished = false; // True if the error was already emitted and should not be thrown again\n\n  this.errorEmitted = false; // Should close be emitted on destroy. Defaults to true.\n\n  this.emitClose = options.emitClose !== false; // Should .destroy() be called after 'finish' (and potentially 'end')\n\n  this.autoDestroy = !!options.autoDestroy; // count buffered requests\n\n  this.bufferedRequestCount = 0; // allocate the first CorkedRequest, there is always\n  // one allocated and free to use, and we maintain at most two\n\n  this.corkedRequestsFree = new CorkedRequest(this);\n}\n\nWritableState.prototype.getBuffer = function getBuffer() {\n  var current = this.bufferedRequest;\n  var out = [];\n\n  while (current) {\n    out.push(current);\n    current = current.next;\n  }\n\n  return out;\n};\n\n(function () {\n  try {\n    Object.defineProperty(WritableState.prototype, 'buffer', {\n      get: internalUtil.deprecate(function writableStateBufferGetter() {\n        return this.getBuffer();\n      }, '_writableState.buffer is deprecated. Use _writableState.getBuffer ' + 'instead.', 'DEP0003')\n    });\n  } catch (_) {}\n})(); // Test _writableState for inheritance to account for Duplex streams,\n// whose prototype chain only points to Readable.\n\n\nvar realHasInstance;\n\nif (typeof Symbol === 'function' && Symbol.hasInstance && typeof Function.prototype[Symbol.hasInstance] === 'function') {\n  realHasInstance = Function.prototype[Symbol.hasInstance];\n  Object.defineProperty(Writable, Symbol.hasInstance, {\n    value: function value(object) {\n      if (realHasInstance.call(this, object)) return true;\n      if (this !== Writable) return false;\n      return object && object._writableState instanceof WritableState;\n    }\n  });\n} else {\n  realHasInstance = function realHasInstance(object) {\n    return object instanceof this;\n  };\n}\n\nfunction Writable(options) {\n  Duplex = Duplex || require('./_stream_duplex'); // Writable ctor is applied to Duplexes, too.\n  // `realHasInstance` is necessary because using plain `instanceof`\n  // would return false, as no `_writableState` property is attached.\n  // Trying to use the custom `instanceof` for Writable here will also break the\n  // Node.js LazyTransform implementation, which has a non-trivial getter for\n  // `_writableState` that would lead to infinite recursion.\n  // Checking for a Stream.Duplex instance is faster here instead of inside\n  // the WritableState constructor, at least with V8 6.5\n\n  var isDuplex = this instanceof Duplex;\n  if (!isDuplex && !realHasInstance.call(Writable, this)) return new Writable(options);\n  this._writableState = new WritableState(options, this, isDuplex); // legacy.\n\n  this.writable = true;\n\n  if (options) {\n    if (typeof options.write === 'function') this._write = options.write;\n    if (typeof options.writev === 'function') this._writev = options.writev;\n    if (typeof options.destroy === 'function') this._destroy = options.destroy;\n    if (typeof options.final === 'function') this._final = options.final;\n  }\n\n  Stream.call(this);\n} // Otherwise people can pipe Writable streams, which is just wrong.\n\n\nWritable.prototype.pipe = function () {\n  errorOrDestroy(this, new ERR_STREAM_CANNOT_PIPE());\n};\n\nfunction writeAfterEnd(stream, cb) {\n  var er = new ERR_STREAM_WRITE_AFTER_END(); // TODO: defer error events consistently everywhere, not just the cb\n\n  errorOrDestroy(stream, er);\n  process.nextTick(cb, er);\n} // Checks that a user-supplied chunk is valid, especially for the particular\n// mode the stream is in. Currently this means that `null` is never accepted\n// and undefined/non-string values are only allowed in object mode.\n\n\nfunction validChunk(stream, state, chunk, cb) {\n  var er;\n\n  if (chunk === null) {\n    er = new ERR_STREAM_NULL_VALUES();\n  } else if (typeof chunk !== 'string' && !state.objectMode) {\n    er = new ERR_INVALID_ARG_TYPE('chunk', ['string', 'Buffer'], chunk);\n  }\n\n  if (er) {\n    errorOrDestroy(stream, er);\n    process.nextTick(cb, er);\n    return false;\n  }\n\n  return true;\n}\n\nWritable.prototype.write = function (chunk, encoding, cb) {\n  var state = this._writableState;\n  var ret = false;\n\n  var isBuf = !state.objectMode && _isUint8Array(chunk);\n\n  if (isBuf && !Buffer.isBuffer(chunk)) {\n    chunk = _uint8ArrayToBuffer(chunk);\n  }\n\n  if (typeof encoding === 'function') {\n    cb = encoding;\n    encoding = null;\n  }\n\n  if (isBuf) encoding = 'buffer';else if (!encoding) encoding = state.defaultEncoding;\n  if (typeof cb !== 'function') cb = nop;\n  if (state.ending) writeAfterEnd(this, cb);else if (isBuf || validChunk(this, state, chunk, cb)) {\n    state.pendingcb++;\n    ret = writeOrBuffer(this, state, isBuf, chunk, encoding, cb);\n  }\n  return ret;\n};\n\nWritable.prototype.cork = function () {\n  this._writableState.corked++;\n};\n\nWritable.prototype.uncork = function () {\n  var state = this._writableState;\n\n  if (state.corked) {\n    state.corked--;\n    if (!state.writing && !state.corked && !state.bufferProcessing && state.bufferedRequest) clearBuffer(this, state);\n  }\n};\n\nWritable.prototype.setDefaultEncoding = function setDefaultEncoding(encoding) {\n  // node::ParseEncoding() requires lower case.\n  if (typeof encoding === 'string') encoding = encoding.toLowerCase();\n  if (!(['hex', 'utf8', 'utf-8', 'ascii', 'binary', 'base64', 'ucs2', 'ucs-2', 'utf16le', 'utf-16le', 'raw'].indexOf((encoding + '').toLowerCase()) > -1)) throw new ERR_UNKNOWN_ENCODING(encoding);\n  this._writableState.defaultEncoding = encoding;\n  return this;\n};\n\nObject.defineProperty(Writable.prototype, 'writableBuffer', {\n  // making it explicit this property is not enumerable\n  // because otherwise some prototype manipulation in\n  // userland will fail\n  enumerable: false,\n  get: function get() {\n    return this._writableState && this._writableState.getBuffer();\n  }\n});\n\nfunction decodeChunk(state, chunk, encoding) {\n  if (!state.objectMode && state.decodeStrings !== false && typeof chunk === 'string') {\n    chunk = Buffer.from(chunk, encoding);\n  }\n\n  return chunk;\n}\n\nObject.defineProperty(Writable.prototype, 'writableHighWaterMark', {\n  // making it explicit this property is not enumerable\n  // because otherwise some prototype manipulation in\n  // userland will fail\n  enumerable: false,\n  get: function get() {\n    return this._writableState.highWaterMark;\n  }\n}); // if we're already writing something, then just put this\n// in the queue, and wait our turn.  Otherwise, call _write\n// If we return false, then we need a drain event, so set that flag.\n\nfunction writeOrBuffer(stream, state, isBuf, chunk, encoding, cb) {\n  if (!isBuf) {\n    var newChunk = decodeChunk(state, chunk, encoding);\n\n    if (chunk !== newChunk) {\n      isBuf = true;\n      encoding = 'buffer';\n      chunk = newChunk;\n    }\n  }\n\n  var len = state.objectMode ? 1 : chunk.length;\n  state.length += len;\n  var ret = state.length < state.highWaterMark; // we must ensure that previous needDrain will not be reset to false.\n\n  if (!ret) state.needDrain = true;\n\n  if (state.writing || state.corked) {\n    var last = state.lastBufferedRequest;\n    state.lastBufferedRequest = {\n      chunk: chunk,\n      encoding: encoding,\n      isBuf: isBuf,\n      callback: cb,\n      next: null\n    };\n\n    if (last) {\n      last.next = state.lastBufferedRequest;\n    } else {\n      state.bufferedRequest = state.lastBufferedRequest;\n    }\n\n    state.bufferedRequestCount += 1;\n  } else {\n    doWrite(stream, state, false, len, chunk, encoding, cb);\n  }\n\n  return ret;\n}\n\nfunction doWrite(stream, state, writev, len, chunk, encoding, cb) {\n  state.writelen = len;\n  state.writecb = cb;\n  state.writing = true;\n  state.sync = true;\n  if (state.destroyed) state.onwrite(new ERR_STREAM_DESTROYED('write'));else if (writev) stream._writev(chunk, state.onwrite);else stream._write(chunk, encoding, state.onwrite);\n  state.sync = false;\n}\n\nfunction onwriteError(stream, state, sync, er, cb) {\n  --state.pendingcb;\n\n  if (sync) {\n    // defer the callback if we are being called synchronously\n    // to avoid piling up things on the stack\n    process.nextTick(cb, er); // this can emit finish, and it will always happen\n    // after error\n\n    process.nextTick(finishMaybe, stream, state);\n    stream._writableState.errorEmitted = true;\n    errorOrDestroy(stream, er);\n  } else {\n    // the caller expect this to happen before if\n    // it is async\n    cb(er);\n    stream._writableState.errorEmitted = true;\n    errorOrDestroy(stream, er); // this can emit finish, but finish must\n    // always follow error\n\n    finishMaybe(stream, state);\n  }\n}\n\nfunction onwriteStateUpdate(state) {\n  state.writing = false;\n  state.writecb = null;\n  state.length -= state.writelen;\n  state.writelen = 0;\n}\n\nfunction onwrite(stream, er) {\n  var state = stream._writableState;\n  var sync = state.sync;\n  var cb = state.writecb;\n  if (typeof cb !== 'function') throw new ERR_MULTIPLE_CALLBACK();\n  onwriteStateUpdate(state);\n  if (er) onwriteError(stream, state, sync, er, cb);else {\n    // Check if we're actually ready to finish, but don't emit yet\n    var finished = needFinish(state) || stream.destroyed;\n\n    if (!finished && !state.corked && !state.bufferProcessing && state.bufferedRequest) {\n      clearBuffer(stream, state);\n    }\n\n    if (sync) {\n      process.nextTick(afterWrite, stream, state, finished, cb);\n    } else {\n      afterWrite(stream, state, finished, cb);\n    }\n  }\n}\n\nfunction afterWrite(stream, state, finished, cb) {\n  if (!finished) onwriteDrain(stream, state);\n  state.pendingcb--;\n  cb();\n  finishMaybe(stream, state);\n} // Must force callback to be called on nextTick, so that we don't\n// emit 'drain' before the write() consumer gets the 'false' return\n// value, and has a chance to attach a 'drain' listener.\n\n\nfunction onwriteDrain(stream, state) {\n  if (state.length === 0 && state.needDrain) {\n    state.needDrain = false;\n    stream.emit('drain');\n  }\n} // if there's something in the buffer waiting, then process it\n\n\nfunction clearBuffer(stream, state) {\n  state.bufferProcessing = true;\n  var entry = state.bufferedRequest;\n\n  if (stream._writev && entry && entry.next) {\n    // Fast case, write everything using _writev()\n    var l = state.bufferedRequestCount;\n    var buffer = new Array(l);\n    var holder = state.corkedRequestsFree;\n    holder.entry = entry;\n    var count = 0;\n    var allBuffers = true;\n\n    while (entry) {\n      buffer[count] = entry;\n      if (!entry.isBuf) allBuffers = false;\n      entry = entry.next;\n      count += 1;\n    }\n\n    buffer.allBuffers = allBuffers;\n    doWrite(stream, state, true, state.length, buffer, '', holder.finish); // doWrite is almost always async, defer these to save a bit of time\n    // as the hot path ends with doWrite\n\n    state.pendingcb++;\n    state.lastBufferedRequest = null;\n\n    if (holder.next) {\n      state.corkedRequestsFree = holder.next;\n      holder.next = null;\n    } else {\n      state.corkedRequestsFree = new CorkedRequest(state);\n    }\n\n    state.bufferedRequestCount = 0;\n  } else {\n    // Slow case, write chunks one-by-one\n    while (entry) {\n      var chunk = entry.chunk;\n      var encoding = entry.encoding;\n      var cb = entry.callback;\n      var len = state.objectMode ? 1 : chunk.length;\n      doWrite(stream, state, false, len, chunk, encoding, cb);\n      entry = entry.next;\n      state.bufferedRequestCount--; // if we didn't call the onwrite immediately, then\n      // it means that we need to wait until it does.\n      // also, that means that the chunk and cb are currently\n      // being processed, so move the buffer counter past them.\n\n      if (state.writing) {\n        break;\n      }\n    }\n\n    if (entry === null) state.lastBufferedRequest = null;\n  }\n\n  state.bufferedRequest = entry;\n  state.bufferProcessing = false;\n}\n\nWritable.prototype._write = function (chunk, encoding, cb) {\n  cb(new ERR_METHOD_NOT_IMPLEMENTED('_write()'));\n};\n\nWritable.prototype._writev = null;\n\nWritable.prototype.end = function (chunk, encoding, cb) {\n  var state = this._writableState;\n\n  if (typeof chunk === 'function') {\n    cb = chunk;\n    chunk = null;\n    encoding = null;\n  } else if (typeof encoding === 'function') {\n    cb = encoding;\n    encoding = null;\n  }\n\n  if (chunk !== null && chunk !== undefined) this.write(chunk, encoding); // .end() fully uncorks\n\n  if (state.corked) {\n    state.corked = 1;\n    this.uncork();\n  } // ignore unnecessary end() calls.\n\n\n  if (!state.ending) endWritable(this, state, cb);\n  return this;\n};\n\nObject.defineProperty(Writable.prototype, 'writableLength', {\n  // making it explicit this property is not enumerable\n  // because otherwise some prototype manipulation in\n  // userland will fail\n  enumerable: false,\n  get: function get() {\n    return this._writableState.length;\n  }\n});\n\nfunction needFinish(state) {\n  return state.ending && state.length === 0 && state.bufferedRequest === null && !state.finished && !state.writing;\n}\n\nfunction callFinal(stream, state) {\n  stream._final(function (err) {\n    state.pendingcb--;\n\n    if (err) {\n      errorOrDestroy(stream, err);\n    }\n\n    state.prefinished = true;\n    stream.emit('prefinish');\n    finishMaybe(stream, state);\n  });\n}\n\nfunction prefinish(stream, state) {\n  if (!state.prefinished && !state.finalCalled) {\n    if (typeof stream._final === 'function' && !state.destroyed) {\n      state.pendingcb++;\n      state.finalCalled = true;\n      process.nextTick(callFinal, stream, state);\n    } else {\n      state.prefinished = true;\n      stream.emit('prefinish');\n    }\n  }\n}\n\nfunction finishMaybe(stream, state) {\n  var need = needFinish(state);\n\n  if (need) {\n    prefinish(stream, state);\n\n    if (state.pendingcb === 0) {\n      state.finished = true;\n      stream.emit('finish');\n\n      if (state.autoDestroy) {\n        // In case of duplex streams we need a way to detect\n        // if the readable side is ready for autoDestroy as well\n        var rState = stream._readableState;\n\n        if (!rState || rState.autoDestroy && rState.endEmitted) {\n          stream.destroy();\n        }\n      }\n    }\n  }\n\n  return need;\n}\n\nfunction endWritable(stream, state, cb) {\n  state.ending = true;\n  finishMaybe(stream, state);\n\n  if (cb) {\n    if (state.finished) process.nextTick(cb);else stream.once('finish', cb);\n  }\n\n  state.ended = true;\n  stream.writable = false;\n}\n\nfunction onCorkedFinish(corkReq, state, err) {\n  var entry = corkReq.entry;\n  corkReq.entry = null;\n\n  while (entry) {\n    var cb = entry.callback;\n    state.pendingcb--;\n    cb(err);\n    entry = entry.next;\n  } // reuse the free corkReq.\n\n\n  state.corkedRequestsFree.next = corkReq;\n}\n\nObject.defineProperty(Writable.prototype, 'destroyed', {\n  // making it explicit this property is not enumerable\n  // because otherwise some prototype manipulation in\n  // userland will fail\n  enumerable: false,\n  get: function get() {\n    if (this._writableState === undefined) {\n      return false;\n    }\n\n    return this._writableState.destroyed;\n  },\n  set: function set(value) {\n    // we ignore the value if the stream\n    // has not been initialized yet\n    if (!this._writableState) {\n      return;\n    } // backward compatibility, the user is explicitly\n    // managing destroyed\n\n\n    this._writableState.destroyed = value;\n  }\n});\nWritable.prototype.destroy = destroyImpl.destroy;\nWritable.prototype._undestroy = destroyImpl.undestroy;\n\nWritable.prototype._destroy = function (err, cb) {\n  cb(err);\n};","'use strict';\n\nvar _Object$setPrototypeO;\n\nfunction _defineProperty(obj, key, value) { if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }\n\nvar finished = require('./end-of-stream');\n\nvar kLastResolve = Symbol('lastResolve');\nvar kLastReject = Symbol('lastReject');\nvar kError = Symbol('error');\nvar kEnded = Symbol('ended');\nvar kLastPromise = Symbol('lastPromise');\nvar kHandlePromise = Symbol('handlePromise');\nvar kStream = Symbol('stream');\n\nfunction createIterResult(value, done) {\n  return {\n    value: value,\n    done: done\n  };\n}\n\nfunction readAndResolve(iter) {\n  var resolve = iter[kLastResolve];\n\n  if (resolve !== null) {\n    var data = iter[kStream].read(); // we defer if data is null\n    // we can be expecting either 'end' or\n    // 'error'\n\n    if (data !== null) {\n      iter[kLastPromise] = null;\n      iter[kLastResolve] = null;\n      iter[kLastReject] = null;\n      resolve(createIterResult(data, false));\n    }\n  }\n}\n\nfunction onReadable(iter) {\n  // we wait for the next tick, because it might\n  // emit an error with process.nextTick\n  process.nextTick(readAndResolve, iter);\n}\n\nfunction wrapForNext(lastPromise, iter) {\n  return function (resolve, reject) {\n    lastPromise.then(function () {\n      if (iter[kEnded]) {\n        resolve(createIterResult(undefined, true));\n        return;\n      }\n\n      iter[kHandlePromise](resolve, reject);\n    }, reject);\n  };\n}\n\nvar AsyncIteratorPrototype = Object.getPrototypeOf(function () {});\nvar ReadableStreamAsyncIteratorPrototype = Object.setPrototypeOf((_Object$setPrototypeO = {\n  get stream() {\n    return this[kStream];\n  },\n\n  next: function next() {\n    var _this = this;\n\n    // if we have detected an error in the meanwhile\n    // reject straight away\n    var error = this[kError];\n\n    if (error !== null) {\n      return Promise.reject(error);\n    }\n\n    if (this[kEnded]) {\n      return Promise.resolve(createIterResult(undefined, true));\n    }\n\n    if (this[kStream].destroyed) {\n      // We need to defer via nextTick because if .destroy(err) is\n      // called, the error will be emitted via nextTick, and\n      // we cannot guarantee that there is no error lingering around\n      // waiting to be emitted.\n      return new Promise(function (resolve, reject) {\n        process.nextTick(function () {\n          if (_this[kError]) {\n            reject(_this[kError]);\n          } else {\n            resolve(createIterResult(undefined, true));\n          }\n        });\n      });\n    } // if we have multiple next() calls\n    // we will wait for the previous Promise to finish\n    // this logic is optimized to support for await loops,\n    // where next() is only called once at a time\n\n\n    var lastPromise = this[kLastPromise];\n    var promise;\n\n    if (lastPromise) {\n      promise = new Promise(wrapForNext(lastPromise, this));\n    } else {\n      // fast path needed to support multiple this.push()\n      // without triggering the next() queue\n      var data = this[kStream].read();\n\n      if (data !== null) {\n        return Promise.resolve(createIterResult(data, false));\n      }\n\n      promise = new Promise(this[kHandlePromise]);\n    }\n\n    this[kLastPromise] = promise;\n    return promise;\n  }\n}, _defineProperty(_Object$setPrototypeO, Symbol.asyncIterator, function () {\n  return this;\n}), _defineProperty(_Object$setPrototypeO, \"return\", function _return() {\n  var _this2 = this;\n\n  // destroy(err, cb) is a private API\n  // we can guarantee we have that here, because we control the\n  // Readable class this is attached to\n  return new Promise(function (resolve, reject) {\n    _this2[kStream].destroy(null, function (err) {\n      if (err) {\n        reject(err);\n        return;\n      }\n\n      resolve(createIterResult(undefined, true));\n    });\n  });\n}), _Object$setPrototypeO), AsyncIteratorPrototype);\n\nvar createReadableStreamAsyncIterator = function createReadableStreamAsyncIterator(stream) {\n  var _Object$create;\n\n  var iterator = Object.create(ReadableStreamAsyncIteratorPrototype, (_Object$create = {}, _defineProperty(_Object$create, kStream, {\n    value: stream,\n    writable: true\n  }), _defineProperty(_Object$create, kLastResolve, {\n    value: null,\n    writable: true\n  }), _defineProperty(_Object$create, kLastReject, {\n    value: null,\n    writable: true\n  }), _defineProperty(_Object$create, kError, {\n    value: null,\n    writable: true\n  }), _defineProperty(_Object$create, kEnded, {\n    value: stream._readableState.endEmitted,\n    writable: true\n  }), _defineProperty(_Object$create, kHandlePromise, {\n    value: function value(resolve, reject) {\n      var data = iterator[kStream].read();\n\n      if (data) {\n        iterator[kLastPromise] = null;\n        iterator[kLastResolve] = null;\n        iterator[kLastReject] = null;\n        resolve(createIterResult(data, false));\n      } else {\n        iterator[kLastResolve] = resolve;\n        iterator[kLastReject] = reject;\n      }\n    },\n    writable: true\n  }), _Object$create));\n  iterator[kLastPromise] = null;\n  finished(stream, function (err) {\n    if (err && err.code !== 'ERR_STREAM_PREMATURE_CLOSE') {\n      var reject = iterator[kLastReject]; // reject if we are waiting for data in the Promise\n      // returned by next() and store the error\n\n      if (reject !== null) {\n        iterator[kLastPromise] = null;\n        iterator[kLastResolve] = null;\n        iterator[kLastReject] = null;\n        reject(err);\n      }\n\n      iterator[kError] = err;\n      return;\n    }\n\n    var resolve = iterator[kLastResolve];\n\n    if (resolve !== null) {\n      iterator[kLastPromise] = null;\n      iterator[kLastResolve] = null;\n      iterator[kLastReject] = null;\n      resolve(createIterResult(undefined, true));\n    }\n\n    iterator[kEnded] = true;\n  });\n  stream.on('readable', onReadable.bind(null, iterator));\n  return iterator;\n};\n\nmodule.exports = createReadableStreamAsyncIterator;","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n// a duplex stream is just a stream that is both readable and writable.\n// Since JS doesn't have multiple prototypal inheritance, this class\n// prototypally inherits from Readable, and then parasitically from\n// Writable.\n'use strict';\n/*<replacement>*/\n\nvar objectKeys = Object.keys || function (obj) {\n  var keys = [];\n\n  for (var key in obj) {\n    keys.push(key);\n  }\n\n  return keys;\n};\n/*</replacement>*/\n\n\nmodule.exports = Duplex;\n\nvar Readable = require('./_stream_readable');\n\nvar Writable = require('./_stream_writable');\n\nrequire('inherits')(Duplex, Readable);\n\n{\n  // Allow the keys array to be GC'ed.\n  var keys = objectKeys(Writable.prototype);\n\n  for (var v = 0; v < keys.length; v++) {\n    var method = keys[v];\n    if (!Duplex.prototype[method]) Duplex.prototype[method] = Writable.prototype[method];\n  }\n}\n\nfunction Duplex(options) {\n  if (!(this instanceof Duplex)) return new Duplex(options);\n  Readable.call(this, options);\n  Writable.call(this, options);\n  this.allowHalfOpen = true;\n\n  if (options) {\n    if (options.readable === false) this.readable = false;\n    if (options.writable === false) this.writable = false;\n\n    if (options.allowHalfOpen === false) {\n      this.allowHalfOpen = false;\n      this.once('end', onend);\n    }\n  }\n}\n\nObject.defineProperty(Duplex.prototype, 'writableHighWaterMark', {\n  // making it explicit this property is not enumerable\n  // because otherwise some prototype manipulation in\n  // userland will fail\n  enumerable: false,\n  get: function get() {\n    return this._writableState.highWaterMark;\n  }\n});\nObject.defineProperty(Duplex.prototype, 'writableBuffer', {\n  // making it explicit this property is not enumerable\n  // because otherwise some prototype manipulation in\n  // userland will fail\n  enumerable: false,\n  get: function get() {\n    return this._writableState && this._writableState.getBuffer();\n  }\n});\nObject.defineProperty(Duplex.prototype, 'writableLength', {\n  // making it explicit this property is not enumerable\n  // because otherwise some prototype manipulation in\n  // userland will fail\n  enumerable: false,\n  get: function get() {\n    return this._writableState.length;\n  }\n}); // the no-half-open enforcer\n\nfunction onend() {\n  // If the writable side ended, then we're ok.\n  if (this._writableState.ended) return; // no more data can be written.\n  // But allow more writes to happen in this tick.\n\n  process.nextTick(onEndNT, this);\n}\n\nfunction onEndNT(self) {\n  self.end();\n}\n\nObject.defineProperty(Duplex.prototype, 'destroyed', {\n  // making it explicit this property is not enumerable\n  // because otherwise some prototype manipulation in\n  // userland will fail\n  enumerable: false,\n  get: function get() {\n    if (this._readableState === undefined || this._writableState === undefined) {\n      return false;\n    }\n\n    return this._readableState.destroyed && this._writableState.destroyed;\n  },\n  set: function set(value) {\n    // we ignore the value if the stream\n    // has not been initialized yet\n    if (this._readableState === undefined || this._writableState === undefined) {\n      return;\n    } // backward compatibility, the user is explicitly\n    // managing destroyed\n\n\n    this._readableState.destroyed = value;\n    this._writableState.destroyed = value;\n  }\n});","// much of this based on https://github.com/indutny/self-signed/blob/gh-pages/lib/rsa.js\nvar Buffer = require('buffer').Buffer\nvar createHmac = require('create-hmac')\nvar crt = require('browserify-rsa')\nvar EC = require('elliptic').ec\nvar BN = require('bn.js')\nvar parseKeys = require('parse-asn1')\nvar curves = require('./curves.json')\n\nfunction sign (hash, key, hashType, signType, tag) {\n  var priv = parseKeys(key)\n  if (priv.curve) {\n    // rsa keys can be interpreted as ecdsa ones in openssl\n    if (signType !== 'ecdsa' && signType !== 'ecdsa/rsa') throw new Error('wrong private key type')\n    return ecSign(hash, priv)\n  } else if (priv.type === 'dsa') {\n    if (signType !== 'dsa') throw new Error('wrong private key type')\n    return dsaSign(hash, priv, hashType)\n  } else {\n    if (signType !== 'rsa' && signType !== 'ecdsa/rsa') throw new Error('wrong private key type')\n  }\n  hash = Buffer.concat([tag, hash])\n  var len = priv.modulus.byteLength()\n  var pad = [0, 1]\n  while (hash.length + pad.length + 1 < len) pad.push(0xff)\n  pad.push(0x00)\n  var i = -1\n  while (++i < hash.length) pad.push(hash[i])\n\n  var out = crt(pad, priv)\n  return out\n}\n\nfunction ecSign (hash, priv) {\n  var curveId = curves[priv.curve.join('.')]\n  if (!curveId) throw new Error('unknown curve ' + priv.curve.join('.'))\n\n  var curve = new EC(curveId)\n  var key = curve.keyFromPrivate(priv.privateKey)\n  var out = key.sign(hash)\n\n  return Buffer.from(out.toDER())\n}\n\nfunction dsaSign (hash, priv, algo) {\n  var x = priv.params.priv_key\n  var p = priv.params.p\n  var q = priv.params.q\n  var g = priv.params.g\n  var r = new BN(0)\n  var k\n  var H = bits2int(hash, q).mod(q)\n  var s = false\n  var kv = getKey(x, q, hash, algo)\n  while (s === false) {\n    k = makeKey(q, kv, algo)\n    r = makeR(g, k, p, q)\n    s = k.invm(q).imul(H.add(x.mul(r))).mod(q)\n    if (s.cmpn(0) === 0) {\n      s = false\n      r = new BN(0)\n    }\n  }\n  return toDER(r, s)\n}\n\nfunction toDER (r, s) {\n  r = r.toArray()\n  s = s.toArray()\n\n  // Pad values\n  if (r[0] & 0x80) r = [0].concat(r)\n  if (s[0] & 0x80) s = [0].concat(s)\n\n  var total = r.length + s.length + 4\n  var res = [0x30, total, 0x02, r.length]\n  res = res.concat(r, [0x02, s.length], s)\n  return Buffer.from(res)\n}\n\nfunction getKey (x, q, hash, algo) {\n  x = Buffer.from(x.toArray())\n  if (x.length < q.byteLength()) {\n    var zeros = Buffer.alloc(q.byteLength() - x.length)\n    x = Buffer.concat([zeros, x])\n  }\n  var hlen = hash.length\n  var hbits = bits2octets(hash, q)\n  var v = Buffer.alloc(hlen)\n  v.fill(1)\n  var k = Buffer.alloc(hlen)\n  k = createHmac(algo, k).update(v).update(Buffer.from([0])).update(x).update(hbits).digest()\n  v = createHmac(algo, k).update(v).digest()\n  k = createHmac(algo, k).update(v).update(Buffer.from([1])).update(x).update(hbits).digest()\n  v = createHmac(algo, k).update(v).digest()\n  return { k: k, v: v }\n}\n\nfunction bits2int (obits, q) {\n  var bits = new BN(obits)\n  var shift = (obits.length << 3) - q.bitLength()\n  if (shift > 0) bits.ishrn(shift)\n  return bits\n}\n\nfunction bits2octets (bits, q) {\n  bits = bits2int(bits, q)\n  bits = bits.mod(q)\n  var out = Buffer.from(bits.toArray())\n  if (out.length < q.byteLength()) {\n    var zeros = Buffer.alloc(q.byteLength() - out.length)\n    out = Buffer.concat([zeros, out])\n  }\n  return out\n}\n\nfunction makeKey (q, kv, algo) {\n  var t\n  var k\n\n  do {\n    t = Buffer.alloc(0)\n\n    while (t.length * 8 < q.bitLength()) {\n      kv.v = createHmac(algo, kv.k).update(kv.v).digest()\n      t = Buffer.concat([t, kv.v])\n    }\n\n    k = bits2int(t, q)\n    kv.k = createHmac(algo, kv.k).update(kv.v).update(Buffer.from([0])).digest()\n    kv.v = createHmac(algo, kv.k).update(kv.v).digest()\n  } while (k.cmp(q) !== -1)\n\n  return k\n}\n\nfunction makeR (g, k, p, q) {\n  return g.toRed(BN.mont(p)).redPow(k).fromRed().mod(q)\n}\n\nmodule.exports = sign\nmodule.exports.getKey = getKey\nmodule.exports.makeKey = makeKey\n","module.exports = function xor (a, b) {\n  var length = Math.min(a.length, b.length)\n  var buffer = new Buffer(length)\n\n  for (var i = 0; i < length; ++i) {\n    buffer[i] = a[i] ^ b[i]\n  }\n\n  return buffer\n}\n","'use strict'; // undocumented cb() API, needed for core, not for public API\n\nfunction destroy(err, cb) {\n  var _this = this;\n\n  var readableDestroyed = this._readableState && this._readableState.destroyed;\n  var writableDestroyed = this._writableState && this._writableState.destroyed;\n\n  if (readableDestroyed || writableDestroyed) {\n    if (cb) {\n      cb(err);\n    } else if (err) {\n      if (!this._writableState) {\n        process.nextTick(emitErrorNT, this, err);\n      } else if (!this._writableState.errorEmitted) {\n        this._writableState.errorEmitted = true;\n        process.nextTick(emitErrorNT, this, err);\n      }\n    }\n\n    return this;\n  } // we set destroyed to true before firing error callbacks in order\n  // to make it re-entrance safe in case destroy() is called within callbacks\n\n\n  if (this._readableState) {\n    this._readableState.destroyed = true;\n  } // if this is a duplex stream mark the writable part as destroyed as well\n\n\n  if (this._writableState) {\n    this._writableState.destroyed = true;\n  }\n\n  this._destroy(err || null, function (err) {\n    if (!cb && err) {\n      if (!_this._writableState) {\n        process.nextTick(emitErrorAndCloseNT, _this, err);\n      } else if (!_this._writableState.errorEmitted) {\n        _this._writableState.errorEmitted = true;\n        process.nextTick(emitErrorAndCloseNT, _this, err);\n      } else {\n        process.nextTick(emitCloseNT, _this);\n      }\n    } else if (cb) {\n      process.nextTick(emitCloseNT, _this);\n      cb(err);\n    } else {\n      process.nextTick(emitCloseNT, _this);\n    }\n  });\n\n  return this;\n}\n\nfunction emitErrorAndCloseNT(self, err) {\n  emitErrorNT(self, err);\n  emitCloseNT(self);\n}\n\nfunction emitCloseNT(self) {\n  if (self._writableState && !self._writableState.emitClose) return;\n  if (self._readableState && !self._readableState.emitClose) return;\n  self.emit('close');\n}\n\nfunction undestroy() {\n  if (this._readableState) {\n    this._readableState.destroyed = false;\n    this._readableState.reading = false;\n    this._readableState.ended = false;\n    this._readableState.endEmitted = false;\n  }\n\n  if (this._writableState) {\n    this._writableState.destroyed = false;\n    this._writableState.ended = false;\n    this._writableState.ending = false;\n    this._writableState.finalCalled = false;\n    this._writableState.prefinished = false;\n    this._writableState.finished = false;\n    this._writableState.errorEmitted = false;\n  }\n}\n\nfunction emitErrorNT(self, err) {\n  self.emit('error', err);\n}\n\nfunction errorOrDestroy(stream, err) {\n  // We have tests that rely on errors being emitted\n  // in the same tick, so changing this is semver major.\n  // For now when you opt-in to autoDestroy we allow\n  // the error to be emitted nextTick. In a future\n  // semver major update we should change the default to this.\n  var rState = stream._readableState;\n  var wState = stream._writableState;\n  if (rState && rState.autoDestroy || wState && wState.autoDestroy) stream.destroy(err);else stream.emit('error', err);\n}\n\nmodule.exports = {\n  destroy: destroy,\n  undestroy: undestroy,\n  errorOrDestroy: errorOrDestroy\n};","// much of this based on https://github.com/indutny/self-signed/blob/gh-pages/lib/rsa.js\nvar Buffer = require('buffer').Buffer\nvar BN = require('bn.js')\nvar EC = require('elliptic').ec\nvar parseKeys = require('parse-asn1')\nvar curves = require('./curves.json')\n\nfunction verify (sig, hash, key, signType, tag) {\n  var pub = parseKeys(key)\n  if (pub.type === 'ec') {\n    // rsa keys can be interpreted as ecdsa ones in openssl\n    if (signType !== 'ecdsa' && signType !== 'ecdsa/rsa') throw new Error('wrong public key type')\n    return ecVerify(sig, hash, pub)\n  } else if (pub.type === 'dsa') {\n    if (signType !== 'dsa') throw new Error('wrong public key type')\n    return dsaVerify(sig, hash, pub)\n  } else {\n    if (signType !== 'rsa' && signType !== 'ecdsa/rsa') throw new Error('wrong public key type')\n  }\n  hash = Buffer.concat([tag, hash])\n  var len = pub.modulus.byteLength()\n  var pad = [1]\n  var padNum = 0\n  while (hash.length + pad.length + 2 < len) {\n    pad.push(0xff)\n    padNum++\n  }\n  pad.push(0x00)\n  var i = -1\n  while (++i < hash.length) {\n    pad.push(hash[i])\n  }\n  pad = Buffer.from(pad)\n  var red = BN.mont(pub.modulus)\n  sig = new BN(sig).toRed(red)\n\n  sig = sig.redPow(new BN(pub.publicExponent))\n  sig = Buffer.from(sig.fromRed().toArray())\n  var out = padNum < 8 ? 1 : 0\n  len = Math.min(sig.length, pad.length)\n  if (sig.length !== pad.length) out = 1\n\n  i = -1\n  while (++i < len) out |= sig[i] ^ pad[i]\n  return out === 0\n}\n\nfunction ecVerify (sig, hash, pub) {\n  var curveId = curves[pub.data.algorithm.curve.join('.')]\n  if (!curveId) throw new Error('unknown curve ' + pub.data.algorithm.curve.join('.'))\n\n  var curve = new EC(curveId)\n  var pubkey = pub.data.subjectPrivateKey.data\n\n  return curve.verify(hash, sig, pubkey)\n}\n\nfunction dsaVerify (sig, hash, pub) {\n  var p = pub.data.p\n  var q = pub.data.q\n  var g = pub.data.g\n  var y = pub.data.pub_key\n  var unpacked = parseKeys.signature.decode(sig, 'der')\n  var s = unpacked.s\n  var r = unpacked.r\n  checkValue(s, q)\n  checkValue(r, q)\n  var montp = BN.mont(p)\n  var w = s.invm(q)\n  var v = g.toRed(montp)\n    .redPow(new BN(hash).mul(w).mod(q))\n    .fromRed()\n    .mul(y.toRed(montp).redPow(r.mul(w).mod(q)).fromRed())\n    .mod(p)\n    .mod(q)\n  return v.cmp(r) === 0\n}\n\nfunction checkValue (b, q) {\n  if (b.cmpn(0) <= 0) throw new Error('invalid sig')\n  if (b.cmp(q) >= q) throw new Error('invalid sig')\n}\n\nmodule.exports = verify\n","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n// a passthrough stream.\n// basically just the most minimal sort of Transform stream.\n// Every written chunk gets output as-is.\n'use strict';\n\nmodule.exports = PassThrough;\n\nvar Transform = require('./_stream_transform');\n\nrequire('inherits')(PassThrough, Transform);\n\nfunction PassThrough(options) {\n  if (!(this instanceof PassThrough)) return new PassThrough(options);\n  Transform.call(this, options);\n}\n\nPassThrough.prototype._transform = function (chunk, encoding, cb) {\n  cb(null, chunk);\n};","// Ported from https://github.com/mafintosh/pump with\n// permission from the author, Mathias Buus (@mafintosh).\n'use strict';\n\nvar eos;\n\nfunction once(callback) {\n  var called = false;\n  return function () {\n    if (called) return;\n    called = true;\n    callback.apply(void 0, arguments);\n  };\n}\n\nvar _require$codes = require('../../../errors').codes,\n    ERR_MISSING_ARGS = _require$codes.ERR_MISSING_ARGS,\n    ERR_STREAM_DESTROYED = _require$codes.ERR_STREAM_DESTROYED;\n\nfunction noop(err) {\n  // Rethrow the error if it exists to avoid swallowing it\n  if (err) throw err;\n}\n\nfunction isRequest(stream) {\n  return stream.setHeader && typeof stream.abort === 'function';\n}\n\nfunction destroyer(stream, reading, writing, callback) {\n  callback = once(callback);\n  var closed = false;\n  stream.on('close', function () {\n    closed = true;\n  });\n  if (eos === undefined) eos = require('./end-of-stream');\n  eos(stream, {\n    readable: reading,\n    writable: writing\n  }, function (err) {\n    if (err) return callback(err);\n    closed = true;\n    callback();\n  });\n  var destroyed = false;\n  return function (err) {\n    if (closed) return;\n    if (destroyed) return;\n    destroyed = true; // request.destroy just do .end - .abort is what we want\n\n    if (isRequest(stream)) return stream.abort();\n    if (typeof stream.destroy === 'function') return stream.destroy();\n    callback(err || new ERR_STREAM_DESTROYED('pipe'));\n  };\n}\n\nfunction call(fn) {\n  fn();\n}\n\nfunction pipe(from, to) {\n  return from.pipe(to);\n}\n\nfunction popCallback(streams) {\n  if (!streams.length) return noop;\n  if (typeof streams[streams.length - 1] !== 'function') return noop;\n  return streams.pop();\n}\n\nfunction pipeline() {\n  for (var _len = arguments.length, streams = new Array(_len), _key = 0; _key < _len; _key++) {\n    streams[_key] = arguments[_key];\n  }\n\n  var callback = popCallback(streams);\n  if (Array.isArray(streams[0])) streams = streams[0];\n\n  if (streams.length < 2) {\n    throw new ERR_MISSING_ARGS('streams');\n  }\n\n  var error;\n  var destroys = streams.map(function (stream, i) {\n    var reading = i < streams.length - 1;\n    var writing = i > 0;\n    return destroyer(stream, reading, writing, function (err) {\n      if (!error) error = err;\n      if (err) destroys.forEach(call);\n      if (reading) return;\n      destroys.forEach(call);\n      callback(error);\n    });\n  });\n  return streams.reduce(pipe);\n}\n\nmodule.exports = pipeline;","/*jshint node:true */\n'use strict';\nvar Buffer = require('buffer').Buffer; // browserify\nvar SlowBuffer = require('buffer').SlowBuffer;\n\nmodule.exports = bufferEq;\n\nfunction bufferEq(a, b) {\n\n  // shortcutting on type is necessary for correctness\n  if (!Buffer.isBuffer(a) || !Buffer.isBuffer(b)) {\n    return false;\n  }\n\n  // buffer sizes should be well-known information, so despite this\n  // shortcutting, it doesn't leak any information about the *contents* of the\n  // buffers.\n  if (a.length !== b.length) {\n    return false;\n  }\n\n  var c = 0;\n  for (var i = 0; i < a.length; i++) {\n    /*jshint bitwise:false */\n    c |= a[i] ^ b[i]; // XOR\n  }\n  return c === 0;\n}\n\nbufferEq.install = function() {\n  Buffer.prototype.equal = SlowBuffer.prototype.equal = function equal(that) {\n    return bufferEq(this, that);\n  };\n};\n\nvar origBufEqual = Buffer.prototype.equal;\nvar origSlowBufEqual = SlowBuffer.prototype.equal;\nbufferEq.restore = function() {\n  Buffer.prototype.equal = origBufEqual;\n  SlowBuffer.prototype.equal = origSlowBufEqual;\n};\n","var Buffer = require('buffer').Buffer\nvar createHash = require('create-hash')\nvar stream = require('readable-stream')\nvar inherits = require('inherits')\nvar sign = require('./sign')\nvar verify = require('./verify')\n\nvar algorithms = require('./algorithms.json')\nObject.keys(algorithms).forEach(function (key) {\n  algorithms[key].id = Buffer.from(algorithms[key].id, 'hex')\n  algorithms[key.toLowerCase()] = algorithms[key]\n})\n\nfunction Sign (algorithm) {\n  stream.Writable.call(this)\n\n  var data = algorithms[algorithm]\n  if (!data) throw new Error('Unknown message digest')\n\n  this._hashType = data.hash\n  this._hash = createHash(data.hash)\n  this._tag = data.id\n  this._signType = data.sign\n}\ninherits(Sign, stream.Writable)\n\nSign.prototype._write = function _write (data, _, done) {\n  this._hash.update(data)\n  done()\n}\n\nSign.prototype.update = function update (data, enc) {\n  if (typeof data === 'string') data = Buffer.from(data, enc)\n\n  this._hash.update(data)\n  return this\n}\n\nSign.prototype.sign = function signMethod (key, enc) {\n  this.end()\n  var hash = this._hash.digest()\n  var sig = sign(hash, key, this._hashType, this._signType, this._tag)\n\n  return enc ? sig.toString(enc) : sig\n}\n\nfunction Verify (algorithm) {\n  stream.Writable.call(this)\n\n  var data = algorithms[algorithm]\n  if (!data) throw new Error('Unknown message digest')\n\n  this._hash = createHash(data.hash)\n  this._tag = data.id\n  this._signType = data.sign\n}\ninherits(Verify, stream.Writable)\n\nVerify.prototype._write = function _write (data, _, done) {\n  this._hash.update(data)\n  done()\n}\n\nVerify.prototype.update = function update (data, enc) {\n  if (typeof data === 'string') data = Buffer.from(data, enc)\n\n  this._hash.update(data)\n  return this\n}\n\nVerify.prototype.verify = function verifyMethod (key, sig, enc) {\n  if (typeof sig === 'string') sig = Buffer.from(sig, enc)\n\n  this.end()\n  var hash = this._hash.digest()\n  return verify(sig, hash, key, this._signType, this._tag)\n}\n\nfunction createSign (algorithm) {\n  return new Sign(algorithm)\n}\n\nfunction createVerify (algorithm) {\n  return new Verify(algorithm)\n}\n\nmodule.exports = {\n  Sign: createSign,\n  Verify: createVerify,\n  createSign: createSign,\n  createVerify: createVerify\n}\n","(function (module, exports) {\n  'use strict';\n\n  // Utils\n  function assert (val, msg) {\n    if (!val) throw new Error(msg || 'Assertion failed');\n  }\n\n  // Could use `inherits` module, but don't want to move from single file\n  // architecture yet.\n  function inherits (ctor, superCtor) {\n    ctor.super_ = superCtor;\n    var TempCtor = function () {};\n    TempCtor.prototype = superCtor.prototype;\n    ctor.prototype = new TempCtor();\n    ctor.prototype.constructor = ctor;\n  }\n\n  // BN\n\n  function BN (number, base, endian) {\n    if (BN.isBN(number)) {\n      return number;\n    }\n\n    this.negative = 0;\n    this.words = null;\n    this.length = 0;\n\n    // Reduction context\n    this.red = null;\n\n    if (number !== null) {\n      if (base === 'le' || base === 'be') {\n        endian = base;\n        base = 10;\n      }\n\n      this._init(number || 0, base || 10, endian || 'be');\n    }\n  }\n  if (typeof module === 'object') {\n    module.exports = BN;\n  } else {\n    exports.BN = BN;\n  }\n\n  BN.BN = BN;\n  BN.wordSize = 26;\n\n  var Buffer;\n  try {\n    Buffer = require('buffer').Buffer;\n  } catch (e) {\n  }\n\n  BN.isBN = function isBN (num) {\n    if (num instanceof BN) {\n      return true;\n    }\n\n    return num !== null && typeof num === 'object' &&\n      num.constructor.wordSize === BN.wordSize && Array.isArray(num.words);\n  };\n\n  BN.max = function max (left, right) {\n    if (left.cmp(right) > 0) return left;\n    return right;\n  };\n\n  BN.min = function min (left, right) {\n    if (left.cmp(right) < 0) return left;\n    return right;\n  };\n\n  BN.prototype._init = function init (number, base, endian) {\n    if (typeof number === 'number') {\n      return this._initNumber(number, base, endian);\n    }\n\n    if (typeof number === 'object') {\n      return this._initArray(number, base, endian);\n    }\n\n    if (base === 'hex') {\n      base = 16;\n    }\n    assert(base === (base | 0) && base >= 2 && base <= 36);\n\n    number = number.toString().replace(/\\s+/g, '');\n    var start = 0;\n    if (number[0] === '-') {\n      start++;\n    }\n\n    if (base === 16) {\n      this._parseHex(number, start);\n    } else {\n      this._parseBase(number, base, start);\n    }\n\n    if (number[0] === '-') {\n      this.negative = 1;\n    }\n\n    this._strip();\n\n    if (endian !== 'le') return;\n\n    this._initArray(this.toArray(), base, endian);\n  };\n\n  BN.prototype._initNumber = function _initNumber (number, base, endian) {\n    if (number < 0) {\n      this.negative = 1;\n      number = -number;\n    }\n    if (number < 0x4000000) {\n      this.words = [number & 0x3ffffff];\n      this.length = 1;\n    } else if (number < 0x10000000000000) {\n      this.words = [\n        number & 0x3ffffff,\n        (number / 0x4000000) & 0x3ffffff\n      ];\n      this.length = 2;\n    } else {\n      assert(number < 0x20000000000000); // 2 ^ 53 (unsafe)\n      this.words = [\n        number & 0x3ffffff,\n        (number / 0x4000000) & 0x3ffffff,\n        1\n      ];\n      this.length = 3;\n    }\n\n    if (endian !== 'le') return;\n\n    // Reverse the bytes\n    this._initArray(this.toArray(), base, endian);\n  };\n\n  BN.prototype._initArray = function _initArray (number, base, endian) {\n    // Perhaps a Uint8Array\n    assert(typeof number.length === 'number');\n    if (number.length <= 0) {\n      this.words = [0];\n      this.length = 1;\n      return this;\n    }\n\n    this.length = Math.ceil(number.length / 3);\n    this.words = new Array(this.length);\n    for (var i = 0; i < this.length; i++) {\n      this.words[i] = 0;\n    }\n\n    var j, w;\n    var off = 0;\n    if (endian === 'be') {\n      for (i = number.length - 1, j = 0; i >= 0; i -= 3) {\n        w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16);\n        this.words[j] |= (w << off) & 0x3ffffff;\n        this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff;\n        off += 24;\n        if (off >= 26) {\n          off -= 26;\n          j++;\n        }\n      }\n    } else if (endian === 'le') {\n      for (i = 0, j = 0; i < number.length; i += 3) {\n        w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16);\n        this.words[j] |= (w << off) & 0x3ffffff;\n        this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff;\n        off += 24;\n        if (off >= 26) {\n          off -= 26;\n          j++;\n        }\n      }\n    }\n    return this._strip();\n  };\n\n  function parseHex (str, start, end) {\n    var r = 0;\n    var len = Math.min(str.length, end);\n    var z = 0;\n    for (var i = start; i < len; i++) {\n      var c = str.charCodeAt(i) - 48;\n\n      r <<= 4;\n\n      var b;\n\n      // 'a' - 'f'\n      if (c >= 49 && c <= 54) {\n        b = c - 49 + 0xa;\n\n      // 'A' - 'F'\n      } else if (c >= 17 && c <= 22) {\n        b = c - 17 + 0xa;\n\n      // '0' - '9'\n      } else {\n        b = c;\n      }\n\n      r |= b;\n      z |= b;\n    }\n\n    assert(!(z & 0xf0), 'Invalid character in ' + str);\n    return r;\n  }\n\n  BN.prototype._parseHex = function _parseHex (number, start) {\n    // Create possibly bigger array to ensure that it fits the number\n    this.length = Math.ceil((number.length - start) / 6);\n    this.words = new Array(this.length);\n    for (var i = 0; i < this.length; i++) {\n      this.words[i] = 0;\n    }\n\n    var j, w;\n    // Scan 24-bit chunks and add them to the number\n    var off = 0;\n    for (i = number.length - 6, j = 0; i >= start; i -= 6) {\n      w = parseHex(number, i, i + 6);\n      this.words[j] |= (w << off) & 0x3ffffff;\n      // NOTE: `0x3fffff` is intentional here, 26bits max shift + 24bit hex limb\n      this.words[j + 1] |= w >>> (26 - off) & 0x3fffff;\n      off += 24;\n      if (off >= 26) {\n        off -= 26;\n        j++;\n      }\n    }\n    if (i + 6 !== start) {\n      w = parseHex(number, start, i + 6);\n      this.words[j] |= (w << off) & 0x3ffffff;\n      this.words[j + 1] |= w >>> (26 - off) & 0x3fffff;\n    }\n    this._strip();\n  };\n\n  function parseBase (str, start, end, mul) {\n    var r = 0;\n    var b = 0;\n    var len = Math.min(str.length, end);\n    for (var i = start; i < len; i++) {\n      var c = str.charCodeAt(i) - 48;\n\n      r *= mul;\n\n      // 'a'\n      if (c >= 49) {\n        b = c - 49 + 0xa;\n\n      // 'A'\n      } else if (c >= 17) {\n        b = c - 17 + 0xa;\n\n      // '0' - '9'\n      } else {\n        b = c;\n      }\n      assert(c >= 0 && b < mul, 'Invalid character');\n      r += b;\n    }\n    return r;\n  }\n\n  BN.prototype._parseBase = function _parseBase (number, base, start) {\n    // Initialize as zero\n    this.words = [0];\n    this.length = 1;\n\n    // Find length of limb in base\n    for (var limbLen = 0, limbPow = 1; limbPow <= 0x3ffffff; limbPow *= base) {\n      limbLen++;\n    }\n    limbLen--;\n    limbPow = (limbPow / base) | 0;\n\n    var total = number.length - start;\n    var mod = total % limbLen;\n    var end = Math.min(total, total - mod) + start;\n\n    var word = 0;\n    for (var i = start; i < end; i += limbLen) {\n      word = parseBase(number, i, i + limbLen, base);\n\n      this.imuln(limbPow);\n      if (this.words[0] + word < 0x4000000) {\n        this.words[0] += word;\n      } else {\n        this._iaddn(word);\n      }\n    }\n\n    if (mod !== 0) {\n      var pow = 1;\n      word = parseBase(number, i, number.length, base);\n\n      for (i = 0; i < mod; i++) {\n        pow *= base;\n      }\n\n      this.imuln(pow);\n      if (this.words[0] + word < 0x4000000) {\n        this.words[0] += word;\n      } else {\n        this._iaddn(word);\n      }\n    }\n  };\n\n  BN.prototype.copy = function copy (dest) {\n    dest.words = new Array(this.length);\n    for (var i = 0; i < this.length; i++) {\n      dest.words[i] = this.words[i];\n    }\n    dest.length = this.length;\n    dest.negative = this.negative;\n    dest.red = this.red;\n  };\n\n  function move (dest, src) {\n    dest.words = src.words;\n    dest.length = src.length;\n    dest.negative = src.negative;\n    dest.red = src.red;\n  }\n\n  BN.prototype._move = function _move (dest) {\n    move(dest, this);\n  };\n\n  BN.prototype.clone = function clone () {\n    var r = new BN(null);\n    this.copy(r);\n    return r;\n  };\n\n  BN.prototype._expand = function _expand (size) {\n    while (this.length < size) {\n      this.words[this.length++] = 0;\n    }\n    return this;\n  };\n\n  // Remove leading `0` from `this`\n  BN.prototype._strip = function strip () {\n    while (this.length > 1 && this.words[this.length - 1] === 0) {\n      this.length--;\n    }\n    return this._normSign();\n  };\n\n  BN.prototype._normSign = function _normSign () {\n    // -0 = 0\n    if (this.length === 1 && this.words[0] === 0) {\n      this.negative = 0;\n    }\n    return this;\n  };\n\n  // Check Symbol.for because not everywhere where Symbol defined\n  // See https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Symbol#Browser_compatibility\n  if (typeof Symbol !== 'undefined' && typeof Symbol.for === 'function') {\n    BN.prototype[Symbol.for('nodejs.util.inspect.custom')] = inspect;\n  } else {\n    BN.prototype.inspect = inspect;\n  }\n\n  function inspect () {\n    return (this.red ? '<BN-R: ' : '<BN: ') + this.toString(16) + '>';\n  }\n\n  /*\n\n  var zeros = [];\n  var groupSizes = [];\n  var groupBases = [];\n\n  var s = '';\n  var i = -1;\n  while (++i < BN.wordSize) {\n    zeros[i] = s;\n    s += '0';\n  }\n  groupSizes[0] = 0;\n  groupSizes[1] = 0;\n  groupBases[0] = 0;\n  groupBases[1] = 0;\n  var base = 2 - 1;\n  while (++base < 36 + 1) {\n    var groupSize = 0;\n    var groupBase = 1;\n    while (groupBase < (1 << BN.wordSize) / base) {\n      groupBase *= base;\n      groupSize += 1;\n    }\n    groupSizes[base] = groupSize;\n    groupBases[base] = groupBase;\n  }\n\n  */\n\n  var zeros = [\n    '',\n    '0',\n    '00',\n    '000',\n    '0000',\n    '00000',\n    '000000',\n    '0000000',\n    '00000000',\n    '000000000',\n    '0000000000',\n    '00000000000',\n    '000000000000',\n    '0000000000000',\n    '00000000000000',\n    '000000000000000',\n    '0000000000000000',\n    '00000000000000000',\n    '000000000000000000',\n    '0000000000000000000',\n    '00000000000000000000',\n    '000000000000000000000',\n    '0000000000000000000000',\n    '00000000000000000000000',\n    '000000000000000000000000',\n    '0000000000000000000000000'\n  ];\n\n  var groupSizes = [\n    0, 0,\n    25, 16, 12, 11, 10, 9, 8,\n    8, 7, 7, 7, 7, 6, 6,\n    6, 6, 6, 6, 6, 5, 5,\n    5, 5, 5, 5, 5, 5, 5,\n    5, 5, 5, 5, 5, 5, 5\n  ];\n\n  var groupBases = [\n    0, 0,\n    33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216,\n    43046721, 10000000, 19487171, 35831808, 62748517, 7529536, 11390625,\n    16777216, 24137569, 34012224, 47045881, 64000000, 4084101, 5153632,\n    6436343, 7962624, 9765625, 11881376, 14348907, 17210368, 20511149,\n    24300000, 28629151, 33554432, 39135393, 45435424, 52521875, 60466176\n  ];\n\n  BN.prototype.toString = function toString (base, padding) {\n    base = base || 10;\n    padding = padding | 0 || 1;\n\n    var out;\n    if (base === 16 || base === 'hex') {\n      out = '';\n      var off = 0;\n      var carry = 0;\n      for (var i = 0; i < this.length; i++) {\n        var w = this.words[i];\n        var word = (((w << off) | carry) & 0xffffff).toString(16);\n        carry = (w >>> (24 - off)) & 0xffffff;\n        if (carry !== 0 || i !== this.length - 1) {\n          out = zeros[6 - word.length] + word + out;\n        } else {\n          out = word + out;\n        }\n        off += 2;\n        if (off >= 26) {\n          off -= 26;\n          i--;\n        }\n      }\n      if (carry !== 0) {\n        out = carry.toString(16) + out;\n      }\n      while (out.length % padding !== 0) {\n        out = '0' + out;\n      }\n      if (this.negative !== 0) {\n        out = '-' + out;\n      }\n      return out;\n    }\n\n    if (base === (base | 0) && base >= 2 && base <= 36) {\n      // var groupSize = Math.floor(BN.wordSize * Math.LN2 / Math.log(base));\n      var groupSize = groupSizes[base];\n      // var groupBase = Math.pow(base, groupSize);\n      var groupBase = groupBases[base];\n      out = '';\n      var c = this.clone();\n      c.negative = 0;\n      while (!c.isZero()) {\n        var r = c.modrn(groupBase).toString(base);\n        c = c.idivn(groupBase);\n\n        if (!c.isZero()) {\n          out = zeros[groupSize - r.length] + r + out;\n        } else {\n          out = r + out;\n        }\n      }\n      if (this.isZero()) {\n        out = '0' + out;\n      }\n      while (out.length % padding !== 0) {\n        out = '0' + out;\n      }\n      if (this.negative !== 0) {\n        out = '-' + out;\n      }\n      return out;\n    }\n\n    assert(false, 'Base should be between 2 and 36');\n  };\n\n  BN.prototype.toNumber = function toNumber () {\n    var ret = this.words[0];\n    if (this.length === 2) {\n      ret += this.words[1] * 0x4000000;\n    } else if (this.length === 3 && this.words[2] === 0x01) {\n      // NOTE: at this stage it is known that the top bit is set\n      ret += 0x10000000000000 + (this.words[1] * 0x4000000);\n    } else if (this.length > 2) {\n      assert(false, 'Number can only safely store up to 53 bits');\n    }\n    return (this.negative !== 0) ? -ret : ret;\n  };\n\n  BN.prototype.toJSON = function toJSON () {\n    return this.toString(16, 2);\n  };\n\n  if (Buffer) {\n    BN.prototype.toBuffer = function toBuffer (endian, length) {\n      return this.toArrayLike(Buffer, endian, length);\n    };\n  }\n\n  BN.prototype.toArray = function toArray (endian, length) {\n    return this.toArrayLike(Array, endian, length);\n  };\n\n  var allocate = function allocate (ArrayType, size) {\n    if (ArrayType.allocUnsafe) {\n      return ArrayType.allocUnsafe(size);\n    }\n    return new ArrayType(size);\n  };\n\n  BN.prototype.toArrayLike = function toArrayLike (ArrayType, endian, length) {\n    this._strip();\n\n    var byteLength = this.byteLength();\n    var reqLength = length || Math.max(1, byteLength);\n    assert(byteLength <= reqLength, 'byte array longer than desired length');\n    assert(reqLength > 0, 'Requested array length <= 0');\n\n    var res = allocate(ArrayType, reqLength);\n    var postfix = endian === 'le' ? 'LE' : 'BE';\n    this['_toArrayLike' + postfix](res, byteLength);\n    return res;\n  };\n\n  BN.prototype._toArrayLikeLE = function _toArrayLikeLE (res, byteLength) {\n    var position = 0;\n    var carry = 0;\n\n    for (var i = 0, shift = 0; i < this.length; i++) {\n      var word = (this.words[i] << shift) | carry;\n\n      res[position++] = word & 0xff;\n      if (position < res.length) {\n        res[position++] = (word >> 8) & 0xff;\n      }\n      if (position < res.length) {\n        res[position++] = (word >> 16) & 0xff;\n      }\n\n      if (shift === 6) {\n        if (position < res.length) {\n          res[position++] = (word >> 24) & 0xff;\n        }\n        carry = 0;\n        shift = 0;\n      } else {\n        carry = word >>> 24;\n        shift += 2;\n      }\n    }\n\n    if (position < res.length) {\n      res[position++] = carry;\n\n      while (position < res.length) {\n        res[position++] = 0;\n      }\n    }\n  };\n\n  BN.prototype._toArrayLikeBE = function _toArrayLikeBE (res, byteLength) {\n    var position = res.length - 1;\n    var carry = 0;\n\n    for (var i = 0, shift = 0; i < this.length; i++) {\n      var word = (this.words[i] << shift) | carry;\n\n      res[position--] = word & 0xff;\n      if (position >= 0) {\n        res[position--] = (word >> 8) & 0xff;\n      }\n      if (position >= 0) {\n        res[position--] = (word >> 16) & 0xff;\n      }\n\n      if (shift === 6) {\n        if (position >= 0) {\n          res[position--] = (word >> 24) & 0xff;\n        }\n        carry = 0;\n        shift = 0;\n      } else {\n        carry = word >>> 24;\n        shift += 2;\n      }\n    }\n\n    if (position >= 0) {\n      res[position--] = carry;\n\n      while (position >= 0) {\n        res[position--] = 0;\n      }\n    }\n  };\n\n  if (Math.clz32) {\n    BN.prototype._countBits = function _countBits (w) {\n      return 32 - Math.clz32(w);\n    };\n  } else {\n    BN.prototype._countBits = function _countBits (w) {\n      var t = w;\n      var r = 0;\n      if (t >= 0x1000) {\n        r += 13;\n        t >>>= 13;\n      }\n      if (t >= 0x40) {\n        r += 7;\n        t >>>= 7;\n      }\n      if (t >= 0x8) {\n        r += 4;\n        t >>>= 4;\n      }\n      if (t >= 0x02) {\n        r += 2;\n        t >>>= 2;\n      }\n      return r + t;\n    };\n  }\n\n  BN.prototype._zeroBits = function _zeroBits (w) {\n    // Short-cut\n    if (w === 0) return 26;\n\n    var t = w;\n    var r = 0;\n    if ((t & 0x1fff) === 0) {\n      r += 13;\n      t >>>= 13;\n    }\n    if ((t & 0x7f) === 0) {\n      r += 7;\n      t >>>= 7;\n    }\n    if ((t & 0xf) === 0) {\n      r += 4;\n      t >>>= 4;\n    }\n    if ((t & 0x3) === 0) {\n      r += 2;\n      t >>>= 2;\n    }\n    if ((t & 0x1) === 0) {\n      r++;\n    }\n    return r;\n  };\n\n  // Return number of used bits in a BN\n  BN.prototype.bitLength = function bitLength () {\n    var w = this.words[this.length - 1];\n    var hi = this._countBits(w);\n    return (this.length - 1) * 26 + hi;\n  };\n\n  function toBitArray (num) {\n    var w = new Array(num.bitLength());\n\n    for (var bit = 0; bit < w.length; bit++) {\n      var off = (bit / 26) | 0;\n      var wbit = bit % 26;\n\n      w[bit] = (num.words[off] >>> wbit) & 0x01;\n    }\n\n    return w;\n  }\n\n  // Number of trailing zero bits\n  BN.prototype.zeroBits = function zeroBits () {\n    if (this.isZero()) return 0;\n\n    var r = 0;\n    for (var i = 0; i < this.length; i++) {\n      var b = this._zeroBits(this.words[i]);\n      r += b;\n      if (b !== 26) break;\n    }\n    return r;\n  };\n\n  BN.prototype.byteLength = function byteLength () {\n    return Math.ceil(this.bitLength() / 8);\n  };\n\n  BN.prototype.toTwos = function toTwos (width) {\n    if (this.negative !== 0) {\n      return this.abs().inotn(width).iaddn(1);\n    }\n    return this.clone();\n  };\n\n  BN.prototype.fromTwos = function fromTwos (width) {\n    if (this.testn(width - 1)) {\n      return this.notn(width).iaddn(1).ineg();\n    }\n    return this.clone();\n  };\n\n  BN.prototype.isNeg = function isNeg () {\n    return this.negative !== 0;\n  };\n\n  // Return negative clone of `this`\n  BN.prototype.neg = function neg () {\n    return this.clone().ineg();\n  };\n\n  BN.prototype.ineg = function ineg () {\n    if (!this.isZero()) {\n      this.negative ^= 1;\n    }\n\n    return this;\n  };\n\n  // Or `num` with `this` in-place\n  BN.prototype.iuor = function iuor (num) {\n    while (this.length < num.length) {\n      this.words[this.length++] = 0;\n    }\n\n    for (var i = 0; i < num.length; i++) {\n      this.words[i] = this.words[i] | num.words[i];\n    }\n\n    return this._strip();\n  };\n\n  BN.prototype.ior = function ior (num) {\n    assert((this.negative | num.negative) === 0);\n    return this.iuor(num);\n  };\n\n  // Or `num` with `this`\n  BN.prototype.or = function or (num) {\n    if (this.length > num.length) return this.clone().ior(num);\n    return num.clone().ior(this);\n  };\n\n  BN.prototype.uor = function uor (num) {\n    if (this.length > num.length) return this.clone().iuor(num);\n    return num.clone().iuor(this);\n  };\n\n  // And `num` with `this` in-place\n  BN.prototype.iuand = function iuand (num) {\n    // b = min-length(num, this)\n    var b;\n    if (this.length > num.length) {\n      b = num;\n    } else {\n      b = this;\n    }\n\n    for (var i = 0; i < b.length; i++) {\n      this.words[i] = this.words[i] & num.words[i];\n    }\n\n    this.length = b.length;\n\n    return this._strip();\n  };\n\n  BN.prototype.iand = function iand (num) {\n    assert((this.negative | num.negative) === 0);\n    return this.iuand(num);\n  };\n\n  // And `num` with `this`\n  BN.prototype.and = function and (num) {\n    if (this.length > num.length) return this.clone().iand(num);\n    return num.clone().iand(this);\n  };\n\n  BN.prototype.uand = function uand (num) {\n    if (this.length > num.length) return this.clone().iuand(num);\n    return num.clone().iuand(this);\n  };\n\n  // Xor `num` with `this` in-place\n  BN.prototype.iuxor = function iuxor (num) {\n    // a.length > b.length\n    var a;\n    var b;\n    if (this.length > num.length) {\n      a = this;\n      b = num;\n    } else {\n      a = num;\n      b = this;\n    }\n\n    for (var i = 0; i < b.length; i++) {\n      this.words[i] = a.words[i] ^ b.words[i];\n    }\n\n    if (this !== a) {\n      for (; i < a.length; i++) {\n        this.words[i] = a.words[i];\n      }\n    }\n\n    this.length = a.length;\n\n    return this._strip();\n  };\n\n  BN.prototype.ixor = function ixor (num) {\n    assert((this.negative | num.negative) === 0);\n    return this.iuxor(num);\n  };\n\n  // Xor `num` with `this`\n  BN.prototype.xor = function xor (num) {\n    if (this.length > num.length) return this.clone().ixor(num);\n    return num.clone().ixor(this);\n  };\n\n  BN.prototype.uxor = function uxor (num) {\n    if (this.length > num.length) return this.clone().iuxor(num);\n    return num.clone().iuxor(this);\n  };\n\n  // Not ``this`` with ``width`` bitwidth\n  BN.prototype.inotn = function inotn (width) {\n    assert(typeof width === 'number' && width >= 0);\n\n    var bytesNeeded = Math.ceil(width / 26) | 0;\n    var bitsLeft = width % 26;\n\n    // Extend the buffer with leading zeroes\n    this._expand(bytesNeeded);\n\n    if (bitsLeft > 0) {\n      bytesNeeded--;\n    }\n\n    // Handle complete words\n    for (var i = 0; i < bytesNeeded; i++) {\n      this.words[i] = ~this.words[i] & 0x3ffffff;\n    }\n\n    // Handle the residue\n    if (bitsLeft > 0) {\n      this.words[i] = ~this.words[i] & (0x3ffffff >> (26 - bitsLeft));\n    }\n\n    // And remove leading zeroes\n    return this._strip();\n  };\n\n  BN.prototype.notn = function notn (width) {\n    return this.clone().inotn(width);\n  };\n\n  // Set `bit` of `this`\n  BN.prototype.setn = function setn (bit, val) {\n    assert(typeof bit === 'number' && bit >= 0);\n\n    var off = (bit / 26) | 0;\n    var wbit = bit % 26;\n\n    this._expand(off + 1);\n\n    if (val) {\n      this.words[off] = this.words[off] | (1 << wbit);\n    } else {\n      this.words[off] = this.words[off] & ~(1 << wbit);\n    }\n\n    return this._strip();\n  };\n\n  // Add `num` to `this` in-place\n  BN.prototype.iadd = function iadd (num) {\n    var r;\n\n    // negative + positive\n    if (this.negative !== 0 && num.negative === 0) {\n      this.negative = 0;\n      r = this.isub(num);\n      this.negative ^= 1;\n      return this._normSign();\n\n    // positive + negative\n    } else if (this.negative === 0 && num.negative !== 0) {\n      num.negative = 0;\n      r = this.isub(num);\n      num.negative = 1;\n      return r._normSign();\n    }\n\n    // a.length > b.length\n    var a, b;\n    if (this.length > num.length) {\n      a = this;\n      b = num;\n    } else {\n      a = num;\n      b = this;\n    }\n\n    var carry = 0;\n    for (var i = 0; i < b.length; i++) {\n      r = (a.words[i] | 0) + (b.words[i] | 0) + carry;\n      this.words[i] = r & 0x3ffffff;\n      carry = r >>> 26;\n    }\n    for (; carry !== 0 && i < a.length; i++) {\n      r = (a.words[i] | 0) + carry;\n      this.words[i] = r & 0x3ffffff;\n      carry = r >>> 26;\n    }\n\n    this.length = a.length;\n    if (carry !== 0) {\n      this.words[this.length] = carry;\n      this.length++;\n    // Copy the rest of the words\n    } else if (a !== this) {\n      for (; i < a.length; i++) {\n        this.words[i] = a.words[i];\n      }\n    }\n\n    return this;\n  };\n\n  // Add `num` to `this`\n  BN.prototype.add = function add (num) {\n    var res;\n    if (num.negative !== 0 && this.negative === 0) {\n      num.negative = 0;\n      res = this.sub(num);\n      num.negative ^= 1;\n      return res;\n    } else if (num.negative === 0 && this.negative !== 0) {\n      this.negative = 0;\n      res = num.sub(this);\n      this.negative = 1;\n      return res;\n    }\n\n    if (this.length > num.length) return this.clone().iadd(num);\n\n    return num.clone().iadd(this);\n  };\n\n  // Subtract `num` from `this` in-place\n  BN.prototype.isub = function isub (num) {\n    // this - (-num) = this + num\n    if (num.negative !== 0) {\n      num.negative = 0;\n      var r = this.iadd(num);\n      num.negative = 1;\n      return r._normSign();\n\n    // -this - num = -(this + num)\n    } else if (this.negative !== 0) {\n      this.negative = 0;\n      this.iadd(num);\n      this.negative = 1;\n      return this._normSign();\n    }\n\n    // At this point both numbers are positive\n    var cmp = this.cmp(num);\n\n    // Optimization - zeroify\n    if (cmp === 0) {\n      this.negative = 0;\n      this.length = 1;\n      this.words[0] = 0;\n      return this;\n    }\n\n    // a > b\n    var a, b;\n    if (cmp > 0) {\n      a = this;\n      b = num;\n    } else {\n      a = num;\n      b = this;\n    }\n\n    var carry = 0;\n    for (var i = 0; i < b.length; i++) {\n      r = (a.words[i] | 0) - (b.words[i] | 0) + carry;\n      carry = r >> 26;\n      this.words[i] = r & 0x3ffffff;\n    }\n    for (; carry !== 0 && i < a.length; i++) {\n      r = (a.words[i] | 0) + carry;\n      carry = r >> 26;\n      this.words[i] = r & 0x3ffffff;\n    }\n\n    // Copy rest of the words\n    if (carry === 0 && i < a.length && a !== this) {\n      for (; i < a.length; i++) {\n        this.words[i] = a.words[i];\n      }\n    }\n\n    this.length = Math.max(this.length, i);\n\n    if (a !== this) {\n      this.negative = 1;\n    }\n\n    return this._strip();\n  };\n\n  // Subtract `num` from `this`\n  BN.prototype.sub = function sub (num) {\n    return this.clone().isub(num);\n  };\n\n  function smallMulTo (self, num, out) {\n    out.negative = num.negative ^ self.negative;\n    var len = (self.length + num.length) | 0;\n    out.length = len;\n    len = (len - 1) | 0;\n\n    // Peel one iteration (compiler can't do it, because of code complexity)\n    var a = self.words[0] | 0;\n    var b = num.words[0] | 0;\n    var r = a * b;\n\n    var lo = r & 0x3ffffff;\n    var carry = (r / 0x4000000) | 0;\n    out.words[0] = lo;\n\n    for (var k = 1; k < len; k++) {\n      // Sum all words with the same `i + j = k` and accumulate `ncarry`,\n      // note that ncarry could be >= 0x3ffffff\n      var ncarry = carry >>> 26;\n      var rword = carry & 0x3ffffff;\n      var maxJ = Math.min(k, num.length - 1);\n      for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) {\n        var i = (k - j) | 0;\n        a = self.words[i] | 0;\n        b = num.words[j] | 0;\n        r = a * b + rword;\n        ncarry += (r / 0x4000000) | 0;\n        rword = r & 0x3ffffff;\n      }\n      out.words[k] = rword | 0;\n      carry = ncarry | 0;\n    }\n    if (carry !== 0) {\n      out.words[k] = carry | 0;\n    } else {\n      out.length--;\n    }\n\n    return out._strip();\n  }\n\n  // TODO(indutny): it may be reasonable to omit it for users who don't need\n  // to work with 256-bit numbers, otherwise it gives 20% improvement for 256-bit\n  // multiplication (like elliptic secp256k1).\n  var comb10MulTo = function comb10MulTo (self, num, out) {\n    var a = self.words;\n    var b = num.words;\n    var o = out.words;\n    var c = 0;\n    var lo;\n    var mid;\n    var hi;\n    var a0 = a[0] | 0;\n    var al0 = a0 & 0x1fff;\n    var ah0 = a0 >>> 13;\n    var a1 = a[1] | 0;\n    var al1 = a1 & 0x1fff;\n    var ah1 = a1 >>> 13;\n    var a2 = a[2] | 0;\n    var al2 = a2 & 0x1fff;\n    var ah2 = a2 >>> 13;\n    var a3 = a[3] | 0;\n    var al3 = a3 & 0x1fff;\n    var ah3 = a3 >>> 13;\n    var a4 = a[4] | 0;\n    var al4 = a4 & 0x1fff;\n    var ah4 = a4 >>> 13;\n    var a5 = a[5] | 0;\n    var al5 = a5 & 0x1fff;\n    var ah5 = a5 >>> 13;\n    var a6 = a[6] | 0;\n    var al6 = a6 & 0x1fff;\n    var ah6 = a6 >>> 13;\n    var a7 = a[7] | 0;\n    var al7 = a7 & 0x1fff;\n    var ah7 = a7 >>> 13;\n    var a8 = a[8] | 0;\n    var al8 = a8 & 0x1fff;\n    var ah8 = a8 >>> 13;\n    var a9 = a[9] | 0;\n    var al9 = a9 & 0x1fff;\n    var ah9 = a9 >>> 13;\n    var b0 = b[0] | 0;\n    var bl0 = b0 & 0x1fff;\n    var bh0 = b0 >>> 13;\n    var b1 = b[1] | 0;\n    var bl1 = b1 & 0x1fff;\n    var bh1 = b1 >>> 13;\n    var b2 = b[2] | 0;\n    var bl2 = b2 & 0x1fff;\n    var bh2 = b2 >>> 13;\n    var b3 = b[3] | 0;\n    var bl3 = b3 & 0x1fff;\n    var bh3 = b3 >>> 13;\n    var b4 = b[4] | 0;\n    var bl4 = b4 & 0x1fff;\n    var bh4 = b4 >>> 13;\n    var b5 = b[5] | 0;\n    var bl5 = b5 & 0x1fff;\n    var bh5 = b5 >>> 13;\n    var b6 = b[6] | 0;\n    var bl6 = b6 & 0x1fff;\n    var bh6 = b6 >>> 13;\n    var b7 = b[7] | 0;\n    var bl7 = b7 & 0x1fff;\n    var bh7 = b7 >>> 13;\n    var b8 = b[8] | 0;\n    var bl8 = b8 & 0x1fff;\n    var bh8 = b8 >>> 13;\n    var b9 = b[9] | 0;\n    var bl9 = b9 & 0x1fff;\n    var bh9 = b9 >>> 13;\n\n    out.negative = self.negative ^ num.negative;\n    out.length = 19;\n    /* k = 0 */\n    lo = Math.imul(al0, bl0);\n    mid = Math.imul(al0, bh0);\n    mid = (mid + Math.imul(ah0, bl0)) | 0;\n    hi = Math.imul(ah0, bh0);\n    var w0 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0;\n    w0 &= 0x3ffffff;\n    /* k = 1 */\n    lo = Math.imul(al1, bl0);\n    mid = Math.imul(al1, bh0);\n    mid = (mid + Math.imul(ah1, bl0)) | 0;\n    hi = Math.imul(ah1, bh0);\n    lo = (lo + Math.imul(al0, bl1)) | 0;\n    mid = (mid + Math.imul(al0, bh1)) | 0;\n    mid = (mid + Math.imul(ah0, bl1)) | 0;\n    hi = (hi + Math.imul(ah0, bh1)) | 0;\n    var w1 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0;\n    w1 &= 0x3ffffff;\n    /* k = 2 */\n    lo = Math.imul(al2, bl0);\n    mid = Math.imul(al2, bh0);\n    mid = (mid + Math.imul(ah2, bl0)) | 0;\n    hi = Math.imul(ah2, bh0);\n    lo = (lo + Math.imul(al1, bl1)) | 0;\n    mid = (mid + Math.imul(al1, bh1)) | 0;\n    mid = (mid + Math.imul(ah1, bl1)) | 0;\n    hi = (hi + Math.imul(ah1, bh1)) | 0;\n    lo = (lo + Math.imul(al0, bl2)) | 0;\n    mid = (mid + Math.imul(al0, bh2)) | 0;\n    mid = (mid + Math.imul(ah0, bl2)) | 0;\n    hi = (hi + Math.imul(ah0, bh2)) | 0;\n    var w2 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0;\n    w2 &= 0x3ffffff;\n    /* k = 3 */\n    lo = Math.imul(al3, bl0);\n    mid = Math.imul(al3, bh0);\n    mid = (mid + Math.imul(ah3, bl0)) | 0;\n    hi = Math.imul(ah3, bh0);\n    lo = (lo + Math.imul(al2, bl1)) | 0;\n    mid = (mid + Math.imul(al2, bh1)) | 0;\n    mid = (mid + Math.imul(ah2, bl1)) | 0;\n    hi = (hi + Math.imul(ah2, bh1)) | 0;\n    lo = (lo + Math.imul(al1, bl2)) | 0;\n    mid = (mid + Math.imul(al1, bh2)) | 0;\n    mid = (mid + Math.imul(ah1, bl2)) | 0;\n    hi = (hi + Math.imul(ah1, bh2)) | 0;\n    lo = (lo + Math.imul(al0, bl3)) | 0;\n    mid = (mid + Math.imul(al0, bh3)) | 0;\n    mid = (mid + Math.imul(ah0, bl3)) | 0;\n    hi = (hi + Math.imul(ah0, bh3)) | 0;\n    var w3 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0;\n    w3 &= 0x3ffffff;\n    /* k = 4 */\n    lo = Math.imul(al4, bl0);\n    mid = Math.imul(al4, bh0);\n    mid = (mid + Math.imul(ah4, bl0)) | 0;\n    hi = Math.imul(ah4, bh0);\n    lo = (lo + Math.imul(al3, bl1)) | 0;\n    mid = (mid + Math.imul(al3, bh1)) | 0;\n    mid = (mid + Math.imul(ah3, bl1)) | 0;\n    hi = (hi + Math.imul(ah3, bh1)) | 0;\n    lo = (lo + Math.imul(al2, bl2)) | 0;\n    mid = (mid + Math.imul(al2, bh2)) | 0;\n    mid = (mid + Math.imul(ah2, bl2)) | 0;\n    hi = (hi + Math.imul(ah2, bh2)) | 0;\n    lo = (lo + Math.imul(al1, bl3)) | 0;\n    mid = (mid + Math.imul(al1, bh3)) | 0;\n    mid = (mid + Math.imul(ah1, bl3)) | 0;\n    hi = (hi + Math.imul(ah1, bh3)) | 0;\n    lo = (lo + Math.imul(al0, bl4)) | 0;\n    mid = (mid + Math.imul(al0, bh4)) | 0;\n    mid = (mid + Math.imul(ah0, bl4)) | 0;\n    hi = (hi + Math.imul(ah0, bh4)) | 0;\n    var w4 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0;\n    w4 &= 0x3ffffff;\n    /* k = 5 */\n    lo = Math.imul(al5, bl0);\n    mid = Math.imul(al5, bh0);\n    mid = (mid + Math.imul(ah5, bl0)) | 0;\n    hi = Math.imul(ah5, bh0);\n    lo = (lo + Math.imul(al4, bl1)) | 0;\n    mid = (mid + Math.imul(al4, bh1)) | 0;\n    mid = (mid + Math.imul(ah4, bl1)) | 0;\n    hi = (hi + Math.imul(ah4, bh1)) | 0;\n    lo = (lo + Math.imul(al3, bl2)) | 0;\n    mid = (mid + Math.imul(al3, bh2)) | 0;\n    mid = (mid + Math.imul(ah3, bl2)) | 0;\n    hi = (hi + Math.imul(ah3, bh2)) | 0;\n    lo = (lo + Math.imul(al2, bl3)) | 0;\n    mid = (mid + Math.imul(al2, bh3)) | 0;\n    mid = (mid + Math.imul(ah2, bl3)) | 0;\n    hi = (hi + Math.imul(ah2, bh3)) | 0;\n    lo = (lo + Math.imul(al1, bl4)) | 0;\n    mid = (mid + Math.imul(al1, bh4)) | 0;\n    mid = (mid + Math.imul(ah1, bl4)) | 0;\n    hi = (hi + Math.imul(ah1, bh4)) | 0;\n    lo = (lo + Math.imul(al0, bl5)) | 0;\n    mid = (mid + Math.imul(al0, bh5)) | 0;\n    mid = (mid + Math.imul(ah0, bl5)) | 0;\n    hi = (hi + Math.imul(ah0, bh5)) | 0;\n    var w5 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0;\n    w5 &= 0x3ffffff;\n    /* k = 6 */\n    lo = Math.imul(al6, bl0);\n    mid = Math.imul(al6, bh0);\n    mid = (mid + Math.imul(ah6, bl0)) | 0;\n    hi = Math.imul(ah6, bh0);\n    lo = (lo + Math.imul(al5, bl1)) | 0;\n    mid = (mid + Math.imul(al5, bh1)) | 0;\n    mid = (mid + Math.imul(ah5, bl1)) | 0;\n    hi = (hi + Math.imul(ah5, bh1)) | 0;\n    lo = (lo + Math.imul(al4, bl2)) | 0;\n    mid = (mid + Math.imul(al4, bh2)) | 0;\n    mid = (mid + Math.imul(ah4, bl2)) | 0;\n    hi = (hi + Math.imul(ah4, bh2)) | 0;\n    lo = (lo + Math.imul(al3, bl3)) | 0;\n    mid = (mid + Math.imul(al3, bh3)) | 0;\n    mid = (mid + Math.imul(ah3, bl3)) | 0;\n    hi = (hi + Math.imul(ah3, bh3)) | 0;\n    lo = (lo + Math.imul(al2, bl4)) | 0;\n    mid = (mid + Math.imul(al2, bh4)) | 0;\n    mid = (mid + Math.imul(ah2, bl4)) | 0;\n    hi = (hi + Math.imul(ah2, bh4)) | 0;\n    lo = (lo + Math.imul(al1, bl5)) | 0;\n    mid = (mid + Math.imul(al1, bh5)) | 0;\n    mid = (mid + Math.imul(ah1, bl5)) | 0;\n    hi = (hi + Math.imul(ah1, bh5)) | 0;\n    lo = (lo + Math.imul(al0, bl6)) | 0;\n    mid = (mid + Math.imul(al0, bh6)) | 0;\n    mid = (mid + Math.imul(ah0, bl6)) | 0;\n    hi = (hi + Math.imul(ah0, bh6)) | 0;\n    var w6 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0;\n    w6 &= 0x3ffffff;\n    /* k = 7 */\n    lo = Math.imul(al7, bl0);\n    mid = Math.imul(al7, bh0);\n    mid = (mid + Math.imul(ah7, bl0)) | 0;\n    hi = Math.imul(ah7, bh0);\n    lo = (lo + Math.imul(al6, bl1)) | 0;\n    mid = (mid + Math.imul(al6, bh1)) | 0;\n    mid = (mid + Math.imul(ah6, bl1)) | 0;\n    hi = (hi + Math.imul(ah6, bh1)) | 0;\n    lo = (lo + Math.imul(al5, bl2)) | 0;\n    mid = (mid + Math.imul(al5, bh2)) | 0;\n    mid = (mid + Math.imul(ah5, bl2)) | 0;\n    hi = (hi + Math.imul(ah5, bh2)) | 0;\n    lo = (lo + Math.imul(al4, bl3)) | 0;\n    mid = (mid + Math.imul(al4, bh3)) | 0;\n    mid = (mid + Math.imul(ah4, bl3)) | 0;\n    hi = (hi + Math.imul(ah4, bh3)) | 0;\n    lo = (lo + Math.imul(al3, bl4)) | 0;\n    mid = (mid + Math.imul(al3, bh4)) | 0;\n    mid = (mid + Math.imul(ah3, bl4)) | 0;\n    hi = (hi + Math.imul(ah3, bh4)) | 0;\n    lo = (lo + Math.imul(al2, bl5)) | 0;\n    mid = (mid + Math.imul(al2, bh5)) | 0;\n    mid = (mid + Math.imul(ah2, bl5)) | 0;\n    hi = (hi + Math.imul(ah2, bh5)) | 0;\n    lo = (lo + Math.imul(al1, bl6)) | 0;\n    mid = (mid + Math.imul(al1, bh6)) | 0;\n    mid = (mid + Math.imul(ah1, bl6)) | 0;\n    hi = (hi + Math.imul(ah1, bh6)) | 0;\n    lo = (lo + Math.imul(al0, bl7)) | 0;\n    mid = (mid + Math.imul(al0, bh7)) | 0;\n    mid = (mid + Math.imul(ah0, bl7)) | 0;\n    hi = (hi + Math.imul(ah0, bh7)) | 0;\n    var w7 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0;\n    w7 &= 0x3ffffff;\n    /* k = 8 */\n    lo = Math.imul(al8, bl0);\n    mid = Math.imul(al8, bh0);\n    mid = (mid + Math.imul(ah8, bl0)) | 0;\n    hi = Math.imul(ah8, bh0);\n    lo = (lo + Math.imul(al7, bl1)) | 0;\n    mid = (mid + Math.imul(al7, bh1)) | 0;\n    mid = (mid + Math.imul(ah7, bl1)) | 0;\n    hi = (hi + Math.imul(ah7, bh1)) | 0;\n    lo = (lo + Math.imul(al6, bl2)) | 0;\n    mid = (mid + Math.imul(al6, bh2)) | 0;\n    mid = (mid + Math.imul(ah6, bl2)) | 0;\n    hi = (hi + Math.imul(ah6, bh2)) | 0;\n    lo = (lo + Math.imul(al5, bl3)) | 0;\n    mid = (mid + Math.imul(al5, bh3)) | 0;\n    mid = (mid + Math.imul(ah5, bl3)) | 0;\n    hi = (hi + Math.imul(ah5, bh3)) | 0;\n    lo = (lo + Math.imul(al4, bl4)) | 0;\n    mid = (mid + Math.imul(al4, bh4)) | 0;\n    mid = (mid + Math.imul(ah4, bl4)) | 0;\n    hi = (hi + Math.imul(ah4, bh4)) | 0;\n    lo = (lo + Math.imul(al3, bl5)) | 0;\n    mid = (mid + Math.imul(al3, bh5)) | 0;\n    mid = (mid + Math.imul(ah3, bl5)) | 0;\n    hi = (hi + Math.imul(ah3, bh5)) | 0;\n    lo = (lo + Math.imul(al2, bl6)) | 0;\n    mid = (mid + Math.imul(al2, bh6)) | 0;\n    mid = (mid + Math.imul(ah2, bl6)) | 0;\n    hi = (hi + Math.imul(ah2, bh6)) | 0;\n    lo = (lo + Math.imul(al1, bl7)) | 0;\n    mid = (mid + Math.imul(al1, bh7)) | 0;\n    mid = (mid + Math.imul(ah1, bl7)) | 0;\n    hi = (hi + Math.imul(ah1, bh7)) | 0;\n    lo = (lo + Math.imul(al0, bl8)) | 0;\n    mid = (mid + Math.imul(al0, bh8)) | 0;\n    mid = (mid + Math.imul(ah0, bl8)) | 0;\n    hi = (hi + Math.imul(ah0, bh8)) | 0;\n    var w8 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0;\n    w8 &= 0x3ffffff;\n    /* k = 9 */\n    lo = Math.imul(al9, bl0);\n    mid = Math.imul(al9, bh0);\n    mid = (mid + Math.imul(ah9, bl0)) | 0;\n    hi = Math.imul(ah9, bh0);\n    lo = (lo + Math.imul(al8, bl1)) | 0;\n    mid = (mid + Math.imul(al8, bh1)) | 0;\n    mid = (mid + Math.imul(ah8, bl1)) | 0;\n    hi = (hi + Math.imul(ah8, bh1)) | 0;\n    lo = (lo + Math.imul(al7, bl2)) | 0;\n    mid = (mid + Math.imul(al7, bh2)) | 0;\n    mid = (mid + Math.imul(ah7, bl2)) | 0;\n    hi = (hi + Math.imul(ah7, bh2)) | 0;\n    lo = (lo + Math.imul(al6, bl3)) | 0;\n    mid = (mid + Math.imul(al6, bh3)) | 0;\n    mid = (mid + Math.imul(ah6, bl3)) | 0;\n    hi = (hi + Math.imul(ah6, bh3)) | 0;\n    lo = (lo + Math.imul(al5, bl4)) | 0;\n    mid = (mid + Math.imul(al5, bh4)) | 0;\n    mid = (mid + Math.imul(ah5, bl4)) | 0;\n    hi = (hi + Math.imul(ah5, bh4)) | 0;\n    lo = (lo + Math.imul(al4, bl5)) | 0;\n    mid = (mid + Math.imul(al4, bh5)) | 0;\n    mid = (mid + Math.imul(ah4, bl5)) | 0;\n    hi = (hi + Math.imul(ah4, bh5)) | 0;\n    lo = (lo + Math.imul(al3, bl6)) | 0;\n    mid = (mid + Math.imul(al3, bh6)) | 0;\n    mid = (mid + Math.imul(ah3, bl6)) | 0;\n    hi = (hi + Math.imul(ah3, bh6)) | 0;\n    lo = (lo + Math.imul(al2, bl7)) | 0;\n    mid = (mid + Math.imul(al2, bh7)) | 0;\n    mid = (mid + Math.imul(ah2, bl7)) | 0;\n    hi = (hi + Math.imul(ah2, bh7)) | 0;\n    lo = (lo + Math.imul(al1, bl8)) | 0;\n    mid = (mid + Math.imul(al1, bh8)) | 0;\n    mid = (mid + Math.imul(ah1, bl8)) | 0;\n    hi = (hi + Math.imul(ah1, bh8)) | 0;\n    lo = (lo + Math.imul(al0, bl9)) | 0;\n    mid = (mid + Math.imul(al0, bh9)) | 0;\n    mid = (mid + Math.imul(ah0, bl9)) | 0;\n    hi = (hi + Math.imul(ah0, bh9)) | 0;\n    var w9 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0;\n    w9 &= 0x3ffffff;\n    /* k = 10 */\n    lo = Math.imul(al9, bl1);\n    mid = Math.imul(al9, bh1);\n    mid = (mid + Math.imul(ah9, bl1)) | 0;\n    hi = Math.imul(ah9, bh1);\n    lo = (lo + Math.imul(al8, bl2)) | 0;\n    mid = (mid + Math.imul(al8, bh2)) | 0;\n    mid = (mid + Math.imul(ah8, bl2)) | 0;\n    hi = (hi + Math.imul(ah8, bh2)) | 0;\n    lo = (lo + Math.imul(al7, bl3)) | 0;\n    mid = (mid + Math.imul(al7, bh3)) | 0;\n    mid = (mid + Math.imul(ah7, bl3)) | 0;\n    hi = (hi + Math.imul(ah7, bh3)) | 0;\n    lo = (lo + Math.imul(al6, bl4)) | 0;\n    mid = (mid + Math.imul(al6, bh4)) | 0;\n    mid = (mid + Math.imul(ah6, bl4)) | 0;\n    hi = (hi + Math.imul(ah6, bh4)) | 0;\n    lo = (lo + Math.imul(al5, bl5)) | 0;\n    mid = (mid + Math.imul(al5, bh5)) | 0;\n    mid = (mid + Math.imul(ah5, bl5)) | 0;\n    hi = (hi + Math.imul(ah5, bh5)) | 0;\n    lo = (lo + Math.imul(al4, bl6)) | 0;\n    mid = (mid + Math.imul(al4, bh6)) | 0;\n    mid = (mid + Math.imul(ah4, bl6)) | 0;\n    hi = (hi + Math.imul(ah4, bh6)) | 0;\n    lo = (lo + Math.imul(al3, bl7)) | 0;\n    mid = (mid + Math.imul(al3, bh7)) | 0;\n    mid = (mid + Math.imul(ah3, bl7)) | 0;\n    hi = (hi + Math.imul(ah3, bh7)) | 0;\n    lo = (lo + Math.imul(al2, bl8)) | 0;\n    mid = (mid + Math.imul(al2, bh8)) | 0;\n    mid = (mid + Math.imul(ah2, bl8)) | 0;\n    hi = (hi + Math.imul(ah2, bh8)) | 0;\n    lo = (lo + Math.imul(al1, bl9)) | 0;\n    mid = (mid + Math.imul(al1, bh9)) | 0;\n    mid = (mid + Math.imul(ah1, bl9)) | 0;\n    hi = (hi + Math.imul(ah1, bh9)) | 0;\n    var w10 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0;\n    w10 &= 0x3ffffff;\n    /* k = 11 */\n    lo = Math.imul(al9, bl2);\n    mid = Math.imul(al9, bh2);\n    mid = (mid + Math.imul(ah9, bl2)) | 0;\n    hi = Math.imul(ah9, bh2);\n    lo = (lo + Math.imul(al8, bl3)) | 0;\n    mid = (mid + Math.imul(al8, bh3)) | 0;\n    mid = (mid + Math.imul(ah8, bl3)) | 0;\n    hi = (hi + Math.imul(ah8, bh3)) | 0;\n    lo = (lo + Math.imul(al7, bl4)) | 0;\n    mid = (mid + Math.imul(al7, bh4)) | 0;\n    mid = (mid + Math.imul(ah7, bl4)) | 0;\n    hi = (hi + Math.imul(ah7, bh4)) | 0;\n    lo = (lo + Math.imul(al6, bl5)) | 0;\n    mid = (mid + Math.imul(al6, bh5)) | 0;\n    mid = (mid + Math.imul(ah6, bl5)) | 0;\n    hi = (hi + Math.imul(ah6, bh5)) | 0;\n    lo = (lo + Math.imul(al5, bl6)) | 0;\n    mid = (mid + Math.imul(al5, bh6)) | 0;\n    mid = (mid + Math.imul(ah5, bl6)) | 0;\n    hi = (hi + Math.imul(ah5, bh6)) | 0;\n    lo = (lo + Math.imul(al4, bl7)) | 0;\n    mid = (mid + Math.imul(al4, bh7)) | 0;\n    mid = (mid + Math.imul(ah4, bl7)) | 0;\n    hi = (hi + Math.imul(ah4, bh7)) | 0;\n    lo = (lo + Math.imul(al3, bl8)) | 0;\n    mid = (mid + Math.imul(al3, bh8)) | 0;\n    mid = (mid + Math.imul(ah3, bl8)) | 0;\n    hi = (hi + Math.imul(ah3, bh8)) | 0;\n    lo = (lo + Math.imul(al2, bl9)) | 0;\n    mid = (mid + Math.imul(al2, bh9)) | 0;\n    mid = (mid + Math.imul(ah2, bl9)) | 0;\n    hi = (hi + Math.imul(ah2, bh9)) | 0;\n    var w11 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0;\n    w11 &= 0x3ffffff;\n    /* k = 12 */\n    lo = Math.imul(al9, bl3);\n    mid = Math.imul(al9, bh3);\n    mid = (mid + Math.imul(ah9, bl3)) | 0;\n    hi = Math.imul(ah9, bh3);\n    lo = (lo + Math.imul(al8, bl4)) | 0;\n    mid = (mid + Math.imul(al8, bh4)) | 0;\n    mid = (mid + Math.imul(ah8, bl4)) | 0;\n    hi = (hi + Math.imul(ah8, bh4)) | 0;\n    lo = (lo + Math.imul(al7, bl5)) | 0;\n    mid = (mid + Math.imul(al7, bh5)) | 0;\n    mid = (mid + Math.imul(ah7, bl5)) | 0;\n    hi = (hi + Math.imul(ah7, bh5)) | 0;\n    lo = (lo + Math.imul(al6, bl6)) | 0;\n    mid = (mid + Math.imul(al6, bh6)) | 0;\n    mid = (mid + Math.imul(ah6, bl6)) | 0;\n    hi = (hi + Math.imul(ah6, bh6)) | 0;\n    lo = (lo + Math.imul(al5, bl7)) | 0;\n    mid = (mid + Math.imul(al5, bh7)) | 0;\n    mid = (mid + Math.imul(ah5, bl7)) | 0;\n    hi = (hi + Math.imul(ah5, bh7)) | 0;\n    lo = (lo + Math.imul(al4, bl8)) | 0;\n    mid = (mid + Math.imul(al4, bh8)) | 0;\n    mid = (mid + Math.imul(ah4, bl8)) | 0;\n    hi = (hi + Math.imul(ah4, bh8)) | 0;\n    lo = (lo + Math.imul(al3, bl9)) | 0;\n    mid = (mid + Math.imul(al3, bh9)) | 0;\n    mid = (mid + Math.imul(ah3, bl9)) | 0;\n    hi = (hi + Math.imul(ah3, bh9)) | 0;\n    var w12 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0;\n    w12 &= 0x3ffffff;\n    /* k = 13 */\n    lo = Math.imul(al9, bl4);\n    mid = Math.imul(al9, bh4);\n    mid = (mid + Math.imul(ah9, bl4)) | 0;\n    hi = Math.imul(ah9, bh4);\n    lo = (lo + Math.imul(al8, bl5)) | 0;\n    mid = (mid + Math.imul(al8, bh5)) | 0;\n    mid = (mid + Math.imul(ah8, bl5)) | 0;\n    hi = (hi + Math.imul(ah8, bh5)) | 0;\n    lo = (lo + Math.imul(al7, bl6)) | 0;\n    mid = (mid + Math.imul(al7, bh6)) | 0;\n    mid = (mid + Math.imul(ah7, bl6)) | 0;\n    hi = (hi + Math.imul(ah7, bh6)) | 0;\n    lo = (lo + Math.imul(al6, bl7)) | 0;\n    mid = (mid + Math.imul(al6, bh7)) | 0;\n    mid = (mid + Math.imul(ah6, bl7)) | 0;\n    hi = (hi + Math.imul(ah6, bh7)) | 0;\n    lo = (lo + Math.imul(al5, bl8)) | 0;\n    mid = (mid + Math.imul(al5, bh8)) | 0;\n    mid = (mid + Math.imul(ah5, bl8)) | 0;\n    hi = (hi + Math.imul(ah5, bh8)) | 0;\n    lo = (lo + Math.imul(al4, bl9)) | 0;\n    mid = (mid + Math.imul(al4, bh9)) | 0;\n    mid = (mid + Math.imul(ah4, bl9)) | 0;\n    hi = (hi + Math.imul(ah4, bh9)) | 0;\n    var w13 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0;\n    w13 &= 0x3ffffff;\n    /* k = 14 */\n    lo = Math.imul(al9, bl5);\n    mid = Math.imul(al9, bh5);\n    mid = (mid + Math.imul(ah9, bl5)) | 0;\n    hi = Math.imul(ah9, bh5);\n    lo = (lo + Math.imul(al8, bl6)) | 0;\n    mid = (mid + Math.imul(al8, bh6)) | 0;\n    mid = (mid + Math.imul(ah8, bl6)) | 0;\n    hi = (hi + Math.imul(ah8, bh6)) | 0;\n    lo = (lo + Math.imul(al7, bl7)) | 0;\n    mid = (mid + Math.imul(al7, bh7)) | 0;\n    mid = (mid + Math.imul(ah7, bl7)) | 0;\n    hi = (hi + Math.imul(ah7, bh7)) | 0;\n    lo = (lo + Math.imul(al6, bl8)) | 0;\n    mid = (mid + Math.imul(al6, bh8)) | 0;\n    mid = (mid + Math.imul(ah6, bl8)) | 0;\n    hi = (hi + Math.imul(ah6, bh8)) | 0;\n    lo = (lo + Math.imul(al5, bl9)) | 0;\n    mid = (mid + Math.imul(al5, bh9)) | 0;\n    mid = (mid + Math.imul(ah5, bl9)) | 0;\n    hi = (hi + Math.imul(ah5, bh9)) | 0;\n    var w14 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0;\n    w14 &= 0x3ffffff;\n    /* k = 15 */\n    lo = Math.imul(al9, bl6);\n    mid = Math.imul(al9, bh6);\n    mid = (mid + Math.imul(ah9, bl6)) | 0;\n    hi = Math.imul(ah9, bh6);\n    lo = (lo + Math.imul(al8, bl7)) | 0;\n    mid = (mid + Math.imul(al8, bh7)) | 0;\n    mid = (mid + Math.imul(ah8, bl7)) | 0;\n    hi = (hi + Math.imul(ah8, bh7)) | 0;\n    lo = (lo + Math.imul(al7, bl8)) | 0;\n    mid = (mid + Math.imul(al7, bh8)) | 0;\n    mid = (mid + Math.imul(ah7, bl8)) | 0;\n    hi = (hi + Math.imul(ah7, bh8)) | 0;\n    lo = (lo + Math.imul(al6, bl9)) | 0;\n    mid = (mid + Math.imul(al6, bh9)) | 0;\n    mid = (mid + Math.imul(ah6, bl9)) | 0;\n    hi = (hi + Math.imul(ah6, bh9)) | 0;\n    var w15 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0;\n    w15 &= 0x3ffffff;\n    /* k = 16 */\n    lo = Math.imul(al9, bl7);\n    mid = Math.imul(al9, bh7);\n    mid = (mid + Math.imul(ah9, bl7)) | 0;\n    hi = Math.imul(ah9, bh7);\n    lo = (lo + Math.imul(al8, bl8)) | 0;\n    mid = (mid + Math.imul(al8, bh8)) | 0;\n    mid = (mid + Math.imul(ah8, bl8)) | 0;\n    hi = (hi + Math.imul(ah8, bh8)) | 0;\n    lo = (lo + Math.imul(al7, bl9)) | 0;\n    mid = (mid + Math.imul(al7, bh9)) | 0;\n    mid = (mid + Math.imul(ah7, bl9)) | 0;\n    hi = (hi + Math.imul(ah7, bh9)) | 0;\n    var w16 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0;\n    w16 &= 0x3ffffff;\n    /* k = 17 */\n    lo = Math.imul(al9, bl8);\n    mid = Math.imul(al9, bh8);\n    mid = (mid + Math.imul(ah9, bl8)) | 0;\n    hi = Math.imul(ah9, bh8);\n    lo = (lo + Math.imul(al8, bl9)) | 0;\n    mid = (mid + Math.imul(al8, bh9)) | 0;\n    mid = (mid + Math.imul(ah8, bl9)) | 0;\n    hi = (hi + Math.imul(ah8, bh9)) | 0;\n    var w17 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0;\n    w17 &= 0x3ffffff;\n    /* k = 18 */\n    lo = Math.imul(al9, bl9);\n    mid = Math.imul(al9, bh9);\n    mid = (mid + Math.imul(ah9, bl9)) | 0;\n    hi = Math.imul(ah9, bh9);\n    var w18 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0;\n    w18 &= 0x3ffffff;\n    o[0] = w0;\n    o[1] = w1;\n    o[2] = w2;\n    o[3] = w3;\n    o[4] = w4;\n    o[5] = w5;\n    o[6] = w6;\n    o[7] = w7;\n    o[8] = w8;\n    o[9] = w9;\n    o[10] = w10;\n    o[11] = w11;\n    o[12] = w12;\n    o[13] = w13;\n    o[14] = w14;\n    o[15] = w15;\n    o[16] = w16;\n    o[17] = w17;\n    o[18] = w18;\n    if (c !== 0) {\n      o[19] = c;\n      out.length++;\n    }\n    return out;\n  };\n\n  // Polyfill comb\n  if (!Math.imul) {\n    comb10MulTo = smallMulTo;\n  }\n\n  function bigMulTo (self, num, out) {\n    out.negative = num.negative ^ self.negative;\n    out.length = self.length + num.length;\n\n    var carry = 0;\n    var hncarry = 0;\n    for (var k = 0; k < out.length - 1; k++) {\n      // Sum all words with the same `i + j = k` and accumulate `ncarry`,\n      // note that ncarry could be >= 0x3ffffff\n      var ncarry = hncarry;\n      hncarry = 0;\n      var rword = carry & 0x3ffffff;\n      var maxJ = Math.min(k, num.length - 1);\n      for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) {\n        var i = k - j;\n        var a = self.words[i] | 0;\n        var b = num.words[j] | 0;\n        var r = a * b;\n\n        var lo = r & 0x3ffffff;\n        ncarry = (ncarry + ((r / 0x4000000) | 0)) | 0;\n        lo = (lo + rword) | 0;\n        rword = lo & 0x3ffffff;\n        ncarry = (ncarry + (lo >>> 26)) | 0;\n\n        hncarry += ncarry >>> 26;\n        ncarry &= 0x3ffffff;\n      }\n      out.words[k] = rword;\n      carry = ncarry;\n      ncarry = hncarry;\n    }\n    if (carry !== 0) {\n      out.words[k] = carry;\n    } else {\n      out.length--;\n    }\n\n    return out._strip();\n  }\n\n  function jumboMulTo (self, num, out) {\n    // Temporary disable, see https://github.com/indutny/bn.js/issues/211\n    // var fftm = new FFTM();\n    // return fftm.mulp(self, num, out);\n    return bigMulTo(self, num, out);\n  }\n\n  BN.prototype.mulTo = function mulTo (num, out) {\n    var res;\n    var len = this.length + num.length;\n    if (this.length === 10 && num.length === 10) {\n      res = comb10MulTo(this, num, out);\n    } else if (len < 63) {\n      res = smallMulTo(this, num, out);\n    } else if (len < 1024) {\n      res = bigMulTo(this, num, out);\n    } else {\n      res = jumboMulTo(this, num, out);\n    }\n\n    return res;\n  };\n\n  // Cooley-Tukey algorithm for FFT\n  // slightly revisited to rely on looping instead of recursion\n\n  function FFTM (x, y) {\n    this.x = x;\n    this.y = y;\n  }\n\n  FFTM.prototype.makeRBT = function makeRBT (N) {\n    var t = new Array(N);\n    var l = BN.prototype._countBits(N) - 1;\n    for (var i = 0; i < N; i++) {\n      t[i] = this.revBin(i, l, N);\n    }\n\n    return t;\n  };\n\n  // Returns binary-reversed representation of `x`\n  FFTM.prototype.revBin = function revBin (x, l, N) {\n    if (x === 0 || x === N - 1) return x;\n\n    var rb = 0;\n    for (var i = 0; i < l; i++) {\n      rb |= (x & 1) << (l - i - 1);\n      x >>= 1;\n    }\n\n    return rb;\n  };\n\n  // Performs \"tweedling\" phase, therefore 'emulating'\n  // behaviour of the recursive algorithm\n  FFTM.prototype.permute = function permute (rbt, rws, iws, rtws, itws, N) {\n    for (var i = 0; i < N; i++) {\n      rtws[i] = rws[rbt[i]];\n      itws[i] = iws[rbt[i]];\n    }\n  };\n\n  FFTM.prototype.transform = function transform (rws, iws, rtws, itws, N, rbt) {\n    this.permute(rbt, rws, iws, rtws, itws, N);\n\n    for (var s = 1; s < N; s <<= 1) {\n      var l = s << 1;\n\n      var rtwdf = Math.cos(2 * Math.PI / l);\n      var itwdf = Math.sin(2 * Math.PI / l);\n\n      for (var p = 0; p < N; p += l) {\n        var rtwdf_ = rtwdf;\n        var itwdf_ = itwdf;\n\n        for (var j = 0; j < s; j++) {\n          var re = rtws[p + j];\n          var ie = itws[p + j];\n\n          var ro = rtws[p + j + s];\n          var io = itws[p + j + s];\n\n          var rx = rtwdf_ * ro - itwdf_ * io;\n\n          io = rtwdf_ * io + itwdf_ * ro;\n          ro = rx;\n\n          rtws[p + j] = re + ro;\n          itws[p + j] = ie + io;\n\n          rtws[p + j + s] = re - ro;\n          itws[p + j + s] = ie - io;\n\n          /* jshint maxdepth : false */\n          if (j !== l) {\n            rx = rtwdf * rtwdf_ - itwdf * itwdf_;\n\n            itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_;\n            rtwdf_ = rx;\n          }\n        }\n      }\n    }\n  };\n\n  FFTM.prototype.guessLen13b = function guessLen13b (n, m) {\n    var N = Math.max(m, n) | 1;\n    var odd = N & 1;\n    var i = 0;\n    for (N = N / 2 | 0; N; N = N >>> 1) {\n      i++;\n    }\n\n    return 1 << i + 1 + odd;\n  };\n\n  FFTM.prototype.conjugate = function conjugate (rws, iws, N) {\n    if (N <= 1) return;\n\n    for (var i = 0; i < N / 2; i++) {\n      var t = rws[i];\n\n      rws[i] = rws[N - i - 1];\n      rws[N - i - 1] = t;\n\n      t = iws[i];\n\n      iws[i] = -iws[N - i - 1];\n      iws[N - i - 1] = -t;\n    }\n  };\n\n  FFTM.prototype.normalize13b = function normalize13b (ws, N) {\n    var carry = 0;\n    for (var i = 0; i < N / 2; i++) {\n      var w = Math.round(ws[2 * i + 1] / N) * 0x2000 +\n        Math.round(ws[2 * i] / N) +\n        carry;\n\n      ws[i] = w & 0x3ffffff;\n\n      if (w < 0x4000000) {\n        carry = 0;\n      } else {\n        carry = w / 0x4000000 | 0;\n      }\n    }\n\n    return ws;\n  };\n\n  FFTM.prototype.convert13b = function convert13b (ws, len, rws, N) {\n    var carry = 0;\n    for (var i = 0; i < len; i++) {\n      carry = carry + (ws[i] | 0);\n\n      rws[2 * i] = carry & 0x1fff; carry = carry >>> 13;\n      rws[2 * i + 1] = carry & 0x1fff; carry = carry >>> 13;\n    }\n\n    // Pad with zeroes\n    for (i = 2 * len; i < N; ++i) {\n      rws[i] = 0;\n    }\n\n    assert(carry === 0);\n    assert((carry & ~0x1fff) === 0);\n  };\n\n  FFTM.prototype.stub = function stub (N) {\n    var ph = new Array(N);\n    for (var i = 0; i < N; i++) {\n      ph[i] = 0;\n    }\n\n    return ph;\n  };\n\n  FFTM.prototype.mulp = function mulp (x, y, out) {\n    var N = 2 * this.guessLen13b(x.length, y.length);\n\n    var rbt = this.makeRBT(N);\n\n    var _ = this.stub(N);\n\n    var rws = new Array(N);\n    var rwst = new Array(N);\n    var iwst = new Array(N);\n\n    var nrws = new Array(N);\n    var nrwst = new Array(N);\n    var niwst = new Array(N);\n\n    var rmws = out.words;\n    rmws.length = N;\n\n    this.convert13b(x.words, x.length, rws, N);\n    this.convert13b(y.words, y.length, nrws, N);\n\n    this.transform(rws, _, rwst, iwst, N, rbt);\n    this.transform(nrws, _, nrwst, niwst, N, rbt);\n\n    for (var i = 0; i < N; i++) {\n      var rx = rwst[i] * nrwst[i] - iwst[i] * niwst[i];\n      iwst[i] = rwst[i] * niwst[i] + iwst[i] * nrwst[i];\n      rwst[i] = rx;\n    }\n\n    this.conjugate(rwst, iwst, N);\n    this.transform(rwst, iwst, rmws, _, N, rbt);\n    this.conjugate(rmws, _, N);\n    this.normalize13b(rmws, N);\n\n    out.negative = x.negative ^ y.negative;\n    out.length = x.length + y.length;\n    return out._strip();\n  };\n\n  // Multiply `this` by `num`\n  BN.prototype.mul = function mul (num) {\n    var out = new BN(null);\n    out.words = new Array(this.length + num.length);\n    return this.mulTo(num, out);\n  };\n\n  // Multiply employing FFT\n  BN.prototype.mulf = function mulf (num) {\n    var out = new BN(null);\n    out.words = new Array(this.length + num.length);\n    return jumboMulTo(this, num, out);\n  };\n\n  // In-place Multiplication\n  BN.prototype.imul = function imul (num) {\n    return this.clone().mulTo(num, this);\n  };\n\n  BN.prototype.imuln = function imuln (num) {\n    var isNegNum = num < 0;\n    if (isNegNum) num = -num;\n\n    assert(typeof num === 'number');\n    assert(num < 0x4000000);\n\n    // Carry\n    var carry = 0;\n    for (var i = 0; i < this.length; i++) {\n      var w = (this.words[i] | 0) * num;\n      var lo = (w & 0x3ffffff) + (carry & 0x3ffffff);\n      carry >>= 26;\n      carry += (w / 0x4000000) | 0;\n      // NOTE: lo is 27bit maximum\n      carry += lo >>> 26;\n      this.words[i] = lo & 0x3ffffff;\n    }\n\n    if (carry !== 0) {\n      this.words[i] = carry;\n      this.length++;\n    }\n\n    return isNegNum ? this.ineg() : this;\n  };\n\n  BN.prototype.muln = function muln (num) {\n    return this.clone().imuln(num);\n  };\n\n  // `this` * `this`\n  BN.prototype.sqr = function sqr () {\n    return this.mul(this);\n  };\n\n  // `this` * `this` in-place\n  BN.prototype.isqr = function isqr () {\n    return this.imul(this.clone());\n  };\n\n  // Math.pow(`this`, `num`)\n  BN.prototype.pow = function pow (num) {\n    var w = toBitArray(num);\n    if (w.length === 0) return new BN(1);\n\n    // Skip leading zeroes\n    var res = this;\n    for (var i = 0; i < w.length; i++, res = res.sqr()) {\n      if (w[i] !== 0) break;\n    }\n\n    if (++i < w.length) {\n      for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) {\n        if (w[i] === 0) continue;\n\n        res = res.mul(q);\n      }\n    }\n\n    return res;\n  };\n\n  // Shift-left in-place\n  BN.prototype.iushln = function iushln (bits) {\n    assert(typeof bits === 'number' && bits >= 0);\n    var r = bits % 26;\n    var s = (bits - r) / 26;\n    var carryMask = (0x3ffffff >>> (26 - r)) << (26 - r);\n    var i;\n\n    if (r !== 0) {\n      var carry = 0;\n\n      for (i = 0; i < this.length; i++) {\n        var newCarry = this.words[i] & carryMask;\n        var c = ((this.words[i] | 0) - newCarry) << r;\n        this.words[i] = c | carry;\n        carry = newCarry >>> (26 - r);\n      }\n\n      if (carry) {\n        this.words[i] = carry;\n        this.length++;\n      }\n    }\n\n    if (s !== 0) {\n      for (i = this.length - 1; i >= 0; i--) {\n        this.words[i + s] = this.words[i];\n      }\n\n      for (i = 0; i < s; i++) {\n        this.words[i] = 0;\n      }\n\n      this.length += s;\n    }\n\n    return this._strip();\n  };\n\n  BN.prototype.ishln = function ishln (bits) {\n    // TODO(indutny): implement me\n    assert(this.negative === 0);\n    return this.iushln(bits);\n  };\n\n  // Shift-right in-place\n  // NOTE: `hint` is a lowest bit before trailing zeroes\n  // NOTE: if `extended` is present - it will be filled with destroyed bits\n  BN.prototype.iushrn = function iushrn (bits, hint, extended) {\n    assert(typeof bits === 'number' && bits >= 0);\n    var h;\n    if (hint) {\n      h = (hint - (hint % 26)) / 26;\n    } else {\n      h = 0;\n    }\n\n    var r = bits % 26;\n    var s = Math.min((bits - r) / 26, this.length);\n    var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r);\n    var maskedWords = extended;\n\n    h -= s;\n    h = Math.max(0, h);\n\n    // Extended mode, copy masked part\n    if (maskedWords) {\n      for (var i = 0; i < s; i++) {\n        maskedWords.words[i] = this.words[i];\n      }\n      maskedWords.length = s;\n    }\n\n    if (s === 0) {\n      // No-op, we should not move anything at all\n    } else if (this.length > s) {\n      this.length -= s;\n      for (i = 0; i < this.length; i++) {\n        this.words[i] = this.words[i + s];\n      }\n    } else {\n      this.words[0] = 0;\n      this.length = 1;\n    }\n\n    var carry = 0;\n    for (i = this.length - 1; i >= 0 && (carry !== 0 || i >= h); i--) {\n      var word = this.words[i] | 0;\n      this.words[i] = (carry << (26 - r)) | (word >>> r);\n      carry = word & mask;\n    }\n\n    // Push carried bits as a mask\n    if (maskedWords && carry !== 0) {\n      maskedWords.words[maskedWords.length++] = carry;\n    }\n\n    if (this.length === 0) {\n      this.words[0] = 0;\n      this.length = 1;\n    }\n\n    return this._strip();\n  };\n\n  BN.prototype.ishrn = function ishrn (bits, hint, extended) {\n    // TODO(indutny): implement me\n    assert(this.negative === 0);\n    return this.iushrn(bits, hint, extended);\n  };\n\n  // Shift-left\n  BN.prototype.shln = function shln (bits) {\n    return this.clone().ishln(bits);\n  };\n\n  BN.prototype.ushln = function ushln (bits) {\n    return this.clone().iushln(bits);\n  };\n\n  // Shift-right\n  BN.prototype.shrn = function shrn (bits) {\n    return this.clone().ishrn(bits);\n  };\n\n  BN.prototype.ushrn = function ushrn (bits) {\n    return this.clone().iushrn(bits);\n  };\n\n  // Test if n bit is set\n  BN.prototype.testn = function testn (bit) {\n    assert(typeof bit === 'number' && bit >= 0);\n    var r = bit % 26;\n    var s = (bit - r) / 26;\n    var q = 1 << r;\n\n    // Fast case: bit is much higher than all existing words\n    if (this.length <= s) return false;\n\n    // Check bit and return\n    var w = this.words[s];\n\n    return !!(w & q);\n  };\n\n  // Return only lowers bits of number (in-place)\n  BN.prototype.imaskn = function imaskn (bits) {\n    assert(typeof bits === 'number' && bits >= 0);\n    var r = bits % 26;\n    var s = (bits - r) / 26;\n\n    assert(this.negative === 0, 'imaskn works only with positive numbers');\n\n    if (this.length <= s) {\n      return this;\n    }\n\n    if (r !== 0) {\n      s++;\n    }\n    this.length = Math.min(s, this.length);\n\n    if (r !== 0) {\n      var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r);\n      this.words[this.length - 1] &= mask;\n    }\n\n    return this._strip();\n  };\n\n  // Return only lowers bits of number\n  BN.prototype.maskn = function maskn (bits) {\n    return this.clone().imaskn(bits);\n  };\n\n  // Add plain number `num` to `this`\n  BN.prototype.iaddn = function iaddn (num) {\n    assert(typeof num === 'number');\n    assert(num < 0x4000000);\n    if (num < 0) return this.isubn(-num);\n\n    // Possible sign change\n    if (this.negative !== 0) {\n      if (this.length === 1 && (this.words[0] | 0) <= num) {\n        this.words[0] = num - (this.words[0] | 0);\n        this.negative = 0;\n        return this;\n      }\n\n      this.negative = 0;\n      this.isubn(num);\n      this.negative = 1;\n      return this;\n    }\n\n    // Add without checks\n    return this._iaddn(num);\n  };\n\n  BN.prototype._iaddn = function _iaddn (num) {\n    this.words[0] += num;\n\n    // Carry\n    for (var i = 0; i < this.length && this.words[i] >= 0x4000000; i++) {\n      this.words[i] -= 0x4000000;\n      if (i === this.length - 1) {\n        this.words[i + 1] = 1;\n      } else {\n        this.words[i + 1]++;\n      }\n    }\n    this.length = Math.max(this.length, i + 1);\n\n    return this;\n  };\n\n  // Subtract plain number `num` from `this`\n  BN.prototype.isubn = function isubn (num) {\n    assert(typeof num === 'number');\n    assert(num < 0x4000000);\n    if (num < 0) return this.iaddn(-num);\n\n    if (this.negative !== 0) {\n      this.negative = 0;\n      this.iaddn(num);\n      this.negative = 1;\n      return this;\n    }\n\n    this.words[0] -= num;\n\n    if (this.length === 1 && this.words[0] < 0) {\n      this.words[0] = -this.words[0];\n      this.negative = 1;\n    } else {\n      // Carry\n      for (var i = 0; i < this.length && this.words[i] < 0; i++) {\n        this.words[i] += 0x4000000;\n        this.words[i + 1] -= 1;\n      }\n    }\n\n    return this._strip();\n  };\n\n  BN.prototype.addn = function addn (num) {\n    return this.clone().iaddn(num);\n  };\n\n  BN.prototype.subn = function subn (num) {\n    return this.clone().isubn(num);\n  };\n\n  BN.prototype.iabs = function iabs () {\n    this.negative = 0;\n\n    return this;\n  };\n\n  BN.prototype.abs = function abs () {\n    return this.clone().iabs();\n  };\n\n  BN.prototype._ishlnsubmul = function _ishlnsubmul (num, mul, shift) {\n    var len = num.length + shift;\n    var i;\n\n    this._expand(len);\n\n    var w;\n    var carry = 0;\n    for (i = 0; i < num.length; i++) {\n      w = (this.words[i + shift] | 0) + carry;\n      var right = (num.words[i] | 0) * mul;\n      w -= right & 0x3ffffff;\n      carry = (w >> 26) - ((right / 0x4000000) | 0);\n      this.words[i + shift] = w & 0x3ffffff;\n    }\n    for (; i < this.length - shift; i++) {\n      w = (this.words[i + shift] | 0) + carry;\n      carry = w >> 26;\n      this.words[i + shift] = w & 0x3ffffff;\n    }\n\n    if (carry === 0) return this._strip();\n\n    // Subtraction overflow\n    assert(carry === -1);\n    carry = 0;\n    for (i = 0; i < this.length; i++) {\n      w = -(this.words[i] | 0) + carry;\n      carry = w >> 26;\n      this.words[i] = w & 0x3ffffff;\n    }\n    this.negative = 1;\n\n    return this._strip();\n  };\n\n  BN.prototype._wordDiv = function _wordDiv (num, mode) {\n    var shift = this.length - num.length;\n\n    var a = this.clone();\n    var b = num;\n\n    // Normalize\n    var bhi = b.words[b.length - 1] | 0;\n    var bhiBits = this._countBits(bhi);\n    shift = 26 - bhiBits;\n    if (shift !== 0) {\n      b = b.ushln(shift);\n      a.iushln(shift);\n      bhi = b.words[b.length - 1] | 0;\n    }\n\n    // Initialize quotient\n    var m = a.length - b.length;\n    var q;\n\n    if (mode !== 'mod') {\n      q = new BN(null);\n      q.length = m + 1;\n      q.words = new Array(q.length);\n      for (var i = 0; i < q.length; i++) {\n        q.words[i] = 0;\n      }\n    }\n\n    var diff = a.clone()._ishlnsubmul(b, 1, m);\n    if (diff.negative === 0) {\n      a = diff;\n      if (q) {\n        q.words[m] = 1;\n      }\n    }\n\n    for (var j = m - 1; j >= 0; j--) {\n      var qj = (a.words[b.length + j] | 0) * 0x4000000 +\n        (a.words[b.length + j - 1] | 0);\n\n      // NOTE: (qj / bhi) is (0x3ffffff * 0x4000000 + 0x3ffffff) / 0x2000000 max\n      // (0x7ffffff)\n      qj = Math.min((qj / bhi) | 0, 0x3ffffff);\n\n      a._ishlnsubmul(b, qj, j);\n      while (a.negative !== 0) {\n        qj--;\n        a.negative = 0;\n        a._ishlnsubmul(b, 1, j);\n        if (!a.isZero()) {\n          a.negative ^= 1;\n        }\n      }\n      if (q) {\n        q.words[j] = qj;\n      }\n    }\n    if (q) {\n      q._strip();\n    }\n    a._strip();\n\n    // Denormalize\n    if (mode !== 'div' && shift !== 0) {\n      a.iushrn(shift);\n    }\n\n    return {\n      div: q || null,\n      mod: a\n    };\n  };\n\n  // NOTE: 1) `mode` can be set to `mod` to request mod only,\n  //       to `div` to request div only, or be absent to\n  //       request both div & mod\n  //       2) `positive` is true if unsigned mod is requested\n  BN.prototype.divmod = function divmod (num, mode, positive) {\n    assert(!num.isZero());\n\n    if (this.isZero()) {\n      return {\n        div: new BN(0),\n        mod: new BN(0)\n      };\n    }\n\n    var div, mod, res;\n    if (this.negative !== 0 && num.negative === 0) {\n      res = this.neg().divmod(num, mode);\n\n      if (mode !== 'mod') {\n        div = res.div.neg();\n      }\n\n      if (mode !== 'div') {\n        mod = res.mod.neg();\n        if (positive && mod.negative !== 0) {\n          mod.iadd(num);\n        }\n      }\n\n      return {\n        div: div,\n        mod: mod\n      };\n    }\n\n    if (this.negative === 0 && num.negative !== 0) {\n      res = this.divmod(num.neg(), mode);\n\n      if (mode !== 'mod') {\n        div = res.div.neg();\n      }\n\n      return {\n        div: div,\n        mod: res.mod\n      };\n    }\n\n    if ((this.negative & num.negative) !== 0) {\n      res = this.neg().divmod(num.neg(), mode);\n\n      if (mode !== 'div') {\n        mod = res.mod.neg();\n        if (positive && mod.negative !== 0) {\n          mod.isub(num);\n        }\n      }\n\n      return {\n        div: res.div,\n        mod: mod\n      };\n    }\n\n    // Both numbers are positive at this point\n\n    // Strip both numbers to approximate shift value\n    if (num.length > this.length || this.cmp(num) < 0) {\n      return {\n        div: new BN(0),\n        mod: this\n      };\n    }\n\n    // Very short reduction\n    if (num.length === 1) {\n      if (mode === 'div') {\n        return {\n          div: this.divn(num.words[0]),\n          mod: null\n        };\n      }\n\n      if (mode === 'mod') {\n        return {\n          div: null,\n          mod: new BN(this.modrn(num.words[0]))\n        };\n      }\n\n      return {\n        div: this.divn(num.words[0]),\n        mod: new BN(this.modrn(num.words[0]))\n      };\n    }\n\n    return this._wordDiv(num, mode);\n  };\n\n  // Find `this` / `num`\n  BN.prototype.div = function div (num) {\n    return this.divmod(num, 'div', false).div;\n  };\n\n  // Find `this` % `num`\n  BN.prototype.mod = function mod (num) {\n    return this.divmod(num, 'mod', false).mod;\n  };\n\n  BN.prototype.umod = function umod (num) {\n    return this.divmod(num, 'mod', true).mod;\n  };\n\n  // Find Round(`this` / `num`)\n  BN.prototype.divRound = function divRound (num) {\n    var dm = this.divmod(num);\n\n    // Fast case - exact division\n    if (dm.mod.isZero()) return dm.div;\n\n    var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod;\n\n    var half = num.ushrn(1);\n    var r2 = num.andln(1);\n    var cmp = mod.cmp(half);\n\n    // Round down\n    if (cmp < 0 || (r2 === 1 && cmp === 0)) return dm.div;\n\n    // Round up\n    return dm.div.negative !== 0 ? dm.div.isubn(1) : dm.div.iaddn(1);\n  };\n\n  BN.prototype.modrn = function modrn (num) {\n    var isNegNum = num < 0;\n    if (isNegNum) num = -num;\n\n    assert(num <= 0x3ffffff);\n    var p = (1 << 26) % num;\n\n    var acc = 0;\n    for (var i = this.length - 1; i >= 0; i--) {\n      acc = (p * acc + (this.words[i] | 0)) % num;\n    }\n\n    return isNegNum ? -acc : acc;\n  };\n\n  // WARNING: DEPRECATED\n  BN.prototype.modn = function modn (num) {\n    return this.modrn(num);\n  };\n\n  // In-place division by number\n  BN.prototype.idivn = function idivn (num) {\n    var isNegNum = num < 0;\n    if (isNegNum) num = -num;\n\n    assert(num <= 0x3ffffff);\n\n    var carry = 0;\n    for (var i = this.length - 1; i >= 0; i--) {\n      var w = (this.words[i] | 0) + carry * 0x4000000;\n      this.words[i] = (w / num) | 0;\n      carry = w % num;\n    }\n\n    this._strip();\n    return isNegNum ? this.ineg() : this;\n  };\n\n  BN.prototype.divn = function divn (num) {\n    return this.clone().idivn(num);\n  };\n\n  BN.prototype.egcd = function egcd (p) {\n    assert(p.negative === 0);\n    assert(!p.isZero());\n\n    var x = this;\n    var y = p.clone();\n\n    if (x.negative !== 0) {\n      x = x.umod(p);\n    } else {\n      x = x.clone();\n    }\n\n    // A * x + B * y = x\n    var A = new BN(1);\n    var B = new BN(0);\n\n    // C * x + D * y = y\n    var C = new BN(0);\n    var D = new BN(1);\n\n    var g = 0;\n\n    while (x.isEven() && y.isEven()) {\n      x.iushrn(1);\n      y.iushrn(1);\n      ++g;\n    }\n\n    var yp = y.clone();\n    var xp = x.clone();\n\n    while (!x.isZero()) {\n      for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n      if (i > 0) {\n        x.iushrn(i);\n        while (i-- > 0) {\n          if (A.isOdd() || B.isOdd()) {\n            A.iadd(yp);\n            B.isub(xp);\n          }\n\n          A.iushrn(1);\n          B.iushrn(1);\n        }\n      }\n\n      for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n      if (j > 0) {\n        y.iushrn(j);\n        while (j-- > 0) {\n          if (C.isOdd() || D.isOdd()) {\n            C.iadd(yp);\n            D.isub(xp);\n          }\n\n          C.iushrn(1);\n          D.iushrn(1);\n        }\n      }\n\n      if (x.cmp(y) >= 0) {\n        x.isub(y);\n        A.isub(C);\n        B.isub(D);\n      } else {\n        y.isub(x);\n        C.isub(A);\n        D.isub(B);\n      }\n    }\n\n    return {\n      a: C,\n      b: D,\n      gcd: y.iushln(g)\n    };\n  };\n\n  // This is reduced incarnation of the binary EEA\n  // above, designated to invert members of the\n  // _prime_ fields F(p) at a maximal speed\n  BN.prototype._invmp = function _invmp (p) {\n    assert(p.negative === 0);\n    assert(!p.isZero());\n\n    var a = this;\n    var b = p.clone();\n\n    if (a.negative !== 0) {\n      a = a.umod(p);\n    } else {\n      a = a.clone();\n    }\n\n    var x1 = new BN(1);\n    var x2 = new BN(0);\n\n    var delta = b.clone();\n\n    while (a.cmpn(1) > 0 && b.cmpn(1) > 0) {\n      for (var i = 0, im = 1; (a.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n      if (i > 0) {\n        a.iushrn(i);\n        while (i-- > 0) {\n          if (x1.isOdd()) {\n            x1.iadd(delta);\n          }\n\n          x1.iushrn(1);\n        }\n      }\n\n      for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n      if (j > 0) {\n        b.iushrn(j);\n        while (j-- > 0) {\n          if (x2.isOdd()) {\n            x2.iadd(delta);\n          }\n\n          x2.iushrn(1);\n        }\n      }\n\n      if (a.cmp(b) >= 0) {\n        a.isub(b);\n        x1.isub(x2);\n      } else {\n        b.isub(a);\n        x2.isub(x1);\n      }\n    }\n\n    var res;\n    if (a.cmpn(1) === 0) {\n      res = x1;\n    } else {\n      res = x2;\n    }\n\n    if (res.cmpn(0) < 0) {\n      res.iadd(p);\n    }\n\n    return res;\n  };\n\n  BN.prototype.gcd = function gcd (num) {\n    if (this.isZero()) return num.abs();\n    if (num.isZero()) return this.abs();\n\n    var a = this.clone();\n    var b = num.clone();\n    a.negative = 0;\n    b.negative = 0;\n\n    // Remove common factor of two\n    for (var shift = 0; a.isEven() && b.isEven(); shift++) {\n      a.iushrn(1);\n      b.iushrn(1);\n    }\n\n    do {\n      while (a.isEven()) {\n        a.iushrn(1);\n      }\n      while (b.isEven()) {\n        b.iushrn(1);\n      }\n\n      var r = a.cmp(b);\n      if (r < 0) {\n        // Swap `a` and `b` to make `a` always bigger than `b`\n        var t = a;\n        a = b;\n        b = t;\n      } else if (r === 0 || b.cmpn(1) === 0) {\n        break;\n      }\n\n      a.isub(b);\n    } while (true);\n\n    return b.iushln(shift);\n  };\n\n  // Invert number in the field F(num)\n  BN.prototype.invm = function invm (num) {\n    return this.egcd(num).a.umod(num);\n  };\n\n  BN.prototype.isEven = function isEven () {\n    return (this.words[0] & 1) === 0;\n  };\n\n  BN.prototype.isOdd = function isOdd () {\n    return (this.words[0] & 1) === 1;\n  };\n\n  // And first word and num\n  BN.prototype.andln = function andln (num) {\n    return this.words[0] & num;\n  };\n\n  // Increment at the bit position in-line\n  BN.prototype.bincn = function bincn (bit) {\n    assert(typeof bit === 'number');\n    var r = bit % 26;\n    var s = (bit - r) / 26;\n    var q = 1 << r;\n\n    // Fast case: bit is much higher than all existing words\n    if (this.length <= s) {\n      this._expand(s + 1);\n      this.words[s] |= q;\n      return this;\n    }\n\n    // Add bit and propagate, if needed\n    var carry = q;\n    for (var i = s; carry !== 0 && i < this.length; i++) {\n      var w = this.words[i] | 0;\n      w += carry;\n      carry = w >>> 26;\n      w &= 0x3ffffff;\n      this.words[i] = w;\n    }\n    if (carry !== 0) {\n      this.words[i] = carry;\n      this.length++;\n    }\n    return this;\n  };\n\n  BN.prototype.isZero = function isZero () {\n    return this.length === 1 && this.words[0] === 0;\n  };\n\n  BN.prototype.cmpn = function cmpn (num) {\n    var negative = num < 0;\n\n    if (this.negative !== 0 && !negative) return -1;\n    if (this.negative === 0 && negative) return 1;\n\n    this._strip();\n\n    var res;\n    if (this.length > 1) {\n      res = 1;\n    } else {\n      if (negative) {\n        num = -num;\n      }\n\n      assert(num <= 0x3ffffff, 'Number is too big');\n\n      var w = this.words[0] | 0;\n      res = w === num ? 0 : w < num ? -1 : 1;\n    }\n    if (this.negative !== 0) return -res | 0;\n    return res;\n  };\n\n  // Compare two numbers and return:\n  // 1 - if `this` > `num`\n  // 0 - if `this` == `num`\n  // -1 - if `this` < `num`\n  BN.prototype.cmp = function cmp (num) {\n    if (this.negative !== 0 && num.negative === 0) return -1;\n    if (this.negative === 0 && num.negative !== 0) return 1;\n\n    var res = this.ucmp(num);\n    if (this.negative !== 0) return -res | 0;\n    return res;\n  };\n\n  // Unsigned comparison\n  BN.prototype.ucmp = function ucmp (num) {\n    // At this point both numbers have the same sign\n    if (this.length > num.length) return 1;\n    if (this.length < num.length) return -1;\n\n    var res = 0;\n    for (var i = this.length - 1; i >= 0; i--) {\n      var a = this.words[i] | 0;\n      var b = num.words[i] | 0;\n\n      if (a === b) continue;\n      if (a < b) {\n        res = -1;\n      } else if (a > b) {\n        res = 1;\n      }\n      break;\n    }\n    return res;\n  };\n\n  BN.prototype.gtn = function gtn (num) {\n    return this.cmpn(num) === 1;\n  };\n\n  BN.prototype.gt = function gt (num) {\n    return this.cmp(num) === 1;\n  };\n\n  BN.prototype.gten = function gten (num) {\n    return this.cmpn(num) >= 0;\n  };\n\n  BN.prototype.gte = function gte (num) {\n    return this.cmp(num) >= 0;\n  };\n\n  BN.prototype.ltn = function ltn (num) {\n    return this.cmpn(num) === -1;\n  };\n\n  BN.prototype.lt = function lt (num) {\n    return this.cmp(num) === -1;\n  };\n\n  BN.prototype.lten = function lten (num) {\n    return this.cmpn(num) <= 0;\n  };\n\n  BN.prototype.lte = function lte (num) {\n    return this.cmp(num) <= 0;\n  };\n\n  BN.prototype.eqn = function eqn (num) {\n    return this.cmpn(num) === 0;\n  };\n\n  BN.prototype.eq = function eq (num) {\n    return this.cmp(num) === 0;\n  };\n\n  //\n  // A reduce context, could be using montgomery or something better, depending\n  // on the `m` itself.\n  //\n  BN.red = function red (num) {\n    return new Red(num);\n  };\n\n  BN.prototype.toRed = function toRed (ctx) {\n    assert(!this.red, 'Already a number in reduction context');\n    assert(this.negative === 0, 'red works only with positives');\n    return ctx.convertTo(this)._forceRed(ctx);\n  };\n\n  BN.prototype.fromRed = function fromRed () {\n    assert(this.red, 'fromRed works only with numbers in reduction context');\n    return this.red.convertFrom(this);\n  };\n\n  BN.prototype._forceRed = function _forceRed (ctx) {\n    this.red = ctx;\n    return this;\n  };\n\n  BN.prototype.forceRed = function forceRed (ctx) {\n    assert(!this.red, 'Already a number in reduction context');\n    return this._forceRed(ctx);\n  };\n\n  BN.prototype.redAdd = function redAdd (num) {\n    assert(this.red, 'redAdd works only with red numbers');\n    return this.red.add(this, num);\n  };\n\n  BN.prototype.redIAdd = function redIAdd (num) {\n    assert(this.red, 'redIAdd works only with red numbers');\n    return this.red.iadd(this, num);\n  };\n\n  BN.prototype.redSub = function redSub (num) {\n    assert(this.red, 'redSub works only with red numbers');\n    return this.red.sub(this, num);\n  };\n\n  BN.prototype.redISub = function redISub (num) {\n    assert(this.red, 'redISub works only with red numbers');\n    return this.red.isub(this, num);\n  };\n\n  BN.prototype.redShl = function redShl (num) {\n    assert(this.red, 'redShl works only with red numbers');\n    return this.red.shl(this, num);\n  };\n\n  BN.prototype.redMul = function redMul (num) {\n    assert(this.red, 'redMul works only with red numbers');\n    this.red._verify2(this, num);\n    return this.red.mul(this, num);\n  };\n\n  BN.prototype.redIMul = function redIMul (num) {\n    assert(this.red, 'redMul works only with red numbers');\n    this.red._verify2(this, num);\n    return this.red.imul(this, num);\n  };\n\n  BN.prototype.redSqr = function redSqr () {\n    assert(this.red, 'redSqr works only with red numbers');\n    this.red._verify1(this);\n    return this.red.sqr(this);\n  };\n\n  BN.prototype.redISqr = function redISqr () {\n    assert(this.red, 'redISqr works only with red numbers');\n    this.red._verify1(this);\n    return this.red.isqr(this);\n  };\n\n  // Square root over p\n  BN.prototype.redSqrt = function redSqrt () {\n    assert(this.red, 'redSqrt works only with red numbers');\n    this.red._verify1(this);\n    return this.red.sqrt(this);\n  };\n\n  BN.prototype.redInvm = function redInvm () {\n    assert(this.red, 'redInvm works only with red numbers');\n    this.red._verify1(this);\n    return this.red.invm(this);\n  };\n\n  // Return negative clone of `this` % `red modulo`\n  BN.prototype.redNeg = function redNeg () {\n    assert(this.red, 'redNeg works only with red numbers');\n    this.red._verify1(this);\n    return this.red.neg(this);\n  };\n\n  BN.prototype.redPow = function redPow (num) {\n    assert(this.red && !num.red, 'redPow(normalNum)');\n    this.red._verify1(this);\n    return this.red.pow(this, num);\n  };\n\n  // Prime numbers with efficient reduction\n  var primes = {\n    k256: null,\n    p224: null,\n    p192: null,\n    p25519: null\n  };\n\n  // Pseudo-Mersenne prime\n  function MPrime (name, p) {\n    // P = 2 ^ N - K\n    this.name = name;\n    this.p = new BN(p, 16);\n    this.n = this.p.bitLength();\n    this.k = new BN(1).iushln(this.n).isub(this.p);\n\n    this.tmp = this._tmp();\n  }\n\n  MPrime.prototype._tmp = function _tmp () {\n    var tmp = new BN(null);\n    tmp.words = new Array(Math.ceil(this.n / 13));\n    return tmp;\n  };\n\n  MPrime.prototype.ireduce = function ireduce (num) {\n    // Assumes that `num` is less than `P^2`\n    // num = HI * (2 ^ N - K) + HI * K + LO = HI * K + LO (mod P)\n    var r = num;\n    var rlen;\n\n    do {\n      this.split(r, this.tmp);\n      r = this.imulK(r);\n      r = r.iadd(this.tmp);\n      rlen = r.bitLength();\n    } while (rlen > this.n);\n\n    var cmp = rlen < this.n ? -1 : r.ucmp(this.p);\n    if (cmp === 0) {\n      r.words[0] = 0;\n      r.length = 1;\n    } else if (cmp > 0) {\n      r.isub(this.p);\n    } else {\n      r._strip();\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","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n'use strict';\n\nmodule.exports = Readable;\n/*<replacement>*/\n\nvar Duplex;\n/*</replacement>*/\n\nReadable.ReadableState = ReadableState;\n/*<replacement>*/\n\nvar EE = require('events').EventEmitter;\n\nvar EElistenerCount = function EElistenerCount(emitter, type) {\n  return emitter.listeners(type).length;\n};\n/*</replacement>*/\n\n/*<replacement>*/\n\n\nvar Stream = require('./internal/streams/stream');\n/*</replacement>*/\n\n\nvar Buffer = require('buffer').Buffer;\n\nvar OurUint8Array = global.Uint8Array || function () {};\n\nfunction _uint8ArrayToBuffer(chunk) {\n  return Buffer.from(chunk);\n}\n\nfunction _isUint8Array(obj) {\n  return Buffer.isBuffer(obj) || obj instanceof OurUint8Array;\n}\n/*<replacement>*/\n\n\nvar debugUtil = require('util');\n\nvar debug;\n\nif (debugUtil && debugUtil.debuglog) {\n  debug = debugUtil.debuglog('stream');\n} else {\n  debug = function debug() {};\n}\n/*</replacement>*/\n\n\nvar BufferList = require('./internal/streams/buffer_list');\n\nvar destroyImpl = require('./internal/streams/destroy');\n\nvar _require = require('./internal/streams/state'),\n    getHighWaterMark = _require.getHighWaterMark;\n\nvar _require$codes = require('../errors').codes,\n    ERR_INVALID_ARG_TYPE = _require$codes.ERR_INVALID_ARG_TYPE,\n    ERR_STREAM_PUSH_AFTER_EOF = _require$codes.ERR_STREAM_PUSH_AFTER_EOF,\n    ERR_METHOD_NOT_IMPLEMENTED = _require$codes.ERR_METHOD_NOT_IMPLEMENTED,\n    ERR_STREAM_UNSHIFT_AFTER_END_EVENT = _require$codes.ERR_STREAM_UNSHIFT_AFTER_END_EVENT; // Lazy loaded to improve the startup performance.\n\n\nvar StringDecoder;\nvar createReadableStreamAsyncIterator;\nvar from;\n\nrequire('inherits')(Readable, Stream);\n\nvar errorOrDestroy = destroyImpl.errorOrDestroy;\nvar kProxyEvents = ['error', 'close', 'destroy', 'pause', 'resume'];\n\nfunction prependListener(emitter, event, fn) {\n  // Sadly this is not cacheable as some libraries bundle their own\n  // event emitter implementation with them.\n  if (typeof emitter.prependListener === 'function') return emitter.prependListener(event, fn); // This is a hack to make sure that our error handler is attached before any\n  // userland ones.  NEVER DO THIS. This is here only because this code needs\n  // to continue to work with older versions of Node.js that do not include\n  // the prependListener() method. The goal is to eventually remove this hack.\n\n  if (!emitter._events || !emitter._events[event]) emitter.on(event, fn);else if (Array.isArray(emitter._events[event])) emitter._events[event].unshift(fn);else emitter._events[event] = [fn, emitter._events[event]];\n}\n\nfunction ReadableState(options, stream, isDuplex) {\n  Duplex = Duplex || require('./_stream_duplex');\n  options = options || {}; // Duplex streams are both readable and writable, but share\n  // the same options object.\n  // However, some cases require setting options to different\n  // values for the readable and the writable sides of the duplex stream.\n  // These options can be provided separately as readableXXX and writableXXX.\n\n  if (typeof isDuplex !== 'boolean') isDuplex = stream instanceof Duplex; // object stream flag. Used to make read(n) ignore n and to\n  // make all the buffer merging and length checks go away\n\n  this.objectMode = !!options.objectMode;\n  if (isDuplex) this.objectMode = this.objectMode || !!options.readableObjectMode; // the point at which it stops calling _read() to fill the buffer\n  // Note: 0 is a valid value, means \"don't call _read preemptively ever\"\n\n  this.highWaterMark = getHighWaterMark(this, options, 'readableHighWaterMark', isDuplex); // A linked list is used to store data chunks instead of an array because the\n  // linked list can remove elements from the beginning faster than\n  // array.shift()\n\n  this.buffer = new BufferList();\n  this.length = 0;\n  this.pipes = null;\n  this.pipesCount = 0;\n  this.flowing = null;\n  this.ended = false;\n  this.endEmitted = false;\n  this.reading = false; // a flag to be able to tell if the event 'readable'/'data' is emitted\n  // immediately, or on a later tick.  We set this to true at first, because\n  // any actions that shouldn't happen until \"later\" should generally also\n  // not happen before the first read call.\n\n  this.sync = true; // whenever we return null, then we set a flag to say\n  // that we're awaiting a 'readable' event emission.\n\n  this.needReadable = false;\n  this.emittedReadable = false;\n  this.readableListening = false;\n  this.resumeScheduled = false;\n  this.paused = true; // Should close be emitted on destroy. Defaults to true.\n\n  this.emitClose = options.emitClose !== false; // Should .destroy() be called after 'end' (and potentially 'finish')\n\n  this.autoDestroy = !!options.autoDestroy; // has it been destroyed\n\n  this.destroyed = false; // Crypto is kind of old and crusty.  Historically, its default string\n  // encoding is 'binary' so we have to make this configurable.\n  // Everything else in the universe uses 'utf8', though.\n\n  this.defaultEncoding = options.defaultEncoding || 'utf8'; // the number of writers that are awaiting a drain event in .pipe()s\n\n  this.awaitDrain = 0; // if true, a maybeReadMore has been scheduled\n\n  this.readingMore = false;\n  this.decoder = null;\n  this.encoding = null;\n\n  if (options.encoding) {\n    if (!StringDecoder) StringDecoder = require('string_decoder/').StringDecoder;\n    this.decoder = new StringDecoder(options.encoding);\n    this.encoding = options.encoding;\n  }\n}\n\nfunction Readable(options) {\n  Duplex = Duplex || require('./_stream_duplex');\n  if (!(this instanceof Readable)) return new Readable(options); // Checking for a Stream.Duplex instance is faster here instead of inside\n  // the ReadableState constructor, at least with V8 6.5\n\n  var isDuplex = this instanceof Duplex;\n  this._readableState = new ReadableState(options, this, isDuplex); // legacy\n\n  this.readable = true;\n\n  if (options) {\n    if (typeof options.read === 'function') this._read = options.read;\n    if (typeof options.destroy === 'function') this._destroy = options.destroy;\n  }\n\n  Stream.call(this);\n}\n\nObject.defineProperty(Readable.prototype, 'destroyed', {\n  // making it explicit this property is not enumerable\n  // because otherwise some prototype manipulation in\n  // userland will fail\n  enumerable: false,\n  get: function get() {\n    if (this._readableState === undefined) {\n      return false;\n    }\n\n    return this._readableState.destroyed;\n  },\n  set: function set(value) {\n    // we ignore the value if the stream\n    // has not been initialized yet\n    if (!this._readableState) {\n      return;\n    } // backward compatibility, the user is explicitly\n    // managing destroyed\n\n\n    this._readableState.destroyed = value;\n  }\n});\nReadable.prototype.destroy = destroyImpl.destroy;\nReadable.prototype._undestroy = destroyImpl.undestroy;\n\nReadable.prototype._destroy = function (err, cb) {\n  cb(err);\n}; // Manually shove something into the read() buffer.\n// This returns true if the highWaterMark has not been hit yet,\n// similar to how Writable.write() returns true if you should\n// write() some more.\n\n\nReadable.prototype.push = function (chunk, encoding) {\n  var state = this._readableState;\n  var skipChunkCheck;\n\n  if (!state.objectMode) {\n    if (typeof chunk === 'string') {\n      encoding = encoding || state.defaultEncoding;\n\n      if (encoding !== state.encoding) {\n        chunk = Buffer.from(chunk, encoding);\n        encoding = '';\n      }\n\n      skipChunkCheck = true;\n    }\n  } else {\n    skipChunkCheck = true;\n  }\n\n  return readableAddChunk(this, chunk, encoding, false, skipChunkCheck);\n}; // Unshift should *always* be something directly out of read()\n\n\nReadable.prototype.unshift = function (chunk) {\n  return readableAddChunk(this, chunk, null, true, false);\n};\n\nfunction readableAddChunk(stream, chunk, encoding, addToFront, skipChunkCheck) {\n  debug('readableAddChunk', chunk);\n  var state = stream._readableState;\n\n  if (chunk === null) {\n    state.reading = false;\n    onEofChunk(stream, state);\n  } else {\n    var er;\n    if (!skipChunkCheck) er = chunkInvalid(state, chunk);\n\n    if (er) {\n      errorOrDestroy(stream, er);\n    } else if (state.objectMode || chunk && chunk.length > 0) {\n      if (typeof chunk !== 'string' && !state.objectMode && Object.getPrototypeOf(chunk) !== Buffer.prototype) {\n        chunk = _uint8ArrayToBuffer(chunk);\n      }\n\n      if (addToFront) {\n        if (state.endEmitted) errorOrDestroy(stream, new ERR_STREAM_UNSHIFT_AFTER_END_EVENT());else addChunk(stream, state, chunk, true);\n      } else if (state.ended) {\n        errorOrDestroy(stream, new ERR_STREAM_PUSH_AFTER_EOF());\n      } else if (state.destroyed) {\n        return false;\n      } else {\n        state.reading = false;\n\n        if (state.decoder && !encoding) {\n          chunk = state.decoder.write(chunk);\n          if (state.objectMode || chunk.length !== 0) addChunk(stream, state, chunk, false);else maybeReadMore(stream, state);\n        } else {\n          addChunk(stream, state, chunk, false);\n        }\n      }\n    } else if (!addToFront) {\n      state.reading = false;\n      maybeReadMore(stream, state);\n    }\n  } // We can push more data if we are below the highWaterMark.\n  // Also, if we have no data yet, we can stand some more bytes.\n  // This is to work around cases where hwm=0, such as the repl.\n\n\n  return !state.ended && (state.length < state.highWaterMark || state.length === 0);\n}\n\nfunction addChunk(stream, state, chunk, addToFront) {\n  if (state.flowing && state.length === 0 && !state.sync) {\n    state.awaitDrain = 0;\n    stream.emit('data', chunk);\n  } else {\n    // update the buffer info.\n    state.length += state.objectMode ? 1 : chunk.length;\n    if (addToFront) state.buffer.unshift(chunk);else state.buffer.push(chunk);\n    if (state.needReadable) emitReadable(stream);\n  }\n\n  maybeReadMore(stream, state);\n}\n\nfunction chunkInvalid(state, chunk) {\n  var er;\n\n  if (!_isUint8Array(chunk) && typeof chunk !== 'string' && chunk !== undefined && !state.objectMode) {\n    er = new ERR_INVALID_ARG_TYPE('chunk', ['string', 'Buffer', 'Uint8Array'], chunk);\n  }\n\n  return er;\n}\n\nReadable.prototype.isPaused = function () {\n  return this._readableState.flowing === false;\n}; // backwards compatibility.\n\n\nReadable.prototype.setEncoding = function (enc) {\n  if (!StringDecoder) StringDecoder = require('string_decoder/').StringDecoder;\n  var decoder = new StringDecoder(enc);\n  this._readableState.decoder = decoder; // If setEncoding(null), decoder.encoding equals utf8\n\n  this._readableState.encoding = this._readableState.decoder.encoding; // Iterate over current buffer to convert already stored Buffers:\n\n  var p = this._readableState.buffer.head;\n  var content = '';\n\n  while (p !== null) {\n    content += decoder.write(p.data);\n    p = p.next;\n  }\n\n  this._readableState.buffer.clear();\n\n  if (content !== '') this._readableState.buffer.push(content);\n  this._readableState.length = content.length;\n  return this;\n}; // Don't raise the hwm > 1GB\n\n\nvar MAX_HWM = 0x40000000;\n\nfunction computeNewHighWaterMark(n) {\n  if (n >= MAX_HWM) {\n    // TODO(ronag): Throw ERR_VALUE_OUT_OF_RANGE.\n    n = MAX_HWM;\n  } else {\n    // Get the next highest power of 2 to prevent increasing hwm excessively in\n    // tiny amounts\n    n--;\n    n |= n >>> 1;\n    n |= n >>> 2;\n    n |= n >>> 4;\n    n |= n >>> 8;\n    n |= n >>> 16;\n    n++;\n  }\n\n  return n;\n} // This function is designed to be inlinable, so please take care when making\n// changes to the function body.\n\n\nfunction howMuchToRead(n, state) {\n  if (n <= 0 || state.length === 0 && state.ended) return 0;\n  if (state.objectMode) return 1;\n\n  if (n !== n) {\n    // Only flow one buffer at a time\n    if (state.flowing && state.length) return state.buffer.head.data.length;else return state.length;\n  } // If we're asking for more than the current hwm, then raise the hwm.\n\n\n  if (n > state.highWaterMark) state.highWaterMark = computeNewHighWaterMark(n);\n  if (n <= state.length) return n; // Don't have enough\n\n  if (!state.ended) {\n    state.needReadable = true;\n    return 0;\n  }\n\n  return state.length;\n} // you can override either this method, or the async _read(n) below.\n\n\nReadable.prototype.read = function (n) {\n  debug('read', n);\n  n = parseInt(n, 10);\n  var state = this._readableState;\n  var nOrig = n;\n  if (n !== 0) state.emittedReadable = false; // if we're doing read(0) to trigger a readable event, but we\n  // already have a bunch of data in the buffer, then just trigger\n  // the 'readable' event and move on.\n\n  if (n === 0 && state.needReadable && ((state.highWaterMark !== 0 ? state.length >= state.highWaterMark : state.length > 0) || state.ended)) {\n    debug('read: emitReadable', state.length, state.ended);\n    if (state.length === 0 && state.ended) endReadable(this);else emitReadable(this);\n    return null;\n  }\n\n  n = howMuchToRead(n, state); // if we've ended, and we're now clear, then finish it up.\n\n  if (n === 0 && state.ended) {\n    if (state.length === 0) endReadable(this);\n    return null;\n  } // All the actual chunk generation logic needs to be\n  // *below* the call to _read.  The reason is that in certain\n  // synthetic stream cases, such as passthrough streams, _read\n  // may be a completely synchronous operation which may change\n  // the state of the read buffer, providing enough data when\n  // before there was *not* enough.\n  //\n  // So, the steps are:\n  // 1. Figure out what the state of things will be after we do\n  // a read from the buffer.\n  //\n  // 2. If that resulting state will trigger a _read, then call _read.\n  // Note that this may be asynchronous, or synchronous.  Yes, it is\n  // deeply ugly to write APIs this way, but that still doesn't mean\n  // that the Readable class should behave improperly, as streams are\n  // designed to be sync/async agnostic.\n  // Take note if the _read call is sync or async (ie, if the read call\n  // has returned yet), so that we know whether or not it's safe to emit\n  // 'readable' etc.\n  //\n  // 3. Actually pull the requested chunks out of the buffer and return.\n  // if we need a readable event, then we need to do some reading.\n\n\n  var doRead = state.needReadable;\n  debug('need readable', doRead); // if we currently have less than the highWaterMark, then also read some\n\n  if (state.length === 0 || state.length - n < state.highWaterMark) {\n    doRead = true;\n    debug('length less than watermark', doRead);\n  } // however, if we've ended, then there's no point, and if we're already\n  // reading, then it's unnecessary.\n\n\n  if (state.ended || state.reading) {\n    doRead = false;\n    debug('reading or ended', doRead);\n  } else if (doRead) {\n    debug('do read');\n    state.reading = true;\n    state.sync = true; // if the length is currently zero, then we *need* a readable event.\n\n    if (state.length === 0) state.needReadable = true; // call internal read method\n\n    this._read(state.highWaterMark);\n\n    state.sync = false; // If _read pushed data synchronously, then `reading` will be false,\n    // and we need to re-evaluate how much data we can return to the user.\n\n    if (!state.reading) n = howMuchToRead(nOrig, state);\n  }\n\n  var ret;\n  if (n > 0) ret = fromList(n, state);else ret = null;\n\n  if (ret === null) {\n    state.needReadable = state.length <= state.highWaterMark;\n    n = 0;\n  } else {\n    state.length -= n;\n    state.awaitDrain = 0;\n  }\n\n  if (state.length === 0) {\n    // If we have nothing in the buffer, then we want to know\n    // as soon as we *do* get something into the buffer.\n    if (!state.ended) state.needReadable = true; // If we tried to read() past the EOF, then emit end on the next tick.\n\n    if (nOrig !== n && state.ended) endReadable(this);\n  }\n\n  if (ret !== null) this.emit('data', ret);\n  return ret;\n};\n\nfunction onEofChunk(stream, state) {\n  debug('onEofChunk');\n  if (state.ended) return;\n\n  if (state.decoder) {\n    var chunk = state.decoder.end();\n\n    if (chunk && chunk.length) {\n      state.buffer.push(chunk);\n      state.length += state.objectMode ? 1 : chunk.length;\n    }\n  }\n\n  state.ended = true;\n\n  if (state.sync) {\n    // if we are sync, wait until next tick to emit the data.\n    // Otherwise we risk emitting data in the flow()\n    // the readable code triggers during a read() call\n    emitReadable(stream);\n  } else {\n    // emit 'readable' now to make sure it gets picked up.\n    state.needReadable = false;\n\n    if (!state.emittedReadable) {\n      state.emittedReadable = true;\n      emitReadable_(stream);\n    }\n  }\n} // Don't emit readable right away in sync mode, because this can trigger\n// another read() call => stack overflow.  This way, it might trigger\n// a nextTick recursion warning, but that's not so bad.\n\n\nfunction emitReadable(stream) {\n  var state = stream._readableState;\n  debug('emitReadable', state.needReadable, state.emittedReadable);\n  state.needReadable = false;\n\n  if (!state.emittedReadable) {\n    debug('emitReadable', state.flowing);\n    state.emittedReadable = true;\n    process.nextTick(emitReadable_, stream);\n  }\n}\n\nfunction emitReadable_(stream) {\n  var state = stream._readableState;\n  debug('emitReadable_', state.destroyed, state.length, state.ended);\n\n  if (!state.destroyed && (state.length || state.ended)) {\n    stream.emit('readable');\n    state.emittedReadable = false;\n  } // The stream needs another readable event if\n  // 1. It is not flowing, as the flow mechanism will take\n  //    care of it.\n  // 2. It is not ended.\n  // 3. It is below the highWaterMark, so we can schedule\n  //    another readable later.\n\n\n  state.needReadable = !state.flowing && !state.ended && state.length <= state.highWaterMark;\n  flow(stream);\n} // at this point, the user has presumably seen the 'readable' event,\n// and called read() to consume some data.  that may have triggered\n// in turn another _read(n) call, in which case reading = true if\n// it's in progress.\n// However, if we're not ended, or reading, and the length < hwm,\n// then go ahead and try to read some more preemptively.\n\n\nfunction maybeReadMore(stream, state) {\n  if (!state.readingMore) {\n    state.readingMore = true;\n    process.nextTick(maybeReadMore_, stream, state);\n  }\n}\n\nfunction maybeReadMore_(stream, state) {\n  // Attempt to read more data if we should.\n  //\n  // The conditions for reading more data are (one of):\n  // - Not enough data buffered (state.length < state.highWaterMark). The loop\n  //   is responsible for filling the buffer with enough data if such data\n  //   is available. If highWaterMark is 0 and we are not in the flowing mode\n  //   we should _not_ attempt to buffer any extra data. We'll get more data\n  //   when the stream consumer calls read() instead.\n  // - No data in the buffer, and the stream is in flowing mode. In this mode\n  //   the loop below is responsible for ensuring read() is called. Failing to\n  //   call read here would abort the flow and there's no other mechanism for\n  //   continuing the flow if the stream consumer has just subscribed to the\n  //   'data' event.\n  //\n  // In addition to the above conditions to keep reading data, the following\n  // conditions prevent the data from being read:\n  // - The stream has ended (state.ended).\n  // - There is already a pending 'read' operation (state.reading). This is a\n  //   case where the the stream has called the implementation defined _read()\n  //   method, but they are processing the call asynchronously and have _not_\n  //   called push() with new data. In this case we skip performing more\n  //   read()s. The execution ends in this method again after the _read() ends\n  //   up calling push() with more data.\n  while (!state.reading && !state.ended && (state.length < state.highWaterMark || state.flowing && state.length === 0)) {\n    var len = state.length;\n    debug('maybeReadMore read 0');\n    stream.read(0);\n    if (len === state.length) // didn't get any data, stop spinning.\n      break;\n  }\n\n  state.readingMore = false;\n} // abstract method.  to be overridden in specific implementation classes.\n// call cb(er, data) where data is <= n in length.\n// for virtual (non-string, non-buffer) streams, \"length\" is somewhat\n// arbitrary, and perhaps not very meaningful.\n\n\nReadable.prototype._read = function (n) {\n  errorOrDestroy(this, new ERR_METHOD_NOT_IMPLEMENTED('_read()'));\n};\n\nReadable.prototype.pipe = function (dest, pipeOpts) {\n  var src = this;\n  var state = this._readableState;\n\n  switch (state.pipesCount) {\n    case 0:\n      state.pipes = dest;\n      break;\n\n    case 1:\n      state.pipes = [state.pipes, dest];\n      break;\n\n    default:\n      state.pipes.push(dest);\n      break;\n  }\n\n  state.pipesCount += 1;\n  debug('pipe count=%d opts=%j', state.pipesCount, pipeOpts);\n  var doEnd = (!pipeOpts || pipeOpts.end !== false) && dest !== process.stdout && dest !== process.stderr;\n  var endFn = doEnd ? onend : unpipe;\n  if (state.endEmitted) process.nextTick(endFn);else src.once('end', endFn);\n  dest.on('unpipe', onunpipe);\n\n  function onunpipe(readable, unpipeInfo) {\n    debug('onunpipe');\n\n    if (readable === src) {\n      if (unpipeInfo && unpipeInfo.hasUnpiped === false) {\n        unpipeInfo.hasUnpiped = true;\n        cleanup();\n      }\n    }\n  }\n\n  function onend() {\n    debug('onend');\n    dest.end();\n  } // when the dest drains, it reduces the awaitDrain counter\n  // on the source.  This would be more elegant with a .once()\n  // handler in flow(), but adding and removing repeatedly is\n  // too slow.\n\n\n  var ondrain = pipeOnDrain(src);\n  dest.on('drain', ondrain);\n  var cleanedUp = false;\n\n  function cleanup() {\n    debug('cleanup'); // cleanup event handlers once the pipe is broken\n\n    dest.removeListener('close', onclose);\n    dest.removeListener('finish', onfinish);\n    dest.removeListener('drain', ondrain);\n    dest.removeListener('error', onerror);\n    dest.removeListener('unpipe', onunpipe);\n    src.removeListener('end', onend);\n    src.removeListener('end', unpipe);\n    src.removeListener('data', ondata);\n    cleanedUp = true; // if the reader is waiting for a drain event from this\n    // specific writer, then it would cause it to never start\n    // flowing again.\n    // So, if this is awaiting a drain, then we just call it now.\n    // If we don't know, then assume that we are waiting for one.\n\n    if (state.awaitDrain && (!dest._writableState || dest._writableState.needDrain)) ondrain();\n  }\n\n  src.on('data', ondata);\n\n  function ondata(chunk) {\n    debug('ondata');\n    var ret = dest.write(chunk);\n    debug('dest.write', ret);\n\n    if (ret === false) {\n      // If the user unpiped during `dest.write()`, it is possible\n      // to get stuck in a permanently paused state if that write\n      // also returned false.\n      // => Check whether `dest` is still a piping destination.\n      if ((state.pipesCount === 1 && state.pipes === dest || state.pipesCount > 1 && indexOf(state.pipes, dest) !== -1) && !cleanedUp) {\n        debug('false write response, pause', state.awaitDrain);\n        state.awaitDrain++;\n      }\n\n      src.pause();\n    }\n  } // if the dest has an error, then stop piping into it.\n  // however, don't suppress the throwing behavior for this.\n\n\n  function onerror(er) {\n    debug('onerror', er);\n    unpipe();\n    dest.removeListener('error', onerror);\n    if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\n  } // Make sure our error handler is attached before userland ones.\n\n\n  prependListener(dest, 'error', onerror); // Both close and finish should trigger unpipe, but only once.\n\n  function onclose() {\n    dest.removeListener('finish', onfinish);\n    unpipe();\n  }\n\n  dest.once('close', onclose);\n\n  function onfinish() {\n    debug('onfinish');\n    dest.removeListener('close', onclose);\n    unpipe();\n  }\n\n  dest.once('finish', onfinish);\n\n  function unpipe() {\n    debug('unpipe');\n    src.unpipe(dest);\n  } // tell the dest that it's being piped to\n\n\n  dest.emit('pipe', src); // start the flow if it hasn't been started already.\n\n  if (!state.flowing) {\n    debug('pipe resume');\n    src.resume();\n  }\n\n  return dest;\n};\n\nfunction pipeOnDrain(src) {\n  return function pipeOnDrainFunctionResult() {\n    var state = src._readableState;\n    debug('pipeOnDrain', state.awaitDrain);\n    if (state.awaitDrain) state.awaitDrain--;\n\n    if (state.awaitDrain === 0 && EElistenerCount(src, 'data')) {\n      state.flowing = true;\n      flow(src);\n    }\n  };\n}\n\nReadable.prototype.unpipe = function (dest) {\n  var state = this._readableState;\n  var unpipeInfo = {\n    hasUnpiped: false\n  }; // if we're not piping anywhere, then do nothing.\n\n  if (state.pipesCount === 0) return this; // just one destination.  most common case.\n\n  if (state.pipesCount === 1) {\n    // passed in one, but it's not the right one.\n    if (dest && dest !== state.pipes) return this;\n    if (!dest) dest = state.pipes; // got a match.\n\n    state.pipes = null;\n    state.pipesCount = 0;\n    state.flowing = false;\n    if (dest) dest.emit('unpipe', this, unpipeInfo);\n    return this;\n  } // slow case. multiple pipe destinations.\n\n\n  if (!dest) {\n    // remove all.\n    var dests = state.pipes;\n    var len = state.pipesCount;\n    state.pipes = null;\n    state.pipesCount = 0;\n    state.flowing = false;\n\n    for (var i = 0; i < len; i++) {\n      dests[i].emit('unpipe', this, {\n        hasUnpiped: false\n      });\n    }\n\n    return this;\n  } // try to find the right one.\n\n\n  var index = indexOf(state.pipes, dest);\n  if (index === -1) return this;\n  state.pipes.splice(index, 1);\n  state.pipesCount -= 1;\n  if (state.pipesCount === 1) state.pipes = state.pipes[0];\n  dest.emit('unpipe', this, unpipeInfo);\n  return this;\n}; // set up data events if they are asked for\n// Ensure readable listeners eventually get something\n\n\nReadable.prototype.on = function (ev, fn) {\n  var res = Stream.prototype.on.call(this, ev, fn);\n  var state = this._readableState;\n\n  if (ev === 'data') {\n    // update readableListening so that resume() may be a no-op\n    // a few lines down. This is needed to support once('readable').\n    state.readableListening = this.listenerCount('readable') > 0; // Try start flowing on next tick if stream isn't explicitly paused\n\n    if (state.flowing !== false) this.resume();\n  } else if (ev === 'readable') {\n    if (!state.endEmitted && !state.readableListening) {\n      state.readableListening = state.needReadable = true;\n      state.flowing = false;\n      state.emittedReadable = false;\n      debug('on readable', state.length, state.reading);\n\n      if (state.length) {\n        emitReadable(this);\n      } else if (!state.reading) {\n        process.nextTick(nReadingNextTick, this);\n      }\n    }\n  }\n\n  return res;\n};\n\nReadable.prototype.addListener = Readable.prototype.on;\n\nReadable.prototype.removeListener = function (ev, fn) {\n  var res = Stream.prototype.removeListener.call(this, ev, fn);\n\n  if (ev === 'readable') {\n    // We need to check if there is someone still listening to\n    // readable and reset the state. However this needs to happen\n    // after readable has been emitted but before I/O (nextTick) to\n    // support once('readable', fn) cycles. This means that calling\n    // resume within the same tick will have no\n    // effect.\n    process.nextTick(updateReadableListening, this);\n  }\n\n  return res;\n};\n\nReadable.prototype.removeAllListeners = function (ev) {\n  var res = Stream.prototype.removeAllListeners.apply(this, arguments);\n\n  if (ev === 'readable' || ev === undefined) {\n    // We need to check if there is someone still listening to\n    // readable and reset the state. However this needs to happen\n    // after readable has been emitted but before I/O (nextTick) to\n    // support once('readable', fn) cycles. This means that calling\n    // resume within the same tick will have no\n    // effect.\n    process.nextTick(updateReadableListening, this);\n  }\n\n  return res;\n};\n\nfunction updateReadableListening(self) {\n  var state = self._readableState;\n  state.readableListening = self.listenerCount('readable') > 0;\n\n  if (state.resumeScheduled && !state.paused) {\n    // flowing needs to be set to true now, otherwise\n    // the upcoming resume will not flow.\n    state.flowing = true; // crude way to check if we should resume\n  } else if (self.listenerCount('data') > 0) {\n    self.resume();\n  }\n}\n\nfunction nReadingNextTick(self) {\n  debug('readable nexttick read 0');\n  self.read(0);\n} // pause() and resume() are remnants of the legacy readable stream API\n// If the user uses them, then switch into old mode.\n\n\nReadable.prototype.resume = function () {\n  var state = this._readableState;\n\n  if (!state.flowing) {\n    debug('resume'); // we flow only if there is no one listening\n    // for readable, but we still have to call\n    // resume()\n\n    state.flowing = !state.readableListening;\n    resume(this, state);\n  }\n\n  state.paused = false;\n  return this;\n};\n\nfunction resume(stream, state) {\n  if (!state.resumeScheduled) {\n    state.resumeScheduled = true;\n    process.nextTick(resume_, stream, state);\n  }\n}\n\nfunction resume_(stream, state) {\n  debug('resume', state.reading);\n\n  if (!state.reading) {\n    stream.read(0);\n  }\n\n  state.resumeScheduled = false;\n  stream.emit('resume');\n  flow(stream);\n  if (state.flowing && !state.reading) stream.read(0);\n}\n\nReadable.prototype.pause = function () {\n  debug('call pause flowing=%j', this._readableState.flowing);\n\n  if (this._readableState.flowing !== false) {\n    debug('pause');\n    this._readableState.flowing = false;\n    this.emit('pause');\n  }\n\n  this._readableState.paused = true;\n  return this;\n};\n\nfunction flow(stream) {\n  var state = stream._readableState;\n  debug('flow', state.flowing);\n\n  while (state.flowing && stream.read() !== null) {\n    ;\n  }\n} // wrap an old-style stream as the async data source.\n// This is *not* part of the readable stream interface.\n// It is an ugly unfortunate mess of history.\n\n\nReadable.prototype.wrap = function (stream) {\n  var _this = this;\n\n  var state = this._readableState;\n  var paused = false;\n  stream.on('end', function () {\n    debug('wrapped end');\n\n    if (state.decoder && !state.ended) {\n      var chunk = state.decoder.end();\n      if (chunk && chunk.length) _this.push(chunk);\n    }\n\n    _this.push(null);\n  });\n  stream.on('data', function (chunk) {\n    debug('wrapped data');\n    if (state.decoder) chunk = state.decoder.write(chunk); // don't skip over falsy values in objectMode\n\n    if (state.objectMode && (chunk === null || chunk === undefined)) return;else if (!state.objectMode && (!chunk || !chunk.length)) return;\n\n    var ret = _this.push(chunk);\n\n    if (!ret) {\n      paused = true;\n      stream.pause();\n    }\n  }); // proxy all the other methods.\n  // important when wrapping filters and duplexes.\n\n  for (var i in stream) {\n    if (this[i] === undefined && typeof stream[i] === 'function') {\n      this[i] = function methodWrap(method) {\n        return function methodWrapReturnFunction() {\n          return stream[method].apply(stream, arguments);\n        };\n      }(i);\n    }\n  } // proxy certain important events.\n\n\n  for (var n = 0; n < kProxyEvents.length; n++) {\n    stream.on(kProxyEvents[n], this.emit.bind(this, kProxyEvents[n]));\n  } // when we try to consume some more bytes, simply unpause the\n  // underlying stream.\n\n\n  this._read = function (n) {\n    debug('wrapped _read', n);\n\n    if (paused) {\n      paused = false;\n      stream.resume();\n    }\n  };\n\n  return this;\n};\n\nif (typeof Symbol === 'function') {\n  Readable.prototype[Symbol.asyncIterator] = function () {\n    if (createReadableStreamAsyncIterator === undefined) {\n      createReadableStreamAsyncIterator = require('./internal/streams/async_iterator');\n    }\n\n    return createReadableStreamAsyncIterator(this);\n  };\n}\n\nObject.defineProperty(Readable.prototype, 'readableHighWaterMark', {\n  // making it explicit this property is not enumerable\n  // because otherwise some prototype manipulation in\n  // userland will fail\n  enumerable: false,\n  get: function get() {\n    return this._readableState.highWaterMark;\n  }\n});\nObject.defineProperty(Readable.prototype, 'readableBuffer', {\n  // making it explicit this property is not enumerable\n  // because otherwise some prototype manipulation in\n  // userland will fail\n  enumerable: false,\n  get: function get() {\n    return this._readableState && this._readableState.buffer;\n  }\n});\nObject.defineProperty(Readable.prototype, 'readableFlowing', {\n  // making it explicit this property is not enumerable\n  // because otherwise some prototype manipulation in\n  // userland will fail\n  enumerable: false,\n  get: function get() {\n    return this._readableState.flowing;\n  },\n  set: function set(state) {\n    if (this._readableState) {\n      this._readableState.flowing = state;\n    }\n  }\n}); // exposed for testing purposes only.\n\nReadable._fromList = fromList;\nObject.defineProperty(Readable.prototype, 'readableLength', {\n  // making it explicit this property is not enumerable\n  // because otherwise some prototype manipulation in\n  // userland will fail\n  enumerable: false,\n  get: function get() {\n    return this._readableState.length;\n  }\n}); // Pluck off n bytes from an array of buffers.\n// Length is the combined lengths of all the buffers in the list.\n// This function is designed to be inlinable, so please take care when making\n// changes to the function body.\n\nfunction fromList(n, state) {\n  // nothing buffered\n  if (state.length === 0) return null;\n  var ret;\n  if (state.objectMode) ret = state.buffer.shift();else if (!n || n >= state.length) {\n    // read it all, truncate the list\n    if (state.decoder) ret = state.buffer.join('');else if (state.buffer.length === 1) ret = state.buffer.first();else ret = state.buffer.concat(state.length);\n    state.buffer.clear();\n  } else {\n    // read part of list\n    ret = state.buffer.consume(n, state.decoder);\n  }\n  return ret;\n}\n\nfunction endReadable(stream) {\n  var state = stream._readableState;\n  debug('endReadable', state.endEmitted);\n\n  if (!state.endEmitted) {\n    state.ended = true;\n    process.nextTick(endReadableNT, state, stream);\n  }\n}\n\nfunction endReadableNT(state, stream) {\n  debug('endReadableNT', state.endEmitted, state.length); // Check that we didn't get one last unshift.\n\n  if (!state.endEmitted && state.length === 0) {\n    state.endEmitted = true;\n    stream.readable = false;\n    stream.emit('end');\n\n    if (state.autoDestroy) {\n      // In case of duplex streams we need a way to detect\n      // if the writable side is ready for autoDestroy as well\n      var wState = stream._writableState;\n\n      if (!wState || wState.autoDestroy && wState.finished) {\n        stream.destroy();\n      }\n    }\n  }\n}\n\nif (typeof Symbol === 'function') {\n  Readable.from = function (iterable, opts) {\n    if (from === undefined) {\n      from = require('./internal/streams/from');\n    }\n\n    return from(Readable, iterable, opts);\n  };\n}\n\nfunction indexOf(xs, x) {\n  for (var i = 0, l = xs.length; i < l; i++) {\n    if (xs[i] === x) return i;\n  }\n\n  return -1;\n}","'use strict';\n\nfunction _inheritsLoose(subClass, superClass) { subClass.prototype = Object.create(superClass.prototype); subClass.prototype.constructor = subClass; subClass.__proto__ = superClass; }\n\nvar codes = {};\n\nfunction createErrorType(code, message, Base) {\n  if (!Base) {\n    Base = Error;\n  }\n\n  function getMessage(arg1, arg2, arg3) {\n    if (typeof message === 'string') {\n      return message;\n    } else {\n      return message(arg1, arg2, arg3);\n    }\n  }\n\n  var NodeError =\n  /*#__PURE__*/\n  function (_Base) {\n    _inheritsLoose(NodeError, _Base);\n\n    function NodeError(arg1, arg2, arg3) {\n      return _Base.call(this, getMessage(arg1, arg2, arg3)) || this;\n    }\n\n    return NodeError;\n  }(Base);\n\n  NodeError.prototype.name = Base.name;\n  NodeError.prototype.code = code;\n  codes[code] = NodeError;\n} // https://github.com/nodejs/node/blob/v10.8.0/lib/internal/errors.js\n\n\nfunction oneOf(expected, thing) {\n  if (Array.isArray(expected)) {\n    var len = expected.length;\n    expected = expected.map(function (i) {\n      return String(i);\n    });\n\n    if (len > 2) {\n      return \"one of \".concat(thing, \" \").concat(expected.slice(0, len - 1).join(', '), \", or \") + expected[len - 1];\n    } else if (len === 2) {\n      return \"one of \".concat(thing, \" \").concat(expected[0], \" or \").concat(expected[1]);\n    } else {\n      return \"of \".concat(thing, \" \").concat(expected[0]);\n    }\n  } else {\n    return \"of \".concat(thing, \" \").concat(String(expected));\n  }\n} // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/startsWith\n\n\nfunction startsWith(str, search, pos) {\n  return str.substr(!pos || pos < 0 ? 0 : +pos, search.length) === search;\n} // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/endsWith\n\n\nfunction endsWith(str, search, this_len) {\n  if (this_len === undefined || this_len > str.length) {\n    this_len = str.length;\n  }\n\n  return str.substring(this_len - search.length, this_len) === search;\n} // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/includes\n\n\nfunction includes(str, search, start) {\n  if (typeof start !== 'number') {\n    start = 0;\n  }\n\n  if (start + search.length > str.length) {\n    return false;\n  } else {\n    return str.indexOf(search, start) !== -1;\n  }\n}\n\ncreateErrorType('ERR_INVALID_OPT_VALUE', function (name, value) {\n  return 'The value \"' + value + '\" is invalid for option \"' + name + '\"';\n}, TypeError);\ncreateErrorType('ERR_INVALID_ARG_TYPE', function (name, expected, actual) {\n  // determiner: 'must be' or 'must not be'\n  var determiner;\n\n  if (typeof expected === 'string' && startsWith(expected, 'not ')) {\n    determiner = 'must not be';\n    expected = expected.replace(/^not /, '');\n  } else {\n    determiner = 'must be';\n  }\n\n  var msg;\n\n  if (endsWith(name, ' argument')) {\n    // For cases like 'first argument'\n    msg = \"The \".concat(name, \" \").concat(determiner, \" \").concat(oneOf(expected, 'type'));\n  } else {\n    var type = includes(name, '.') ? 'property' : 'argument';\n    msg = \"The \\\"\".concat(name, \"\\\" \").concat(type, \" \").concat(determiner, \" \").concat(oneOf(expected, 'type'));\n  }\n\n  msg += \". Received type \".concat(typeof actual);\n  return msg;\n}, TypeError);\ncreateErrorType('ERR_STREAM_PUSH_AFTER_EOF', 'stream.push() after EOF');\ncreateErrorType('ERR_METHOD_NOT_IMPLEMENTED', function (name) {\n  return 'The ' + name + ' method is not implemented';\n});\ncreateErrorType('ERR_STREAM_PREMATURE_CLOSE', 'Premature close');\ncreateErrorType('ERR_STREAM_DESTROYED', function (name) {\n  return 'Cannot call ' + name + ' after a stream was destroyed';\n});\ncreateErrorType('ERR_MULTIPLE_CALLBACK', 'Callback called multiple times');\ncreateErrorType('ERR_STREAM_CANNOT_PIPE', 'Cannot pipe, not readable');\ncreateErrorType('ERR_STREAM_WRITE_AFTER_END', 'write after end');\ncreateErrorType('ERR_STREAM_NULL_VALUES', 'May not write null values to stream', TypeError);\ncreateErrorType('ERR_UNKNOWN_ENCODING', function (arg) {\n  return 'Unknown encoding: ' + arg;\n}, TypeError);\ncreateErrorType('ERR_STREAM_UNSHIFT_AFTER_END_EVENT', 'stream.unshift() after end event');\nmodule.exports.codes = codes;\n","module.exports = require('events').EventEmitter;\n","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n// a transform stream is a readable/writable stream where you do\n// something with the data.  Sometimes it's called a \"filter\",\n// but that's not a great name for it, since that implies a thing where\n// some bits pass through, and others are simply ignored.  (That would\n// be a valid example of a transform, of course.)\n//\n// While the output is causally related to the input, it's not a\n// necessarily symmetric or synchronous transformation.  For example,\n// a zlib stream might take multiple plain-text writes(), and then\n// emit a single compressed chunk some time in the future.\n//\n// Here's how this works:\n//\n// The Transform stream has all the aspects of the readable and writable\n// stream classes.  When you write(chunk), that calls _write(chunk,cb)\n// internally, and returns false if there's a lot of pending writes\n// buffered up.  When you call read(), that calls _read(n) until\n// there's enough pending readable data buffered up.\n//\n// In a transform stream, the written data is placed in a buffer.  When\n// _read(n) is called, it transforms the queued up data, calling the\n// buffered _write cb's as it consumes chunks.  If consuming a single\n// written chunk would result in multiple output chunks, then the first\n// outputted bit calls the readcb, and subsequent chunks just go into\n// the read buffer, and will cause it to emit 'readable' if necessary.\n//\n// This way, back-pressure is actually determined by the reading side,\n// since _read has to be called to start processing a new chunk.  However,\n// a pathological inflate type of transform can cause excessive buffering\n// here.  For example, imagine a stream where every byte of input is\n// interpreted as an integer from 0-255, and then results in that many\n// bytes of output.  Writing the 4 bytes {ff,ff,ff,ff} would result in\n// 1kb of data being output.  In this case, you could write a very small\n// amount of input, and end up with a very large amount of output.  In\n// such a pathological inflating mechanism, there'd be no way to tell\n// the system to stop doing the transform.  A single 4MB write could\n// cause the system to run out of memory.\n//\n// However, even in such a pathological case, only a single written chunk\n// would be consumed, and then the rest would wait (un-transformed) until\n// the results of the previous transformed chunk were consumed.\n'use strict';\n\nmodule.exports = Transform;\n\nvar _require$codes = require('../errors').codes,\n    ERR_METHOD_NOT_IMPLEMENTED = _require$codes.ERR_METHOD_NOT_IMPLEMENTED,\n    ERR_MULTIPLE_CALLBACK = _require$codes.ERR_MULTIPLE_CALLBACK,\n    ERR_TRANSFORM_ALREADY_TRANSFORMING = _require$codes.ERR_TRANSFORM_ALREADY_TRANSFORMING,\n    ERR_TRANSFORM_WITH_LENGTH_0 = _require$codes.ERR_TRANSFORM_WITH_LENGTH_0;\n\nvar Duplex = require('./_stream_duplex');\n\nrequire('inherits')(Transform, Duplex);\n\nfunction afterTransform(er, data) {\n  var ts = this._transformState;\n  ts.transforming = false;\n  var cb = ts.writecb;\n\n  if (cb === null) {\n    return this.emit('error', new ERR_MULTIPLE_CALLBACK());\n  }\n\n  ts.writechunk = null;\n  ts.writecb = null;\n  if (data != null) // single equals check for both `null` and `undefined`\n    this.push(data);\n  cb(er);\n  var rs = this._readableState;\n  rs.reading = false;\n\n  if (rs.needReadable || rs.length < rs.highWaterMark) {\n    this._read(rs.highWaterMark);\n  }\n}\n\nfunction Transform(options) {\n  if (!(this instanceof Transform)) return new Transform(options);\n  Duplex.call(this, options);\n  this._transformState = {\n    afterTransform: afterTransform.bind(this),\n    needTransform: false,\n    transforming: false,\n    writecb: null,\n    writechunk: null,\n    writeencoding: null\n  }; // start out asking for a readable event once data is transformed.\n\n  this._readableState.needReadable = true; // we have implemented the _read method, and done the other things\n  // that Readable wants before the first _read call, so unset the\n  // sync guard flag.\n\n  this._readableState.sync = false;\n\n  if (options) {\n    if (typeof options.transform === 'function') this._transform = options.transform;\n    if (typeof options.flush === 'function') this._flush = options.flush;\n  } // When the writable side finishes, then flush out anything remaining.\n\n\n  this.on('prefinish', prefinish);\n}\n\nfunction prefinish() {\n  var _this = this;\n\n  if (typeof this._flush === 'function' && !this._readableState.destroyed) {\n    this._flush(function (er, data) {\n      done(_this, er, data);\n    });\n  } else {\n    done(this, null, null);\n  }\n}\n\nTransform.prototype.push = function (chunk, encoding) {\n  this._transformState.needTransform = false;\n  return Duplex.prototype.push.call(this, chunk, encoding);\n}; // This is the part where you do stuff!\n// override this function in implementation classes.\n// 'chunk' is an input chunk.\n//\n// Call `push(newChunk)` to pass along transformed output\n// to the readable side.  You may call 'push' zero or more times.\n//\n// Call `cb(err)` when you are done with this chunk.  If you pass\n// an error, then that'll put the hurt on the whole operation.  If you\n// never call cb(), then you'll never get another chunk.\n\n\nTransform.prototype._transform = function (chunk, encoding, cb) {\n  cb(new ERR_METHOD_NOT_IMPLEMENTED('_transform()'));\n};\n\nTransform.prototype._write = function (chunk, encoding, cb) {\n  var ts = this._transformState;\n  ts.writecb = cb;\n  ts.writechunk = chunk;\n  ts.writeencoding = encoding;\n\n  if (!ts.transforming) {\n    var rs = this._readableState;\n    if (ts.needTransform || rs.needReadable || rs.length < rs.highWaterMark) this._read(rs.highWaterMark);\n  }\n}; // Doesn't matter what the args are here.\n// _transform does all the work.\n// That we got here means that the readable side wants more data.\n\n\nTransform.prototype._read = function (n) {\n  var ts = this._transformState;\n\n  if (ts.writechunk !== null && !ts.transforming) {\n    ts.transforming = true;\n\n    this._transform(ts.writechunk, ts.writeencoding, ts.afterTransform);\n  } else {\n    // mark that we need a transform, so that any data that comes in\n    // will get processed, now that we've asked for it.\n    ts.needTransform = true;\n  }\n};\n\nTransform.prototype._destroy = function (err, cb) {\n  Duplex.prototype._destroy.call(this, err, function (err2) {\n    cb(err2);\n  });\n};\n\nfunction done(stream, er, data) {\n  if (er) return stream.emit('error', er);\n  if (data != null) // single equals check for both `null` and `undefined`\n    stream.push(data); // TODO(BridgeAR): Write a test for these two error cases\n  // if there's nothing in the write buffer, then that means\n  // that nothing more will ever be provided\n\n  if (stream._writableState.length) throw new ERR_TRANSFORM_WITH_LENGTH_0();\n  if (stream._transformState.transforming) throw new ERR_TRANSFORM_ALREADY_TRANSFORMING();\n  return stream.push(null);\n}","module.exports = function () {\n  throw new Error('Readable.from is not available in the browser')\n};\n"],"sourceRoot":""}