{"version":3,"file":"vendors-node_modules_bn_js_lib_bn_js-node_modules_path-browserify_index_js.js","mappings":"+rBAAA,SAAWA,EAAQC,GACjB,aAGA,SAASC,EAAQC,EAAKC,GACpB,IAAKD,EAAK,MAAM,IAAIE,MAAMD,GAAO,mBACnC,CAIA,SAASE,EAAUC,EAAMC,GACvBD,EAAKE,OAASD,EACd,IAAIE,EAAW,WAAa,EAC5BA,EAASC,UAAYH,EAAUG,UAC/BJ,EAAKI,UAAY,IAAID,EACrBH,EAAKI,UAAUC,YAAcL,CAC/B,CAIA,SAASM,EAAIC,EAAQC,EAAMC,GACzB,GAAIH,EAAGI,KAAKH,GACV,OAAOA,EAGTI,KAAKC,SAAW,EAChBD,KAAKE,MAAQ,KACbF,KAAKG,OAAS,EAGdH,KAAKI,IAAM,KAEI,OAAXR,IACW,OAATC,GAA0B,OAATA,IACnBC,EAASD,EACTA,EAAO,IAGTG,KAAKK,MAAMT,GAAU,EAAGC,GAAQ,GAAIC,GAAU,MAElD,CAUA,IAAIQ,EATkB,iBAAXxB,EACTA,EAAOC,QAAUY,EAEjBZ,EAAQY,GAAKA,EAGfA,EAAGA,GAAKA,EACRA,EAAGY,SAAW,GAGd,IAEID,EADoB,oBAAXE,aAAmD,IAAlBA,OAAOF,OACxCE,OAAOF,OAEP,eAEb,CAAE,MAAOG,GACT,CA+HA,SAASC,EAAeC,EAAQC,GAC9B,IAAIC,EAAIF,EAAOG,WAAWF,GAE1B,OAAIC,GAAK,IAAMA,GAAK,GACXA,EAAI,GAEFA,GAAK,IAAMA,GAAK,GAClBA,EAAI,GAEFA,GAAK,IAAMA,GAAK,IAClBA,EAAI,QAEX7B,GAAO,EAAO,wBAA0B2B,EAE5C,CAEA,SAASI,EAAcJ,EAAQK,EAAYJ,GACzC,IAAIK,EAAIP,EAAcC,EAAQC,GAI9B,OAHIA,EAAQ,GAAKI,IACfC,GAAKP,EAAcC,EAAQC,EAAQ,IAAM,GAEpCK,CACT,CA6CA,SAASC,EAAWC,EAAKC,EAAOC,EAAKC,GAInC,IAHA,IAAIL,EAAI,EACJM,EAAI,EACJC,EAAMC,KAAKC,IAAIP,EAAIhB,OAAQkB,GACtBM,EAAIP,EAAOO,EAAIH,EAAKG,IAAK,CAChC,IAAId,EAAIM,EAAIL,WAAWa,GAAK,GAE5BV,GAAKK,EAIHC,EADEV,GAAK,GACHA,EAAI,GAAK,GAGJA,GAAK,GACVA,EAAI,GAAK,GAITA,EAEN7B,EAAO6B,GAAK,GAAKU,EAAID,EAAK,qBAC1BL,GAAKM,CACP,CACA,OAAON,CACT,CA2DA,SAASW,EAAMC,EAAMC,GACnBD,EAAK3B,MAAQ4B,EAAI5B,MACjB2B,EAAK1B,OAAS2B,EAAI3B,OAClB0B,EAAK5B,SAAW6B,EAAI7B,SACpB4B,EAAKzB,IAAM0B,EAAI1B,GACjB,CAqCA,GA9TAT,EAAGI,KAAO,SAAegC,GACvB,OAAIA,aAAepC,GAIJ,OAARoC,GAA+B,iBAARA,GAC5BA,EAAIrC,YAAYa,WAAaZ,EAAGY,UAAYyB,MAAMC,QAAQF,EAAI7B,MAClE,EAEAP,EAAGuC,IAAM,SAAcC,EAAMC,GAC3B,OAAID,EAAKE,IAAID,GAAS,EAAUD,EACzBC,CACT,EAEAzC,EAAG+B,IAAM,SAAcS,EAAMC,GAC3B,OAAID,EAAKE,IAAID,GAAS,EAAUD,EACzBC,CACT,EAEAzC,EAAGF,UAAUY,MAAQ,SAAeT,EAAQC,EAAMC,GAChD,GAAsB,iBAAXF,EACT,OAAOI,KAAKsC,YAAY1C,EAAQC,EAAMC,GAGxC,GAAsB,iBAAXF,EACT,OAAOI,KAAKuC,WAAW3C,EAAQC,EAAMC,GAG1B,QAATD,IACFA,EAAO,IAETb,EAAOa,KAAiB,EAAPA,IAAaA,GAAQ,GAAKA,GAAQ,IAGnD,IAAIuB,EAAQ,EACM,OAFlBxB,EAASA,EAAO4C,WAAWC,QAAQ,OAAQ,KAEhC,KACTrB,IACApB,KAAKC,SAAW,GAGdmB,EAAQxB,EAAOO,SACJ,KAATN,EACFG,KAAK0C,UAAU9C,EAAQwB,EAAOtB,IAE9BE,KAAK2C,WAAW/C,EAAQC,EAAMuB,GACf,OAAXtB,GACFE,KAAKuC,WAAWvC,KAAK4C,UAAW/C,EAAMC,IAI9C,EAEAH,EAAGF,UAAU6C,YAAc,SAAsB1C,EAAQC,EAAMC,GACzDF,EAAS,IACXI,KAAKC,SAAW,EAChBL,GAAUA,GAERA,EAAS,UACXI,KAAKE,MAAQ,CAAU,SAATN,GACdI,KAAKG,OAAS,GACLP,EAAS,kBAClBI,KAAKE,MAAQ,CACF,SAATN,EACCA,EAAS,SAAa,UAEzBI,KAAKG,OAAS,IAEdnB,EAAOY,EAAS,kBAChBI,KAAKE,MAAQ,CACF,SAATN,EACCA,EAAS,SAAa,SACvB,GAEFI,KAAKG,OAAS,GAGD,OAAXL,GAGJE,KAAKuC,WAAWvC,KAAK4C,UAAW/C,EAAMC,EACxC,EAEAH,EAAGF,UAAU8C,WAAa,SAAqB3C,EAAQC,EAAMC,GAG3D,GADAd,EAAgC,iBAAlBY,EAAOO,QACjBP,EAAOO,QAAU,EAGnB,OAFAH,KAAKE,MAAQ,CAAC,GACdF,KAAKG,OAAS,EACPH,KAGTA,KAAKG,OAASsB,KAAKoB,KAAKjD,EAAOO,OAAS,GACxCH,KAAKE,MAAQ,IAAI8B,MAAMhC,KAAKG,QAC5B,IAAK,IAAIwB,EAAI,EAAGA,EAAI3B,KAAKG,OAAQwB,IAC/B3B,KAAKE,MAAMyB,GAAK,EAGlB,IAAImB,EAAGC,EACHC,EAAM,EACV,GAAe,OAAXlD,EACF,IAAK6B,EAAI/B,EAAOO,OAAS,EAAG2C,EAAI,EAAGnB,GAAK,EAAGA,GAAK,EAC9CoB,EAAInD,EAAO+B,GAAM/B,EAAO+B,EAAI,IAAM,EAAM/B,EAAO+B,EAAI,IAAM,GACzD3B,KAAKE,MAAM4C,IAAOC,GAAKC,EAAO,SAC9BhD,KAAKE,MAAM4C,EAAI,GAAMC,IAAO,GAAKC,EAAQ,UACzCA,GAAO,KACI,KACTA,GAAO,GACPF,UAGC,GAAe,OAAXhD,EACT,IAAK6B,EAAI,EAAGmB,EAAI,EAAGnB,EAAI/B,EAAOO,OAAQwB,GAAK,EACzCoB,EAAInD,EAAO+B,GAAM/B,EAAO+B,EAAI,IAAM,EAAM/B,EAAO+B,EAAI,IAAM,GACzD3B,KAAKE,MAAM4C,IAAOC,GAAKC,EAAO,SAC9BhD,KAAKE,MAAM4C,EAAI,GAAMC,IAAO,GAAKC,EAAQ,UACzCA,GAAO,KACI,KACTA,GAAO,GACPF,KAIN,OAAO9C,KAAKiD,QACd,EA0BAtD,EAAGF,UAAUiD,UAAY,SAAoB9C,EAAQwB,EAAOtB,GAE1DE,KAAKG,OAASsB,KAAKoB,MAAMjD,EAAOO,OAASiB,GAAS,GAClDpB,KAAKE,MAAQ,IAAI8B,MAAMhC,KAAKG,QAC5B,IAAK,IAAIwB,EAAI,EAAGA,EAAI3B,KAAKG,OAAQwB,IAC/B3B,KAAKE,MAAMyB,GAAK,EAIlB,IAGIoB,EAHAC,EAAM,EACNF,EAAI,EAGR,GAAe,OAAXhD,EACF,IAAK6B,EAAI/B,EAAOO,OAAS,EAAGwB,GAAKP,EAAOO,GAAK,EAC3CoB,EAAIhC,EAAanB,EAAQwB,EAAOO,IAAMqB,EACtChD,KAAKE,MAAM4C,IAAU,SAAJC,EACbC,GAAO,IACTA,GAAO,GACPF,GAAK,EACL9C,KAAKE,MAAM4C,IAAMC,IAAM,IAEvBC,GAAO,OAKX,IAAKrB,GADa/B,EAAOO,OAASiB,GACX,GAAM,EAAIA,EAAQ,EAAIA,EAAOO,EAAI/B,EAAOO,OAAQwB,GAAK,EAC1EoB,EAAIhC,EAAanB,EAAQwB,EAAOO,IAAMqB,EACtChD,KAAKE,MAAM4C,IAAU,SAAJC,EACbC,GAAO,IACTA,GAAO,GACPF,GAAK,EACL9C,KAAKE,MAAM4C,IAAMC,IAAM,IAEvBC,GAAO,EAKbhD,KAAKiD,QACP,EA6BAtD,EAAGF,UAAUkD,WAAa,SAAqB/C,EAAQC,EAAMuB,GAE3DpB,KAAKE,MAAQ,CAAC,GACdF,KAAKG,OAAS,EAGd,IAAK,IAAI+C,EAAU,EAAGC,EAAU,EAAGA,GAAW,SAAWA,GAAWtD,EAClEqD,IAEFA,IACAC,EAAWA,EAAUtD,EAAQ,EAO7B,IALA,IAAIuD,EAAQxD,EAAOO,OAASiB,EACxBiC,EAAMD,EAAQF,EACd7B,EAAMI,KAAKC,IAAI0B,EAAOA,EAAQC,GAAOjC,EAErCkC,EAAO,EACF3B,EAAIP,EAAOO,EAAIN,EAAKM,GAAKuB,EAChCI,EAAOpC,EAAUtB,EAAQ+B,EAAGA,EAAIuB,EAASrD,GAEzCG,KAAKuD,MAAMJ,GACPnD,KAAKE,MAAM,GAAKoD,EAAO,SACzBtD,KAAKE,MAAM,IAAMoD,EAEjBtD,KAAKwD,OAAOF,GAIhB,GAAY,IAARD,EAAW,CACb,IAAII,EAAM,EAGV,IAFAH,EAAOpC,EAAUtB,EAAQ+B,EAAG/B,EAAOO,OAAQN,GAEtC8B,EAAI,EAAGA,EAAI0B,EAAK1B,IACnB8B,GAAO5D,EAGTG,KAAKuD,MAAME,GACPzD,KAAKE,MAAM,GAAKoD,EAAO,SACzBtD,KAAKE,MAAM,IAAMoD,EAEjBtD,KAAKwD,OAAOF,EAEhB,CAEAtD,KAAKiD,QACP,EAEAtD,EAAGF,UAAUiE,KAAO,SAAe7B,GACjCA,EAAK3B,MAAQ,IAAI8B,MAAMhC,KAAKG,QAC5B,IAAK,IAAIwB,EAAI,EAAGA,EAAI3B,KAAKG,OAAQwB,IAC/BE,EAAK3B,MAAMyB,GAAK3B,KAAKE,MAAMyB,GAE7BE,EAAK1B,OAASH,KAAKG,OACnB0B,EAAK5B,SAAWD,KAAKC,SACrB4B,EAAKzB,IAAMJ,KAAKI,GAClB,EASAT,EAAGF,UAAUkE,MAAQ,SAAgB9B,GACnCD,EAAKC,EAAM7B,KACb,EAEAL,EAAGF,UAAUmE,MAAQ,WACnB,IAAI3C,EAAI,IAAItB,EAAG,MAEf,OADAK,KAAK0D,KAAKzC,GACHA,CACT,EAEAtB,EAAGF,UAAUoE,QAAU,SAAkBC,GACvC,KAAO9D,KAAKG,OAAS2D,GACnB9D,KAAKE,MAAMF,KAAKG,UAAY,EAE9B,OAAOH,IACT,EAGAL,EAAGF,UAAUwD,OAAS,WACpB,KAAOjD,KAAKG,OAAS,GAAqC,IAAhCH,KAAKE,MAAMF,KAAKG,OAAS,IACjDH,KAAKG,SAEP,OAAOH,KAAK+D,WACd,EAEApE,EAAGF,UAAUsE,UAAY,WAKvB,OAHoB,IAAhB/D,KAAKG,QAAkC,IAAlBH,KAAKE,MAAM,KAClCF,KAAKC,SAAW,GAEXD,IACT,EAIsB,oBAAXgE,QAAgD,mBAAfA,OAAOC,IACjD,IACEtE,EAAGF,UAAUuE,OAAOC,IAAI,+BAAiCC,CAC3D,CAAE,MAAOzD,GACPd,EAAGF,UAAUyE,QAAUA,CACzB,MAEAvE,EAAGF,UAAUyE,QAAUA,EAGzB,SAASA,IACP,OAAQlE,KAAKI,IAAM,UAAY,SAAWJ,KAAKwC,SAAS,IAAM,GAChE,CAgCA,IAAI2B,EAAQ,CACV,GACA,IACA,KACA,MACA,OACA,QACA,SACA,UACA,WACA,YACA,aACA,cACA,eACA,gBACA,iBACA,kBACA,mBACA,oBACA,qBACA,sBACA,uBACA,wBACA,yBACA,0BACA,2BACA,6BAGEC,EAAa,CACf,EAAG,EACH,GAAI,GAAI,GAAI,GAAI,GAAI,EAAG,EACvB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAClB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAClB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAClB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAGhBC,EAAa,CACf,EAAG,EACH,SAAU,SAAU,SAAU,SAAU,SAAU,SAAU,SAC5D,SAAU,IAAU,SAAU,SAAU,SAAU,QAAS,SAC3D,SAAU,SAAU,SAAU,SAAU,KAAU,QAAS,QAC3D,QAAS,QAAS,QAAS,SAAU,SAAU,SAAU,SACzD,MAAU,SAAU,SAAU,SAAU,SAAU,SAAU,UA4mB9D,SAASC,EAAYC,EAAMxC,EAAKyC,GAC9BA,EAAIvE,SAAW8B,EAAI9B,SAAWsE,EAAKtE,SACnC,IAAIuB,EAAO+C,EAAKpE,OAAS4B,EAAI5B,OAAU,EACvCqE,EAAIrE,OAASqB,EACbA,EAAOA,EAAM,EAAK,EAGlB,IAAIiD,EAAoB,EAAhBF,EAAKrE,MAAM,GACfqB,EAAmB,EAAfQ,EAAI7B,MAAM,GACde,EAAIwD,EAAIlD,EAERmD,EAAS,SAAJzD,EACL0D,EAAS1D,EAAI,SAAa,EAC9BuD,EAAItE,MAAM,GAAKwE,EAEf,IAAK,IAAIE,EAAI,EAAGA,EAAIpD,EAAKoD,IAAK,CAM5B,IAHA,IAAIC,EAASF,IAAU,GACnBG,EAAgB,SAARH,EACRI,EAAOtD,KAAKC,IAAIkD,EAAG7C,EAAI5B,OAAS,GAC3B2C,EAAIrB,KAAKS,IAAI,EAAG0C,EAAIL,EAAKpE,OAAS,GAAI2C,GAAKiC,EAAMjC,IAAK,CAC7D,IAAInB,EAAKiD,EAAI9B,EAAK,EAIlB+B,IADA5D,GAFAwD,EAAoB,EAAhBF,EAAKrE,MAAMyB,KACfJ,EAAmB,EAAfQ,EAAI7B,MAAM4C,IACFgC,GACG,SAAa,EAC5BA,EAAY,SAAJ7D,CACV,CACAuD,EAAItE,MAAM0E,GAAa,EAARE,EACfH,EAAiB,EAATE,CACV,CAOA,OANc,IAAVF,EACFH,EAAItE,MAAM0E,GAAa,EAARD,EAEfH,EAAIrE,SAGCqE,EAAIvB,QACb,CAhpBAtD,EAAGF,UAAU+C,SAAW,SAAmB3C,EAAMmF,GAI/C,IAAIR,EACJ,GAHAQ,EAAoB,EAAVA,GAAe,EAGZ,MAJbnF,EAAOA,GAAQ,KAIa,QAATA,EAAgB,CACjC2E,EAAM,GAGN,IAFA,IAAIxB,EAAM,EACN2B,EAAQ,EACHhD,EAAI,EAAGA,EAAI3B,KAAKG,OAAQwB,IAAK,CACpC,IAAIoB,EAAI/C,KAAKE,MAAMyB,GACf2B,GAA+B,UAArBP,GAAKC,EAAO2B,IAAmBnC,SAAS,IACtDmC,EAAS5B,IAAO,GAAKC,EAAQ,UAC7BA,GAAO,IACI,KACTA,GAAO,GACPrB,KAGA6C,EADY,IAAVG,GAAehD,IAAM3B,KAAKG,OAAS,EAC/BgE,EAAM,EAAIb,EAAKnD,QAAUmD,EAAOkB,EAEhClB,EAAOkB,CAEjB,CAIA,IAHc,IAAVG,IACFH,EAAMG,EAAMnC,SAAS,IAAMgC,GAEtBA,EAAIrE,OAAS6E,GAAY,GAC9BR,EAAM,IAAMA,EAKd,OAHsB,IAAlBxE,KAAKC,WACPuE,EAAM,IAAMA,GAEPA,CACT,CAEA,GAAI3E,KAAiB,EAAPA,IAAaA,GAAQ,GAAKA,GAAQ,GAAI,CAElD,IAAIoF,EAAYb,EAAWvE,GAEvBqF,EAAYb,EAAWxE,GAC3B2E,EAAM,GACN,IAAI3D,EAAIb,KAAK4D,QAEb,IADA/C,EAAEZ,SAAW,GACLY,EAAEsE,UAAU,CAClB,IAAIlE,EAAIJ,EAAEuE,MAAMF,GAAW1C,SAAS3C,GAMlC2E,GALF3D,EAAIA,EAAEwE,MAAMH,IAELC,SAGClE,EAAIuD,EAFJL,EAAMc,EAAYhE,EAAEd,QAAUc,EAAIuD,CAI5C,CAIA,IAHIxE,KAAKmF,WACPX,EAAM,IAAMA,GAEPA,EAAIrE,OAAS6E,GAAY,GAC9BR,EAAM,IAAMA,EAKd,OAHsB,IAAlBxE,KAAKC,WACPuE,EAAM,IAAMA,GAEPA,CACT,CAEAxF,GAAO,EAAO,kCAChB,EAEAW,EAAGF,UAAU6F,SAAW,WACtB,IAAIC,EAAMvF,KAAKE,MAAM,GASrB,OARoB,IAAhBF,KAAKG,OACPoF,GAAuB,SAAhBvF,KAAKE,MAAM,GACO,IAAhBF,KAAKG,QAAkC,IAAlBH,KAAKE,MAAM,GAEzCqF,GAAO,iBAAoC,SAAhBvF,KAAKE,MAAM,GAC7BF,KAAKG,OAAS,GACvBnB,GAAO,EAAO,8CAEU,IAAlBgB,KAAKC,UAAmBsF,EAAMA,CACxC,EAEA5F,EAAGF,UAAU+F,OAAS,WACpB,OAAOxF,KAAKwC,SAAS,GAAI,EAC3B,EAEIlC,IACFX,EAAGF,UAAUgG,SAAW,SAAmB3F,EAAQK,GACjD,OAAOH,KAAK0F,YAAYpF,EAAQR,EAAQK,EAC1C,GAGFR,EAAGF,UAAUmD,QAAU,SAAkB9C,EAAQK,GAC/C,OAAOH,KAAK0F,YAAY1D,MAAOlC,EAAQK,EACzC,EASAR,EAAGF,UAAUiG,YAAc,SAAsBC,EAAW7F,EAAQK,GAClEH,KAAKiD,SAEL,IAAI2C,EAAa5F,KAAK4F,aAClBC,EAAY1F,GAAUsB,KAAKS,IAAI,EAAG0D,GACtC5G,EAAO4G,GAAcC,EAAW,yCAChC7G,EAAO6G,EAAY,EAAG,+BAEtB,IAAIC,EAfS,SAAmBH,EAAW7B,GAC3C,OAAI6B,EAAUI,YACLJ,EAAUI,YAAYjC,GAExB,IAAI6B,EAAU7B,EACvB,CAUYkC,CAASL,EAAWE,GAG9B,OADA7F,KAAK,gBADoB,OAAXF,EAAkB,KAAO,OACRgG,EAAKF,GAC7BE,CACT,EAEAnG,EAAGF,UAAUwG,eAAiB,SAAyBH,EAAKF,GAI1D,IAHA,IAAIM,EAAW,EACXvB,EAAQ,EAEHhD,EAAI,EAAGwE,EAAQ,EAAGxE,EAAI3B,KAAKG,OAAQwB,IAAK,CAC/C,IAAI2B,EAAQtD,KAAKE,MAAMyB,IAAMwE,EAASxB,EAEtCmB,EAAII,KAAqB,IAAP5C,EACd4C,EAAWJ,EAAI3F,SACjB2F,EAAII,KAAe5C,GAAQ,EAAK,KAE9B4C,EAAWJ,EAAI3F,SACjB2F,EAAII,KAAe5C,GAAQ,GAAM,KAGrB,IAAV6C,GACED,EAAWJ,EAAI3F,SACjB2F,EAAII,KAAe5C,GAAQ,GAAM,KAEnCqB,EAAQ,EACRwB,EAAQ,IAERxB,EAAQrB,IAAS,GACjB6C,GAAS,EAEb,CAEA,GAAID,EAAWJ,EAAI3F,OAGjB,IAFA2F,EAAII,KAAcvB,EAEXuB,EAAWJ,EAAI3F,QACpB2F,EAAII,KAAc,CAGxB,EAEAvG,EAAGF,UAAU2G,eAAiB,SAAyBN,EAAKF,GAI1D,IAHA,IAAIM,EAAWJ,EAAI3F,OAAS,EACxBwE,EAAQ,EAEHhD,EAAI,EAAGwE,EAAQ,EAAGxE,EAAI3B,KAAKG,OAAQwB,IAAK,CAC/C,IAAI2B,EAAQtD,KAAKE,MAAMyB,IAAMwE,EAASxB,EAEtCmB,EAAII,KAAqB,IAAP5C,EACd4C,GAAY,IACdJ,EAAII,KAAe5C,GAAQ,EAAK,KAE9B4C,GAAY,IACdJ,EAAII,KAAe5C,GAAQ,GAAM,KAGrB,IAAV6C,GACED,GAAY,IACdJ,EAAII,KAAe5C,GAAQ,GAAM,KAEnCqB,EAAQ,EACRwB,EAAQ,IAERxB,EAAQrB,IAAS,GACjB6C,GAAS,EAEb,CAEA,GAAID,GAAY,EAGd,IAFAJ,EAAII,KAAcvB,EAEXuB,GAAY,GACjBJ,EAAII,KAAc,CAGxB,EAEIzE,KAAK4E,MACP1G,EAAGF,UAAU6G,WAAa,SAAqBvD,GAC7C,OAAO,GAAKtB,KAAK4E,MAAMtD,EACzB,EAEApD,EAAGF,UAAU6G,WAAa,SAAqBvD,GAC7C,IAAIwD,EAAIxD,EACJ9B,EAAI,EAiBR,OAhBIsF,GAAK,OACPtF,GAAK,GACLsF,KAAO,IAELA,GAAK,KACPtF,GAAK,EACLsF,KAAO,GAELA,GAAK,IACPtF,GAAK,EACLsF,KAAO,GAELA,GAAK,IACPtF,GAAK,EACLsF,KAAO,GAEFtF,EAAIsF,CACb,EAGF5G,EAAGF,UAAU+G,UAAY,SAAoBzD,GAE3C,GAAU,IAANA,EAAS,OAAO,GAEpB,IAAIwD,EAAIxD,EACJ9B,EAAI,EAoBR,OAnBqB,IAAZ,KAAJsF,KACHtF,GAAK,GACLsF,KAAO,IAEU,IAAV,IAAJA,KACHtF,GAAK,EACLsF,KAAO,GAES,IAAT,GAAJA,KACHtF,GAAK,EACLsF,KAAO,GAES,IAAT,EAAJA,KACHtF,GAAK,EACLsF,KAAO,GAES,IAAT,EAAJA,IACHtF,IAEKA,CACT,EAGAtB,EAAGF,UAAUgH,UAAY,WACvB,IAAI1D,EAAI/C,KAAKE,MAAMF,KAAKG,OAAS,GAC7BuG,EAAK1G,KAAKsG,WAAWvD,GACzB,OAA2B,IAAnB/C,KAAKG,OAAS,GAAUuG,CAClC,EAgBA/G,EAAGF,UAAUkH,SAAW,WACtB,GAAI3G,KAAKmF,SAAU,OAAO,EAG1B,IADA,IAAIlE,EAAI,EACCU,EAAI,EAAGA,EAAI3B,KAAKG,OAAQwB,IAAK,CACpC,IAAIJ,EAAIvB,KAAKwG,UAAUxG,KAAKE,MAAMyB,IAElC,GADAV,GAAKM,EACK,KAANA,EAAU,KAChB,CACA,OAAON,CACT,EAEAtB,EAAGF,UAAUmG,WAAa,WACxB,OAAOnE,KAAKoB,KAAK7C,KAAKyG,YAAc,EACtC,EAEA9G,EAAGF,UAAUmH,OAAS,SAAiBC,GACrC,OAAsB,IAAlB7G,KAAKC,SACAD,KAAK8G,MAAMC,MAAMF,GAAOG,MAAM,GAEhChH,KAAK4D,OACd,EAEAjE,EAAGF,UAAUwH,SAAW,SAAmBJ,GACzC,OAAI7G,KAAKkH,MAAML,EAAQ,GACd7G,KAAKmH,KAAKN,GAAOG,MAAM,GAAGI,OAE5BpH,KAAK4D,OACd,EAEAjE,EAAGF,UAAU4H,MAAQ,WACnB,OAAyB,IAAlBrH,KAAKC,QACd,EAGAN,EAAGF,UAAU6H,IAAM,WACjB,OAAOtH,KAAK4D,QAAQwD,MACtB,EAEAzH,EAAGF,UAAU2H,KAAO,WAKlB,OAJKpH,KAAKmF,WACRnF,KAAKC,UAAY,GAGZD,IACT,EAGAL,EAAGF,UAAU8H,KAAO,SAAexF,GACjC,KAAO/B,KAAKG,OAAS4B,EAAI5B,QACvBH,KAAKE,MAAMF,KAAKG,UAAY,EAG9B,IAAK,IAAIwB,EAAI,EAAGA,EAAII,EAAI5B,OAAQwB,IAC9B3B,KAAKE,MAAMyB,GAAK3B,KAAKE,MAAMyB,GAAKI,EAAI7B,MAAMyB,GAG5C,OAAO3B,KAAKiD,QACd,EAEAtD,EAAGF,UAAU+H,IAAM,SAAczF,GAE/B,OADA/C,EAA0C,IAAlCgB,KAAKC,SAAW8B,EAAI9B,WACrBD,KAAKuH,KAAKxF,EACnB,EAGApC,EAAGF,UAAUgI,GAAK,SAAa1F,GAC7B,OAAI/B,KAAKG,OAAS4B,EAAI5B,OAAeH,KAAK4D,QAAQ4D,IAAIzF,GAC/CA,EAAI6B,QAAQ4D,IAAIxH,KACzB,EAEAL,EAAGF,UAAUiI,IAAM,SAAc3F,GAC/B,OAAI/B,KAAKG,OAAS4B,EAAI5B,OAAeH,KAAK4D,QAAQ2D,KAAKxF,GAChDA,EAAI6B,QAAQ2D,KAAKvH,KAC1B,EAGAL,EAAGF,UAAUkI,MAAQ,SAAgB5F,GAEnC,IAAIR,EAEFA,EADEvB,KAAKG,OAAS4B,EAAI5B,OAChB4B,EAEA/B,KAGN,IAAK,IAAI2B,EAAI,EAAGA,EAAIJ,EAAEpB,OAAQwB,IAC5B3B,KAAKE,MAAMyB,GAAK3B,KAAKE,MAAMyB,GAAKI,EAAI7B,MAAMyB,GAK5C,OAFA3B,KAAKG,OAASoB,EAAEpB,OAETH,KAAKiD,QACd,EAEAtD,EAAGF,UAAUmI,KAAO,SAAe7F,GAEjC,OADA/C,EAA0C,IAAlCgB,KAAKC,SAAW8B,EAAI9B,WACrBD,KAAK2H,MAAM5F,EACpB,EAGApC,EAAGF,UAAUoI,IAAM,SAAc9F,GAC/B,OAAI/B,KAAKG,OAAS4B,EAAI5B,OAAeH,KAAK4D,QAAQgE,KAAK7F,GAChDA,EAAI6B,QAAQgE,KAAK5H,KAC1B,EAEAL,EAAGF,UAAUqI,KAAO,SAAe/F,GACjC,OAAI/B,KAAKG,OAAS4B,EAAI5B,OAAeH,KAAK4D,QAAQ+D,MAAM5F,GACjDA,EAAI6B,QAAQ+D,MAAM3H,KAC3B,EAGAL,EAAGF,UAAUsI,MAAQ,SAAgBhG,GAEnC,IAAI0C,EACAlD,EACAvB,KAAKG,OAAS4B,EAAI5B,QACpBsE,EAAIzE,KACJuB,EAAIQ,IAEJ0C,EAAI1C,EACJR,EAAIvB,MAGN,IAAK,IAAI2B,EAAI,EAAGA,EAAIJ,EAAEpB,OAAQwB,IAC5B3B,KAAKE,MAAMyB,GAAK8C,EAAEvE,MAAMyB,GAAKJ,EAAErB,MAAMyB,GAGvC,GAAI3B,OAASyE,EACX,KAAO9C,EAAI8C,EAAEtE,OAAQwB,IACnB3B,KAAKE,MAAMyB,GAAK8C,EAAEvE,MAAMyB,GAM5B,OAFA3B,KAAKG,OAASsE,EAAEtE,OAETH,KAAKiD,QACd,EAEAtD,EAAGF,UAAUuI,KAAO,SAAejG,GAEjC,OADA/C,EAA0C,IAAlCgB,KAAKC,SAAW8B,EAAI9B,WACrBD,KAAK+H,MAAMhG,EACpB,EAGApC,EAAGF,UAAUwI,IAAM,SAAclG,GAC/B,OAAI/B,KAAKG,OAAS4B,EAAI5B,OAAeH,KAAK4D,QAAQoE,KAAKjG,GAChDA,EAAI6B,QAAQoE,KAAKhI,KAC1B,EAEAL,EAAGF,UAAUyI,KAAO,SAAenG,GACjC,OAAI/B,KAAKG,OAAS4B,EAAI5B,OAAeH,KAAK4D,QAAQmE,MAAMhG,GACjDA,EAAI6B,QAAQmE,MAAM/H,KAC3B,EAGAL,EAAGF,UAAUsH,MAAQ,SAAgBF,GACnC7H,EAAwB,iBAAV6H,GAAsBA,GAAS,GAE7C,IAAIsB,EAAsC,EAAxB1G,KAAKoB,KAAKgE,EAAQ,IAChCuB,EAAWvB,EAAQ,GAGvB7G,KAAK6D,QAAQsE,GAETC,EAAW,GACbD,IAIF,IAAK,IAAIxG,EAAI,EAAGA,EAAIwG,EAAaxG,IAC/B3B,KAAKE,MAAMyB,GAAsB,UAAhB3B,KAAKE,MAAMyB,GAS9B,OALIyG,EAAW,IACbpI,KAAKE,MAAMyB,IAAM3B,KAAKE,MAAMyB,GAAM,UAAc,GAAKyG,GAIhDpI,KAAKiD,QACd,EAEAtD,EAAGF,UAAU0H,KAAO,SAAeN,GACjC,OAAO7G,KAAK4D,QAAQmD,MAAMF,EAC5B,EAGAlH,EAAGF,UAAU4I,KAAO,SAAeC,EAAKrJ,GACtCD,EAAsB,iBAARsJ,GAAoBA,GAAO,GAEzC,IAAItF,EAAOsF,EAAM,GAAM,EACnBC,EAAOD,EAAM,GAUjB,OARAtI,KAAK6D,QAAQb,EAAM,GAGjBhD,KAAKE,MAAM8C,GADT/D,EACgBe,KAAKE,MAAM8C,GAAQ,GAAKuF,EAExBvI,KAAKE,MAAM8C,KAAS,GAAKuF,GAGtCvI,KAAKiD,QACd,EAGAtD,EAAGF,UAAU+I,KAAO,SAAezG,GACjC,IAAId,EAkBAwD,EAAGlD,EAfP,GAAsB,IAAlBvB,KAAKC,UAAmC,IAAjB8B,EAAI9B,SAI7B,OAHAD,KAAKC,SAAW,EAChBgB,EAAIjB,KAAKyI,KAAK1G,GACd/B,KAAKC,UAAY,EACVD,KAAK+D,YAGP,GAAsB,IAAlB/D,KAAKC,UAAmC,IAAjB8B,EAAI9B,SAIpC,OAHA8B,EAAI9B,SAAW,EACfgB,EAAIjB,KAAKyI,KAAK1G,GACdA,EAAI9B,SAAW,EACRgB,EAAE8C,YAKP/D,KAAKG,OAAS4B,EAAI5B,QACpBsE,EAAIzE,KACJuB,EAAIQ,IAEJ0C,EAAI1C,EACJR,EAAIvB,MAIN,IADA,IAAI2E,EAAQ,EACHhD,EAAI,EAAGA,EAAIJ,EAAEpB,OAAQwB,IAC5BV,GAAkB,EAAbwD,EAAEvE,MAAMyB,KAAwB,EAAbJ,EAAErB,MAAMyB,IAAUgD,EAC1C3E,KAAKE,MAAMyB,GAAS,SAAJV,EAChB0D,EAAQ1D,IAAM,GAEhB,KAAiB,IAAV0D,GAAehD,EAAI8C,EAAEtE,OAAQwB,IAClCV,GAAkB,EAAbwD,EAAEvE,MAAMyB,IAAUgD,EACvB3E,KAAKE,MAAMyB,GAAS,SAAJV,EAChB0D,EAAQ1D,IAAM,GAIhB,GADAjB,KAAKG,OAASsE,EAAEtE,OACF,IAAVwE,EACF3E,KAAKE,MAAMF,KAAKG,QAAUwE,EAC1B3E,KAAKG,cAEA,GAAIsE,IAAMzE,KACf,KAAO2B,EAAI8C,EAAEtE,OAAQwB,IACnB3B,KAAKE,MAAMyB,GAAK8C,EAAEvE,MAAMyB,GAI5B,OAAO3B,IACT,EAGAL,EAAGF,UAAUiJ,IAAM,SAAc3G,GAC/B,IAAI+D,EACJ,OAAqB,IAAjB/D,EAAI9B,UAAoC,IAAlBD,KAAKC,UAC7B8B,EAAI9B,SAAW,EACf6F,EAAM9F,KAAK2I,IAAI5G,GACfA,EAAI9B,UAAY,EACT6F,GACmB,IAAjB/D,EAAI9B,UAAoC,IAAlBD,KAAKC,UACpCD,KAAKC,SAAW,EAChB6F,EAAM/D,EAAI4G,IAAI3I,MACdA,KAAKC,SAAW,EACT6F,GAGL9F,KAAKG,OAAS4B,EAAI5B,OAAeH,KAAK4D,QAAQ4E,KAAKzG,GAEhDA,EAAI6B,QAAQ4E,KAAKxI,KAC1B,EAGAL,EAAGF,UAAUgJ,KAAO,SAAe1G,GAEjC,GAAqB,IAAjBA,EAAI9B,SAAgB,CACtB8B,EAAI9B,SAAW,EACf,IAAIgB,EAAIjB,KAAKwI,KAAKzG,GAElB,OADAA,EAAI9B,SAAW,EACRgB,EAAE8C,WAGX,CAAO,GAAsB,IAAlB/D,KAAKC,SAId,OAHAD,KAAKC,SAAW,EAChBD,KAAKwI,KAAKzG,GACV/B,KAAKC,SAAW,EACTD,KAAK+D,YAId,IAWIU,EAAGlD,EAXHc,EAAMrC,KAAKqC,IAAIN,GAGnB,GAAY,IAARM,EAIF,OAHArC,KAAKC,SAAW,EAChBD,KAAKG,OAAS,EACdH,KAAKE,MAAM,GAAK,EACTF,KAKLqC,EAAM,GACRoC,EAAIzE,KACJuB,EAAIQ,IAEJ0C,EAAI1C,EACJR,EAAIvB,MAIN,IADA,IAAI2E,EAAQ,EACHhD,EAAI,EAAGA,EAAIJ,EAAEpB,OAAQwB,IAE5BgD,GADA1D,GAAkB,EAAbwD,EAAEvE,MAAMyB,KAAwB,EAAbJ,EAAErB,MAAMyB,IAAUgD,IAC7B,GACb3E,KAAKE,MAAMyB,GAAS,SAAJV,EAElB,KAAiB,IAAV0D,GAAehD,EAAI8C,EAAEtE,OAAQwB,IAElCgD,GADA1D,GAAkB,EAAbwD,EAAEvE,MAAMyB,IAAUgD,IACV,GACb3E,KAAKE,MAAMyB,GAAS,SAAJV,EAIlB,GAAc,IAAV0D,GAAehD,EAAI8C,EAAEtE,QAAUsE,IAAMzE,KACvC,KAAO2B,EAAI8C,EAAEtE,OAAQwB,IACnB3B,KAAKE,MAAMyB,GAAK8C,EAAEvE,MAAMyB,GAU5B,OANA3B,KAAKG,OAASsB,KAAKS,IAAIlC,KAAKG,OAAQwB,GAEhC8C,IAAMzE,OACRA,KAAKC,SAAW,GAGXD,KAAKiD,QACd,EAGAtD,EAAGF,UAAUkJ,IAAM,SAAc5G,GAC/B,OAAO/B,KAAK4D,QAAQ6E,KAAK1G,EAC3B,EA8CA,IAAI6G,EAAc,SAAsBrE,EAAMxC,EAAKyC,GACjD,IAIIE,EACAmE,EACAnC,EANAjC,EAAIF,EAAKrE,MACTqB,EAAIQ,EAAI7B,MACR4I,EAAItE,EAAItE,MACRW,EAAI,EAIJkI,EAAY,EAAPtE,EAAE,GACPuE,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPzE,EAAE,GACP0E,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP5E,EAAE,GACP6E,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP/E,EAAE,GACPgF,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPlF,EAAE,GACPmF,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPrF,EAAE,GACPsF,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPxF,EAAE,GACPyF,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP3F,EAAE,GACP4F,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP9F,EAAE,GACP+F,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPjG,EAAE,GACPkG,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPtJ,EAAE,GACPuJ,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPzJ,EAAE,GACP0J,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP5J,EAAE,GACP6J,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP/J,EAAE,GACPgK,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPlK,EAAE,GACPmK,EAAW,KAALD,EACNE,GAAMF,IAAO,GACbG,GAAY,EAAPrK,EAAE,GACPsK,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAPxK,EAAE,GACPyK,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAP3K,EAAE,GACP4K,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAP9K,EAAE,GACP+K,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAPjL,EAAE,GACPkL,GAAW,KAALD,GACNE,GAAMF,KAAO,GAEjBhI,EAAIvE,SAAWsE,EAAKtE,SAAW8B,EAAI9B,SACnCuE,EAAIrE,OAAS,GAMb,IAAIwM,IAAQ9L,GAJZ6D,EAAKjD,KAAKmL,KAAK5D,EAAK8B,IAIE,KAAa,MAFnCjC,GADAA,EAAMpH,KAAKmL,KAAK5D,EAAK+B,IACRtJ,KAAKmL,KAAK3D,EAAK6B,GAAQ,KAEU,IAAO,EACrDjK,IAFA6F,EAAKjF,KAAKmL,KAAK3D,EAAK8B,KAEPlC,IAAQ,IAAO,IAAM8D,KAAO,IAAO,EAChDA,IAAM,SAENjI,EAAKjD,KAAKmL,KAAKzD,EAAK2B,GAEpBjC,GADAA,EAAMpH,KAAKmL,KAAKzD,EAAK4B,IACRtJ,KAAKmL,KAAKxD,EAAK0B,GAAQ,EACpCpE,EAAKjF,KAAKmL,KAAKxD,EAAK2B,GAKpB,IAAI8B,IAAQhM,GAJZ6D,EAAMA,EAAKjD,KAAKmL,KAAK5D,EAAKiC,GAAQ,GAIZ,KAAa,MAFnCpC,GADAA,EAAOA,EAAMpH,KAAKmL,KAAK5D,EAAKkC,GAAQ,GACvBzJ,KAAKmL,KAAK3D,EAAKgC,GAAQ,KAEU,IAAO,EACrDpK,IAFA6F,EAAMA,EAAKjF,KAAKmL,KAAK3D,EAAKiC,GAAQ,IAErBrC,IAAQ,IAAO,IAAMgE,KAAO,IAAO,EAChDA,IAAM,SAENnI,EAAKjD,KAAKmL,KAAKtD,EAAKwB,GAEpBjC,GADAA,EAAMpH,KAAKmL,KAAKtD,EAAKyB,IACRtJ,KAAKmL,KAAKrD,EAAKuB,GAAQ,EACpCpE,EAAKjF,KAAKmL,KAAKrD,EAAKwB,GACpBrG,EAAMA,EAAKjD,KAAKmL,KAAKzD,EAAK8B,GAAQ,EAElCpC,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKzD,EAAK+B,GAAQ,GACvBzJ,KAAKmL,KAAKxD,EAAK6B,GAAQ,EACpCvE,EAAMA,EAAKjF,KAAKmL,KAAKxD,EAAK8B,GAAQ,EAKlC,IAAI4B,IAAQjM,GAJZ6D,EAAMA,EAAKjD,KAAKmL,KAAK5D,EAAKoC,GAAQ,GAIZ,KAAa,MAFnCvC,GADAA,EAAOA,EAAMpH,KAAKmL,KAAK5D,EAAKqC,GAAQ,GACvB5J,KAAKmL,KAAK3D,EAAKmC,GAAQ,KAEU,IAAO,EACrDvK,IAFA6F,EAAMA,EAAKjF,KAAKmL,KAAK3D,EAAKoC,GAAQ,IAErBxC,IAAQ,IAAO,IAAMiE,KAAO,IAAO,EAChDA,IAAM,SAENpI,EAAKjD,KAAKmL,KAAKnD,EAAKqB,GAEpBjC,GADAA,EAAMpH,KAAKmL,KAAKnD,EAAKsB,IACRtJ,KAAKmL,KAAKlD,EAAKoB,GAAQ,EACpCpE,EAAKjF,KAAKmL,KAAKlD,EAAKqB,GACpBrG,EAAMA,EAAKjD,KAAKmL,KAAKtD,EAAK2B,GAAQ,EAElCpC,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKtD,EAAK4B,GAAQ,GACvBzJ,KAAKmL,KAAKrD,EAAK0B,GAAQ,EACpCvE,EAAMA,EAAKjF,KAAKmL,KAAKrD,EAAK2B,GAAQ,EAClCxG,EAAMA,EAAKjD,KAAKmL,KAAKzD,EAAKiC,GAAQ,EAElCvC,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKzD,EAAKkC,GAAQ,GACvB5J,KAAKmL,KAAKxD,EAAKgC,GAAQ,EACpC1E,EAAMA,EAAKjF,KAAKmL,KAAKxD,EAAKiC,GAAQ,EAKlC,IAAI0B,IAAQlM,GAJZ6D,EAAMA,EAAKjD,KAAKmL,KAAK5D,EAAKuC,GAAQ,GAIZ,KAAa,MAFnC1C,GADAA,EAAOA,EAAMpH,KAAKmL,KAAK5D,EAAKwC,GAAQ,GACvB/J,KAAKmL,KAAK3D,EAAKsC,GAAQ,KAEU,IAAO,EACrD1K,IAFA6F,EAAMA,EAAKjF,KAAKmL,KAAK3D,EAAKuC,GAAQ,IAErB3C,IAAQ,IAAO,IAAMkE,KAAO,IAAO,EAChDA,IAAM,SAENrI,EAAKjD,KAAKmL,KAAKhD,EAAKkB,GAEpBjC,GADAA,EAAMpH,KAAKmL,KAAKhD,EAAKmB,IACRtJ,KAAKmL,KAAK/C,EAAKiB,GAAQ,EACpCpE,EAAKjF,KAAKmL,KAAK/C,EAAKkB,GACpBrG,EAAMA,EAAKjD,KAAKmL,KAAKnD,EAAKwB,GAAQ,EAElCpC,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKnD,EAAKyB,GAAQ,GACvBzJ,KAAKmL,KAAKlD,EAAKuB,GAAQ,EACpCvE,EAAMA,EAAKjF,KAAKmL,KAAKlD,EAAKwB,GAAQ,EAClCxG,EAAMA,EAAKjD,KAAKmL,KAAKtD,EAAK8B,GAAQ,EAElCvC,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKtD,EAAK+B,GAAQ,GACvB5J,KAAKmL,KAAKrD,EAAK6B,GAAQ,EACpC1E,EAAMA,EAAKjF,KAAKmL,KAAKrD,EAAK8B,GAAQ,EAClC3G,EAAMA,EAAKjD,KAAKmL,KAAKzD,EAAKoC,GAAQ,EAElC1C,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKzD,EAAKqC,GAAQ,GACvB/J,KAAKmL,KAAKxD,EAAKmC,GAAQ,EACpC7E,EAAMA,EAAKjF,KAAKmL,KAAKxD,EAAKoC,GAAQ,EAKlC,IAAIwB,IAAQnM,GAJZ6D,EAAMA,EAAKjD,KAAKmL,KAAK5D,EAAK0C,GAAQ,GAIZ,KAAa,MAFnC7C,GADAA,EAAOA,EAAMpH,KAAKmL,KAAK5D,EAAK2C,IAAQ,GACvBlK,KAAKmL,KAAK3D,EAAKyC,GAAQ,KAEU,IAAO,EACrD7K,IAFA6F,EAAMA,EAAKjF,KAAKmL,KAAK3D,EAAK0C,IAAQ,IAErB9C,IAAQ,IAAO,IAAMmE,KAAO,IAAO,EAChDA,IAAM,SAENtI,EAAKjD,KAAKmL,KAAK7C,EAAKe,GAEpBjC,GADAA,EAAMpH,KAAKmL,KAAK7C,EAAKgB,IACRtJ,KAAKmL,KAAK5C,EAAKc,GAAQ,EACpCpE,EAAKjF,KAAKmL,KAAK5C,EAAKe,GACpBrG,EAAMA,EAAKjD,KAAKmL,KAAKhD,EAAKqB,GAAQ,EAElCpC,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKhD,EAAKsB,GAAQ,GACvBzJ,KAAKmL,KAAK/C,EAAKoB,GAAQ,EACpCvE,EAAMA,EAAKjF,KAAKmL,KAAK/C,EAAKqB,GAAQ,EAClCxG,EAAMA,EAAKjD,KAAKmL,KAAKnD,EAAK2B,GAAQ,EAElCvC,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKnD,EAAK4B,GAAQ,GACvB5J,KAAKmL,KAAKlD,EAAK0B,GAAQ,EACpC1E,EAAMA,EAAKjF,KAAKmL,KAAKlD,EAAK2B,GAAQ,EAClC3G,EAAMA,EAAKjD,KAAKmL,KAAKtD,EAAKiC,GAAQ,EAElC1C,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKtD,EAAKkC,GAAQ,GACvB/J,KAAKmL,KAAKrD,EAAKgC,GAAQ,EACpC7E,EAAMA,EAAKjF,KAAKmL,KAAKrD,EAAKiC,GAAQ,EAClC9G,EAAMA,EAAKjD,KAAKmL,KAAKzD,EAAKuC,GAAQ,EAElC7C,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKzD,EAAKwC,IAAQ,GACvBlK,KAAKmL,KAAKxD,EAAKsC,GAAQ,EACpChF,EAAMA,EAAKjF,KAAKmL,KAAKxD,EAAKuC,IAAQ,EAKlC,IAAIsB,IAAQpM,GAJZ6D,EAAMA,EAAKjD,KAAKmL,KAAK5D,EAAK6C,IAAQ,GAIZ,KAAa,MAFnChD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAK5D,EAAK8C,IAAQ,GACvBrK,KAAKmL,KAAK3D,EAAK4C,IAAQ,KAEU,IAAO,EACrDhL,IAFA6F,EAAMA,EAAKjF,KAAKmL,KAAK3D,EAAK6C,IAAQ,IAErBjD,IAAQ,IAAO,IAAMoE,KAAO,IAAO,EAChDA,IAAM,SAENvI,EAAKjD,KAAKmL,KAAK1C,EAAKY,GAEpBjC,GADAA,EAAMpH,KAAKmL,KAAK1C,EAAKa,IACRtJ,KAAKmL,KAAKzC,EAAKW,GAAQ,EACpCpE,EAAKjF,KAAKmL,KAAKzC,EAAKY,GACpBrG,EAAMA,EAAKjD,KAAKmL,KAAK7C,EAAKkB,GAAQ,EAElCpC,GADAA,EAAOA,EAAMpH,KAAKmL,KAAK7C,EAAKmB,GAAQ,GACvBzJ,KAAKmL,KAAK5C,EAAKiB,GAAQ,EACpCvE,EAAMA,EAAKjF,KAAKmL,KAAK5C,EAAKkB,GAAQ,EAClCxG,EAAMA,EAAKjD,KAAKmL,KAAKhD,EAAKwB,GAAQ,EAElCvC,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKhD,EAAKyB,GAAQ,GACvB5J,KAAKmL,KAAK/C,EAAKuB,GAAQ,EACpC1E,EAAMA,EAAKjF,KAAKmL,KAAK/C,EAAKwB,GAAQ,EAClC3G,EAAMA,EAAKjD,KAAKmL,KAAKnD,EAAK8B,GAAQ,EAElC1C,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKnD,EAAK+B,GAAQ,GACvB/J,KAAKmL,KAAKlD,EAAK6B,GAAQ,EACpC7E,EAAMA,EAAKjF,KAAKmL,KAAKlD,EAAK8B,GAAQ,EAClC9G,EAAMA,EAAKjD,KAAKmL,KAAKtD,EAAKoC,GAAQ,EAElC7C,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKtD,EAAKqC,IAAQ,GACvBlK,KAAKmL,KAAKrD,EAAKmC,GAAQ,EACpChF,EAAMA,EAAKjF,KAAKmL,KAAKrD,EAAKoC,IAAQ,EAClCjH,EAAMA,EAAKjD,KAAKmL,KAAKzD,EAAK0C,IAAQ,EAElChD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKzD,EAAK2C,IAAQ,GACvBrK,KAAKmL,KAAKxD,EAAKyC,IAAQ,EACpCnF,EAAMA,EAAKjF,KAAKmL,KAAKxD,EAAK0C,IAAQ,EAKlC,IAAIoB,IAAQrM,GAJZ6D,EAAMA,EAAKjD,KAAKmL,KAAK5D,EAAKgD,IAAQ,GAIZ,KAAa,MAFnCnD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAK5D,EAAKiD,IAAQ,GACvBxK,KAAKmL,KAAK3D,EAAK+C,IAAQ,KAEU,IAAO,EACrDnL,IAFA6F,EAAMA,EAAKjF,KAAKmL,KAAK3D,EAAKgD,IAAQ,IAErBpD,IAAQ,IAAO,IAAMqE,KAAO,IAAO,EAChDA,IAAM,SAENxI,EAAKjD,KAAKmL,KAAKvC,EAAKS,GAEpBjC,GADAA,EAAMpH,KAAKmL,KAAKvC,EAAKU,IACRtJ,KAAKmL,KAAKtC,EAAKQ,GAAQ,EACpCpE,EAAKjF,KAAKmL,KAAKtC,EAAKS,GACpBrG,EAAMA,EAAKjD,KAAKmL,KAAK1C,EAAKe,GAAQ,EAElCpC,GADAA,EAAOA,EAAMpH,KAAKmL,KAAK1C,EAAKgB,GAAQ,GACvBzJ,KAAKmL,KAAKzC,EAAKc,GAAQ,EACpCvE,EAAMA,EAAKjF,KAAKmL,KAAKzC,EAAKe,GAAQ,EAClCxG,EAAMA,EAAKjD,KAAKmL,KAAK7C,EAAKqB,GAAQ,EAElCvC,GADAA,EAAOA,EAAMpH,KAAKmL,KAAK7C,EAAKsB,GAAQ,GACvB5J,KAAKmL,KAAK5C,EAAKoB,GAAQ,EACpC1E,EAAMA,EAAKjF,KAAKmL,KAAK5C,EAAKqB,GAAQ,EAClC3G,EAAMA,EAAKjD,KAAKmL,KAAKhD,EAAK2B,GAAQ,EAElC1C,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKhD,EAAK4B,GAAQ,GACvB/J,KAAKmL,KAAK/C,EAAK0B,GAAQ,EACpC7E,EAAMA,EAAKjF,KAAKmL,KAAK/C,EAAK2B,GAAQ,EAClC9G,EAAMA,EAAKjD,KAAKmL,KAAKnD,EAAKiC,GAAQ,EAElC7C,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKnD,EAAKkC,IAAQ,GACvBlK,KAAKmL,KAAKlD,EAAKgC,GAAQ,EACpChF,EAAMA,EAAKjF,KAAKmL,KAAKlD,EAAKiC,IAAQ,EAClCjH,EAAMA,EAAKjD,KAAKmL,KAAKtD,EAAKuC,IAAQ,EAElChD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKtD,EAAKwC,IAAQ,GACvBrK,KAAKmL,KAAKrD,EAAKsC,IAAQ,EACpCnF,EAAMA,EAAKjF,KAAKmL,KAAKrD,EAAKuC,IAAQ,EAClCpH,EAAMA,EAAKjD,KAAKmL,KAAKzD,EAAK6C,IAAQ,EAElCnD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKzD,EAAK8C,IAAQ,GACvBxK,KAAKmL,KAAKxD,EAAK4C,IAAQ,EACpCtF,EAAMA,EAAKjF,KAAKmL,KAAKxD,EAAK6C,IAAQ,EAKlC,IAAIkB,IAAQtM,GAJZ6D,EAAMA,EAAKjD,KAAKmL,KAAK5D,EAAKmD,IAAQ,GAIZ,KAAa,MAFnCtD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAK5D,EAAKoD,IAAQ,GACvB3K,KAAKmL,KAAK3D,EAAKkD,IAAQ,KAEU,IAAO,EACrDtL,IAFA6F,EAAMA,EAAKjF,KAAKmL,KAAK3D,EAAKmD,IAAQ,IAErBvD,IAAQ,IAAO,IAAMsE,KAAO,IAAO,EAChDA,IAAM,SAENzI,EAAKjD,KAAKmL,KAAKpC,EAAKM,GAEpBjC,GADAA,EAAMpH,KAAKmL,KAAKpC,EAAKO,IACRtJ,KAAKmL,KAAKnC,EAAKK,GAAQ,EACpCpE,EAAKjF,KAAKmL,KAAKnC,EAAKM,GACpBrG,EAAMA,EAAKjD,KAAKmL,KAAKvC,EAAKY,GAAQ,EAElCpC,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKvC,EAAKa,GAAQ,GACvBzJ,KAAKmL,KAAKtC,EAAKW,GAAQ,EACpCvE,EAAMA,EAAKjF,KAAKmL,KAAKtC,EAAKY,GAAQ,EAClCxG,EAAMA,EAAKjD,KAAKmL,KAAK1C,EAAKkB,GAAQ,EAElCvC,GADAA,EAAOA,EAAMpH,KAAKmL,KAAK1C,EAAKmB,GAAQ,GACvB5J,KAAKmL,KAAKzC,EAAKiB,GAAQ,EACpC1E,EAAMA,EAAKjF,KAAKmL,KAAKzC,EAAKkB,GAAQ,EAClC3G,EAAMA,EAAKjD,KAAKmL,KAAK7C,EAAKwB,GAAQ,EAElC1C,GADAA,EAAOA,EAAMpH,KAAKmL,KAAK7C,EAAKyB,GAAQ,GACvB/J,KAAKmL,KAAK5C,EAAKuB,GAAQ,EACpC7E,EAAMA,EAAKjF,KAAKmL,KAAK5C,EAAKwB,GAAQ,EAClC9G,EAAMA,EAAKjD,KAAKmL,KAAKhD,EAAK8B,GAAQ,EAElC7C,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKhD,EAAK+B,IAAQ,GACvBlK,KAAKmL,KAAK/C,EAAK6B,GAAQ,EACpChF,EAAMA,EAAKjF,KAAKmL,KAAK/C,EAAK8B,IAAQ,EAClCjH,EAAMA,EAAKjD,KAAKmL,KAAKnD,EAAKoC,IAAQ,EAElChD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKnD,EAAKqC,IAAQ,GACvBrK,KAAKmL,KAAKlD,EAAKmC,IAAQ,EACpCnF,EAAMA,EAAKjF,KAAKmL,KAAKlD,EAAKoC,IAAQ,EAClCpH,EAAMA,EAAKjD,KAAKmL,KAAKtD,EAAK0C,IAAQ,EAElCnD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKtD,EAAK2C,IAAQ,GACvBxK,KAAKmL,KAAKrD,EAAKyC,IAAQ,EACpCtF,EAAMA,EAAKjF,KAAKmL,KAAKrD,EAAK0C,IAAQ,EAClCvH,EAAMA,EAAKjD,KAAKmL,KAAKzD,EAAKgD,IAAQ,EAElCtD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKzD,EAAKiD,IAAQ,GACvB3K,KAAKmL,KAAKxD,EAAK+C,IAAQ,EACpCzF,EAAMA,EAAKjF,KAAKmL,KAAKxD,EAAKgD,IAAQ,EAKlC,IAAIgB,IAAQvM,GAJZ6D,EAAMA,EAAKjD,KAAKmL,KAAK5D,EAAKsD,IAAQ,GAIZ,KAAa,MAFnCzD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAK5D,EAAKuD,IAAQ,GACvB9K,KAAKmL,KAAK3D,EAAKqD,IAAQ,KAEU,IAAO,EACrDzL,IAFA6F,EAAMA,EAAKjF,KAAKmL,KAAK3D,EAAKsD,IAAQ,IAErB1D,IAAQ,IAAO,IAAMuE,KAAO,IAAO,EAChDA,IAAM,SAEN1I,EAAKjD,KAAKmL,KAAKjC,EAAKG,GAEpBjC,GADAA,EAAMpH,KAAKmL,KAAKjC,EAAKI,IACRtJ,KAAKmL,KAAKhC,EAAKE,GAAQ,EACpCpE,EAAKjF,KAAKmL,KAAKhC,EAAKG,GACpBrG,EAAMA,EAAKjD,KAAKmL,KAAKpC,EAAKS,GAAQ,EAElCpC,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKpC,EAAKU,GAAQ,GACvBzJ,KAAKmL,KAAKnC,EAAKQ,GAAQ,EACpCvE,EAAMA,EAAKjF,KAAKmL,KAAKnC,EAAKS,GAAQ,EAClCxG,EAAMA,EAAKjD,KAAKmL,KAAKvC,EAAKe,GAAQ,EAElCvC,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKvC,EAAKgB,GAAQ,GACvB5J,KAAKmL,KAAKtC,EAAKc,GAAQ,EACpC1E,EAAMA,EAAKjF,KAAKmL,KAAKtC,EAAKe,GAAQ,EAClC3G,EAAMA,EAAKjD,KAAKmL,KAAK1C,EAAKqB,GAAQ,EAElC1C,GADAA,EAAOA,EAAMpH,KAAKmL,KAAK1C,EAAKsB,GAAQ,GACvB/J,KAAKmL,KAAKzC,EAAKoB,GAAQ,EACpC7E,EAAMA,EAAKjF,KAAKmL,KAAKzC,EAAKqB,GAAQ,EAClC9G,EAAMA,EAAKjD,KAAKmL,KAAK7C,EAAK2B,GAAQ,EAElC7C,GADAA,EAAOA,EAAMpH,KAAKmL,KAAK7C,EAAK4B,IAAQ,GACvBlK,KAAKmL,KAAK5C,EAAK0B,GAAQ,EACpChF,EAAMA,EAAKjF,KAAKmL,KAAK5C,EAAK2B,IAAQ,EAClCjH,EAAMA,EAAKjD,KAAKmL,KAAKhD,EAAKiC,IAAQ,EAElChD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKhD,EAAKkC,IAAQ,GACvBrK,KAAKmL,KAAK/C,EAAKgC,IAAQ,EACpCnF,EAAMA,EAAKjF,KAAKmL,KAAK/C,EAAKiC,IAAQ,EAClCpH,EAAMA,EAAKjD,KAAKmL,KAAKnD,EAAKuC,IAAQ,EAElCnD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKnD,EAAKwC,IAAQ,GACvBxK,KAAKmL,KAAKlD,EAAKsC,IAAQ,EACpCtF,EAAMA,EAAKjF,KAAKmL,KAAKlD,EAAKuC,IAAQ,EAClCvH,EAAMA,EAAKjD,KAAKmL,KAAKtD,EAAK6C,IAAQ,EAElCtD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKtD,EAAK8C,IAAQ,GACvB3K,KAAKmL,KAAKrD,EAAK4C,IAAQ,EACpCzF,EAAMA,EAAKjF,KAAKmL,KAAKrD,EAAK6C,IAAQ,EAClC1H,EAAMA,EAAKjD,KAAKmL,KAAKzD,EAAKmD,IAAQ,EAElCzD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKzD,EAAKoD,IAAQ,GACvB9K,KAAKmL,KAAKxD,EAAKkD,IAAQ,EACpC5F,EAAMA,EAAKjF,KAAKmL,KAAKxD,EAAKmD,IAAQ,EAKlC,IAAIc,IAAQxM,GAJZ6D,EAAMA,EAAKjD,KAAKmL,KAAK5D,EAAKyD,IAAQ,GAIZ,KAAa,MAFnC5D,GADAA,EAAOA,EAAMpH,KAAKmL,KAAK5D,EAAK0D,IAAQ,GACvBjL,KAAKmL,KAAK3D,EAAKwD,IAAQ,KAEU,IAAO,EACrD5L,IAFA6F,EAAMA,EAAKjF,KAAKmL,KAAK3D,EAAKyD,IAAQ,IAErB7D,IAAQ,IAAO,IAAMwE,KAAO,IAAO,EAChDA,IAAM,SAEN3I,EAAKjD,KAAKmL,KAAKjC,EAAKM,GAEpBpC,GADAA,EAAMpH,KAAKmL,KAAKjC,EAAKO,IACRzJ,KAAKmL,KAAKhC,EAAKK,GAAQ,EACpCvE,EAAKjF,KAAKmL,KAAKhC,EAAKM,GACpBxG,EAAMA,EAAKjD,KAAKmL,KAAKpC,EAAKY,GAAQ,EAElCvC,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKpC,EAAKa,GAAQ,GACvB5J,KAAKmL,KAAKnC,EAAKW,GAAQ,EACpC1E,EAAMA,EAAKjF,KAAKmL,KAAKnC,EAAKY,GAAQ,EAClC3G,EAAMA,EAAKjD,KAAKmL,KAAKvC,EAAKkB,GAAQ,EAElC1C,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKvC,EAAKmB,GAAQ,GACvB/J,KAAKmL,KAAKtC,EAAKiB,GAAQ,EACpC7E,EAAMA,EAAKjF,KAAKmL,KAAKtC,EAAKkB,GAAQ,EAClC9G,EAAMA,EAAKjD,KAAKmL,KAAK1C,EAAKwB,GAAQ,EAElC7C,GADAA,EAAOA,EAAMpH,KAAKmL,KAAK1C,EAAKyB,IAAQ,GACvBlK,KAAKmL,KAAKzC,EAAKuB,GAAQ,EACpChF,EAAMA,EAAKjF,KAAKmL,KAAKzC,EAAKwB,IAAQ,EAClCjH,EAAMA,EAAKjD,KAAKmL,KAAK7C,EAAK8B,IAAQ,EAElChD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAK7C,EAAK+B,IAAQ,GACvBrK,KAAKmL,KAAK5C,EAAK6B,IAAQ,EACpCnF,EAAMA,EAAKjF,KAAKmL,KAAK5C,EAAK8B,IAAQ,EAClCpH,EAAMA,EAAKjD,KAAKmL,KAAKhD,EAAKoC,IAAQ,EAElCnD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKhD,EAAKqC,IAAQ,GACvBxK,KAAKmL,KAAK/C,EAAKmC,IAAQ,EACpCtF,EAAMA,EAAKjF,KAAKmL,KAAK/C,EAAKoC,IAAQ,EAClCvH,EAAMA,EAAKjD,KAAKmL,KAAKnD,EAAK0C,IAAQ,EAElCtD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKnD,EAAK2C,IAAQ,GACvB3K,KAAKmL,KAAKlD,EAAKyC,IAAQ,EACpCzF,EAAMA,EAAKjF,KAAKmL,KAAKlD,EAAK0C,IAAQ,EAClC1H,EAAMA,EAAKjD,KAAKmL,KAAKtD,EAAKgD,IAAQ,EAElCzD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKtD,EAAKiD,IAAQ,GACvB9K,KAAKmL,KAAKrD,EAAK+C,IAAQ,EACpC5F,EAAMA,EAAKjF,KAAKmL,KAAKrD,EAAKgD,IAAQ,EAKlC,IAAIe,IAASzM,GAJb6D,EAAMA,EAAKjD,KAAKmL,KAAKzD,EAAKsD,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKzD,EAAKuD,IAAQ,GACvBjL,KAAKmL,KAAKxD,EAAKqD,IAAQ,KAEW,IAAO,EACtD5L,IAFA6F,EAAMA,EAAKjF,KAAKmL,KAAKxD,EAAKsD,IAAQ,IAErB7D,IAAQ,IAAO,IAAMyE,KAAQ,IAAO,EACjDA,IAAO,SAEP5I,EAAKjD,KAAKmL,KAAKjC,EAAKS,GAEpBvC,GADAA,EAAMpH,KAAKmL,KAAKjC,EAAKU,IACR5J,KAAKmL,KAAKhC,EAAKQ,GAAQ,EACpC1E,EAAKjF,KAAKmL,KAAKhC,EAAKS,GACpB3G,EAAMA,EAAKjD,KAAKmL,KAAKpC,EAAKe,GAAQ,EAElC1C,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKpC,EAAKgB,GAAQ,GACvB/J,KAAKmL,KAAKnC,EAAKc,GAAQ,EACpC7E,EAAMA,EAAKjF,KAAKmL,KAAKnC,EAAKe,GAAQ,EAClC9G,EAAMA,EAAKjD,KAAKmL,KAAKvC,EAAKqB,GAAQ,EAElC7C,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKvC,EAAKsB,IAAQ,GACvBlK,KAAKmL,KAAKtC,EAAKoB,GAAQ,EACpChF,EAAMA,EAAKjF,KAAKmL,KAAKtC,EAAKqB,IAAQ,EAClCjH,EAAMA,EAAKjD,KAAKmL,KAAK1C,EAAK2B,IAAQ,EAElChD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAK1C,EAAK4B,IAAQ,GACvBrK,KAAKmL,KAAKzC,EAAK0B,IAAQ,EACpCnF,EAAMA,EAAKjF,KAAKmL,KAAKzC,EAAK2B,IAAQ,EAClCpH,EAAMA,EAAKjD,KAAKmL,KAAK7C,EAAKiC,IAAQ,EAElCnD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAK7C,EAAKkC,IAAQ,GACvBxK,KAAKmL,KAAK5C,EAAKgC,IAAQ,EACpCtF,EAAMA,EAAKjF,KAAKmL,KAAK5C,EAAKiC,IAAQ,EAClCvH,EAAMA,EAAKjD,KAAKmL,KAAKhD,EAAKuC,IAAQ,EAElCtD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKhD,EAAKwC,IAAQ,GACvB3K,KAAKmL,KAAK/C,EAAKsC,IAAQ,EACpCzF,EAAMA,EAAKjF,KAAKmL,KAAK/C,EAAKuC,IAAQ,EAClC1H,EAAMA,EAAKjD,KAAKmL,KAAKnD,EAAK6C,IAAQ,EAElCzD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKnD,EAAK8C,IAAQ,GACvB9K,KAAKmL,KAAKlD,EAAK4C,IAAQ,EACpC5F,EAAMA,EAAKjF,KAAKmL,KAAKlD,EAAK6C,IAAQ,EAKlC,IAAIgB,IAAS1M,GAJb6D,EAAMA,EAAKjD,KAAKmL,KAAKtD,EAAKmD,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKtD,EAAKoD,IAAQ,GACvBjL,KAAKmL,KAAKrD,EAAKkD,IAAQ,KAEW,IAAO,EACtD5L,IAFA6F,EAAMA,EAAKjF,KAAKmL,KAAKrD,EAAKmD,IAAQ,IAErB7D,IAAQ,IAAO,IAAM0E,KAAQ,IAAO,EACjDA,IAAO,SAEP7I,EAAKjD,KAAKmL,KAAKjC,EAAKY,GAEpB1C,GADAA,EAAMpH,KAAKmL,KAAKjC,EAAKa,IACR/J,KAAKmL,KAAKhC,EAAKW,GAAQ,EACpC7E,EAAKjF,KAAKmL,KAAKhC,EAAKY,GACpB9G,EAAMA,EAAKjD,KAAKmL,KAAKpC,EAAKkB,GAAQ,EAElC7C,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKpC,EAAKmB,IAAQ,GACvBlK,KAAKmL,KAAKnC,EAAKiB,GAAQ,EACpChF,EAAMA,EAAKjF,KAAKmL,KAAKnC,EAAKkB,IAAQ,EAClCjH,EAAMA,EAAKjD,KAAKmL,KAAKvC,EAAKwB,IAAQ,EAElChD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKvC,EAAKyB,IAAQ,GACvBrK,KAAKmL,KAAKtC,EAAKuB,IAAQ,EACpCnF,EAAMA,EAAKjF,KAAKmL,KAAKtC,EAAKwB,IAAQ,EAClCpH,EAAMA,EAAKjD,KAAKmL,KAAK1C,EAAK8B,IAAQ,EAElCnD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAK1C,EAAK+B,IAAQ,GACvBxK,KAAKmL,KAAKzC,EAAK6B,IAAQ,EACpCtF,EAAMA,EAAKjF,KAAKmL,KAAKzC,EAAK8B,IAAQ,EAClCvH,EAAMA,EAAKjD,KAAKmL,KAAK7C,EAAKoC,IAAQ,EAElCtD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAK7C,EAAKqC,IAAQ,GACvB3K,KAAKmL,KAAK5C,EAAKmC,IAAQ,EACpCzF,EAAMA,EAAKjF,KAAKmL,KAAK5C,EAAKoC,IAAQ,EAClC1H,EAAMA,EAAKjD,KAAKmL,KAAKhD,EAAK0C,IAAQ,EAElCzD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKhD,EAAK2C,IAAQ,GACvB9K,KAAKmL,KAAK/C,EAAKyC,IAAQ,EACpC5F,EAAMA,EAAKjF,KAAKmL,KAAK/C,EAAK0C,IAAQ,EAKlC,IAAIiB,IAAS3M,GAJb6D,EAAMA,EAAKjD,KAAKmL,KAAKnD,EAAKgD,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKnD,EAAKiD,IAAQ,GACvBjL,KAAKmL,KAAKlD,EAAK+C,IAAQ,KAEW,IAAO,EACtD5L,IAFA6F,EAAMA,EAAKjF,KAAKmL,KAAKlD,EAAKgD,IAAQ,IAErB7D,IAAQ,IAAO,IAAM2E,KAAQ,IAAO,EACjDA,IAAO,SAEP9I,EAAKjD,KAAKmL,KAAKjC,EAAKe,GAEpB7C,GADAA,EAAMpH,KAAKmL,KAAKjC,EAAKgB,KACRlK,KAAKmL,KAAKhC,EAAKc,GAAQ,EACpChF,EAAKjF,KAAKmL,KAAKhC,EAAKe,IACpBjH,EAAMA,EAAKjD,KAAKmL,KAAKpC,EAAKqB,IAAQ,EAElChD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKpC,EAAKsB,IAAQ,GACvBrK,KAAKmL,KAAKnC,EAAKoB,IAAQ,EACpCnF,EAAMA,EAAKjF,KAAKmL,KAAKnC,EAAKqB,IAAQ,EAClCpH,EAAMA,EAAKjD,KAAKmL,KAAKvC,EAAK2B,IAAQ,EAElCnD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKvC,EAAK4B,IAAQ,GACvBxK,KAAKmL,KAAKtC,EAAK0B,IAAQ,EACpCtF,EAAMA,EAAKjF,KAAKmL,KAAKtC,EAAK2B,IAAQ,EAClCvH,EAAMA,EAAKjD,KAAKmL,KAAK1C,EAAKiC,IAAQ,EAElCtD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAK1C,EAAKkC,IAAQ,GACvB3K,KAAKmL,KAAKzC,EAAKgC,IAAQ,EACpCzF,EAAMA,EAAKjF,KAAKmL,KAAKzC,EAAKiC,IAAQ,EAClC1H,EAAMA,EAAKjD,KAAKmL,KAAK7C,EAAKuC,IAAQ,EAElCzD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAK7C,EAAKwC,IAAQ,GACvB9K,KAAKmL,KAAK5C,EAAKsC,IAAQ,EACpC5F,EAAMA,EAAKjF,KAAKmL,KAAK5C,EAAKuC,IAAQ,EAKlC,IAAIkB,IAAS5M,GAJb6D,EAAMA,EAAKjD,KAAKmL,KAAKhD,EAAK6C,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKhD,EAAK8C,IAAQ,GACvBjL,KAAKmL,KAAK/C,EAAK4C,IAAQ,KAEW,IAAO,EACtD5L,IAFA6F,EAAMA,EAAKjF,KAAKmL,KAAK/C,EAAK6C,IAAQ,IAErB7D,IAAQ,IAAO,IAAM4E,KAAQ,IAAO,EACjDA,IAAO,SAEP/I,EAAKjD,KAAKmL,KAAKjC,EAAKkB,IAEpBhD,GADAA,EAAMpH,KAAKmL,KAAKjC,EAAKmB,KACRrK,KAAKmL,KAAKhC,EAAKiB,IAAQ,EACpCnF,EAAKjF,KAAKmL,KAAKhC,EAAKkB,IACpBpH,EAAMA,EAAKjD,KAAKmL,KAAKpC,EAAKwB,IAAQ,EAElCnD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKpC,EAAKyB,IAAQ,GACvBxK,KAAKmL,KAAKnC,EAAKuB,IAAQ,EACpCtF,EAAMA,EAAKjF,KAAKmL,KAAKnC,EAAKwB,IAAQ,EAClCvH,EAAMA,EAAKjD,KAAKmL,KAAKvC,EAAK8B,IAAQ,EAElCtD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKvC,EAAK+B,IAAQ,GACvB3K,KAAKmL,KAAKtC,EAAK6B,IAAQ,EACpCzF,EAAMA,EAAKjF,KAAKmL,KAAKtC,EAAK8B,IAAQ,EAClC1H,EAAMA,EAAKjD,KAAKmL,KAAK1C,EAAKoC,IAAQ,EAElCzD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAK1C,EAAKqC,IAAQ,GACvB9K,KAAKmL,KAAKzC,EAAKmC,IAAQ,EACpC5F,EAAMA,EAAKjF,KAAKmL,KAAKzC,EAAKoC,IAAQ,EAKlC,IAAImB,IAAS7M,GAJb6D,EAAMA,EAAKjD,KAAKmL,KAAK7C,EAAK0C,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMpH,KAAKmL,KAAK7C,EAAK2C,IAAQ,GACvBjL,KAAKmL,KAAK5C,EAAKyC,IAAQ,KAEW,IAAO,EACtD5L,IAFA6F,EAAMA,EAAKjF,KAAKmL,KAAK5C,EAAK0C,IAAQ,IAErB7D,IAAQ,IAAO,IAAM6E,KAAQ,IAAO,EACjDA,IAAO,SAEPhJ,EAAKjD,KAAKmL,KAAKjC,EAAKqB,IAEpBnD,GADAA,EAAMpH,KAAKmL,KAAKjC,EAAKsB,KACRxK,KAAKmL,KAAKhC,EAAKoB,IAAQ,EACpCtF,EAAKjF,KAAKmL,KAAKhC,EAAKqB,IACpBvH,EAAMA,EAAKjD,KAAKmL,KAAKpC,EAAK2B,IAAQ,EAElCtD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKpC,EAAK4B,IAAQ,GACvB3K,KAAKmL,KAAKnC,EAAK0B,IAAQ,EACpCzF,EAAMA,EAAKjF,KAAKmL,KAAKnC,EAAK2B,IAAQ,EAClC1H,EAAMA,EAAKjD,KAAKmL,KAAKvC,EAAKiC,IAAQ,EAElCzD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKvC,EAAKkC,IAAQ,GACvB9K,KAAKmL,KAAKtC,EAAKgC,IAAQ,EACpC5F,EAAMA,EAAKjF,KAAKmL,KAAKtC,EAAKiC,IAAQ,EAKlC,IAAIoB,IAAS9M,GAJb6D,EAAMA,EAAKjD,KAAKmL,KAAK1C,EAAKuC,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMpH,KAAKmL,KAAK1C,EAAKwC,IAAQ,GACvBjL,KAAKmL,KAAKzC,EAAKsC,IAAQ,KAEW,IAAO,EACtD5L,IAFA6F,EAAMA,EAAKjF,KAAKmL,KAAKzC,EAAKuC,IAAQ,IAErB7D,IAAQ,IAAO,IAAM8E,KAAQ,IAAO,EACjDA,IAAO,SAEPjJ,EAAKjD,KAAKmL,KAAKjC,EAAKwB,IAEpBtD,GADAA,EAAMpH,KAAKmL,KAAKjC,EAAKyB,KACR3K,KAAKmL,KAAKhC,EAAKuB,IAAQ,EACpCzF,EAAKjF,KAAKmL,KAAKhC,EAAKwB,IACpB1H,EAAMA,EAAKjD,KAAKmL,KAAKpC,EAAK8B,IAAQ,EAElCzD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKpC,EAAK+B,IAAQ,GACvB9K,KAAKmL,KAAKnC,EAAK6B,IAAQ,EACpC5F,EAAMA,EAAKjF,KAAKmL,KAAKnC,EAAK8B,IAAQ,EAKlC,IAAIqB,IAAS/M,GAJb6D,EAAMA,EAAKjD,KAAKmL,KAAKvC,EAAKoC,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKvC,EAAKqC,IAAQ,GACvBjL,KAAKmL,KAAKtC,EAAKmC,IAAQ,KAEW,IAAO,EACtD5L,IAFA6F,EAAMA,EAAKjF,KAAKmL,KAAKtC,EAAKoC,IAAQ,IAErB7D,IAAQ,IAAO,IAAM+E,KAAQ,IAAO,EACjDA,IAAO,SAEPlJ,EAAKjD,KAAKmL,KAAKjC,EAAK2B,IAEpBzD,GADAA,EAAMpH,KAAKmL,KAAKjC,EAAK4B,KACR9K,KAAKmL,KAAKhC,EAAK0B,IAAQ,EACpC5F,EAAKjF,KAAKmL,KAAKhC,EAAK2B,IAKpB,IAAIsB,IAAShN,GAJb6D,EAAMA,EAAKjD,KAAKmL,KAAKpC,EAAKiC,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKpC,EAAKkC,IAAQ,GACvBjL,KAAKmL,KAAKnC,EAAKgC,IAAQ,KAEW,IAAO,EACtD5L,IAFA6F,EAAMA,EAAKjF,KAAKmL,KAAKnC,EAAKiC,IAAQ,IAErB7D,IAAQ,IAAO,IAAMgF,KAAQ,IAAO,EACjDA,IAAO,SAMP,IAAIC,IAASjN,GAJb6D,EAAKjD,KAAKmL,KAAKjC,EAAK8B,KAIG,KAAa,MAFpC5D,GADAA,EAAMpH,KAAKmL,KAAKjC,EAAK+B,KACRjL,KAAKmL,KAAKhC,EAAK6B,IAAQ,KAEW,IAAO,EA0BtD,OAzBA5L,IAFA6F,EAAKjF,KAAKmL,KAAKhC,EAAK8B,MAEP7D,IAAQ,IAAO,IAAMiF,KAAQ,IAAO,EACjDA,IAAO,SACPhF,EAAE,GAAK6D,GACP7D,EAAE,GAAK+D,GACP/D,EAAE,GAAKgE,GACPhE,EAAE,GAAKiE,GACPjE,EAAE,GAAKkE,GACPlE,EAAE,GAAKmE,GACPnE,EAAE,GAAKoE,GACPpE,EAAE,GAAKqE,GACPrE,EAAE,GAAKsE,GACPtE,EAAE,GAAKuE,GACPvE,EAAE,IAAMwE,GACRxE,EAAE,IAAMyE,GACRzE,EAAE,IAAM0E,GACR1E,EAAE,IAAM2E,GACR3E,EAAE,IAAM4E,GACR5E,EAAE,IAAM6E,GACR7E,EAAE,IAAM8E,GACR9E,EAAE,IAAM+E,GACR/E,EAAE,IAAMgF,GACE,IAANjN,IACFiI,EAAE,IAAMjI,EACR2D,EAAIrE,UAECqE,CACT,EAOA,SAASuJ,EAAUxJ,EAAMxC,EAAKyC,GAC5BA,EAAIvE,SAAW8B,EAAI9B,SAAWsE,EAAKtE,SACnCuE,EAAIrE,OAASoE,EAAKpE,OAAS4B,EAAI5B,OAI/B,IAFA,IAAIwE,EAAQ,EACRqJ,EAAU,EACLpJ,EAAI,EAAGA,EAAIJ,EAAIrE,OAAS,EAAGyE,IAAK,CAGvC,IAAIC,EAASmJ,EACbA,EAAU,EAGV,IAFA,IAAIlJ,EAAgB,SAARH,EACRI,EAAOtD,KAAKC,IAAIkD,EAAG7C,EAAI5B,OAAS,GAC3B2C,EAAIrB,KAAKS,IAAI,EAAG0C,EAAIL,EAAKpE,OAAS,GAAI2C,GAAKiC,EAAMjC,IAAK,CAC7D,IAAInB,EAAIiD,EAAI9B,EAGR7B,GAFoB,EAAhBsD,EAAKrE,MAAMyB,KACI,EAAfI,EAAI7B,MAAM4C,IAGd4B,EAAS,SAAJzD,EAGT6D,EAAa,UADbJ,EAAMA,EAAKI,EAAS,GAIpBkJ,IAFAnJ,GAHAA,EAAUA,GAAW5D,EAAI,SAAa,GAAM,IAGxByD,IAAO,IAAO,KAEZ,GACtBG,GAAU,QACZ,CACAL,EAAItE,MAAM0E,GAAKE,EACfH,EAAQE,EACRA,EAASmJ,CACX,CAOA,OANc,IAAVrJ,EACFH,EAAItE,MAAM0E,GAAKD,EAEfH,EAAIrE,SAGCqE,EAAIvB,QACb,CAEA,SAASgL,EAAY1J,EAAMxC,EAAKyC,GAI9B,OAAOuJ,EAASxJ,EAAMxC,EAAKyC,EAC7B,CAqBA,SAAS0J,EAAMC,EAAGC,GAChBpO,KAAKmO,EAAIA,EACTnO,KAAKoO,EAAIA,CACX,CA1EK3M,KAAKmL,OACRhE,EAActE,GAmDhB3E,EAAGF,UAAU4O,MAAQ,SAAgBtM,EAAKyC,GACxC,IACIhD,EAAMxB,KAAKG,OAAS4B,EAAI5B,OAW5B,OAVoB,KAAhBH,KAAKG,QAAgC,KAAf4B,EAAI5B,OACtByI,EAAY5I,KAAM+B,EAAKyC,GACpBhD,EAAM,GACT8C,EAAWtE,KAAM+B,EAAKyC,GACnBhD,EAAM,KACTuM,EAAS/N,KAAM+B,EAAKyC,GAEpByJ,EAAWjO,KAAM+B,EAAKyC,EAIhC,EAUA0J,EAAKzO,UAAU6O,QAAU,SAAkBC,GAGzC,IAFA,IAAIhI,EAAI,IAAIvE,MAAMuM,GACdC,EAAI7O,EAAGF,UAAU6G,WAAWiI,GAAK,EAC5B5M,EAAI,EAAGA,EAAI4M,EAAG5M,IACrB4E,EAAE5E,GAAK3B,KAAKyO,OAAO9M,EAAG6M,EAAGD,GAG3B,OAAOhI,CACT,EAGA2H,EAAKzO,UAAUgP,OAAS,SAAiBN,EAAGK,EAAGD,GAC7C,GAAU,IAANJ,GAAWA,IAAMI,EAAI,EAAG,OAAOJ,EAGnC,IADA,IAAIO,EAAK,EACA/M,EAAI,EAAGA,EAAI6M,EAAG7M,IACrB+M,IAAW,EAAJP,IAAWK,EAAI7M,EAAI,EAC1BwM,IAAM,EAGR,OAAOO,CACT,EAIAR,EAAKzO,UAAUkP,QAAU,SAAkBC,EAAKC,EAAKC,EAAKC,EAAMC,EAAMT,GACpE,IAAK,IAAI5M,EAAI,EAAGA,EAAI4M,EAAG5M,IACrBoN,EAAKpN,GAAKkN,EAAID,EAAIjN,IAClBqN,EAAKrN,GAAKmN,EAAIF,EAAIjN,GAEtB,EAEAuM,EAAKzO,UAAUwP,UAAY,SAAoBJ,EAAKC,EAAKC,EAAMC,EAAMT,EAAGK,GACtE5O,KAAK2O,QAAQC,EAAKC,EAAKC,EAAKC,EAAMC,EAAMT,GAExC,IAAK,IAAIW,EAAI,EAAGA,EAAIX,EAAGW,IAAM,EAM3B,IALA,IAAIV,EAAIU,GAAK,EAETC,EAAQ1N,KAAK2N,IAAI,EAAI3N,KAAK4N,GAAKb,GAC/Bc,EAAQ7N,KAAK8N,IAAI,EAAI9N,KAAK4N,GAAKb,GAE1BgB,EAAI,EAAGA,EAAIjB,EAAGiB,GAAKhB,EAI1B,IAHA,IAAIiB,EAASN,EACTO,EAASJ,EAEJxM,EAAI,EAAGA,EAAIoM,EAAGpM,IAAK,CAC1B,IAAI6M,EAAKZ,EAAKS,EAAI1M,GACd8M,EAAKZ,EAAKQ,EAAI1M,GAEd+M,EAAKd,EAAKS,EAAI1M,EAAIoM,GAClBY,EAAKd,EAAKQ,EAAI1M,EAAIoM,GAElBa,EAAKN,EAASI,EAAKH,EAASI,EAEhCA,EAAKL,EAASK,EAAKJ,EAASG,EAC5BA,EAAKE,EAELhB,EAAKS,EAAI1M,GAAK6M,EAAKE,EACnBb,EAAKQ,EAAI1M,GAAK8M,EAAKE,EAEnBf,EAAKS,EAAI1M,EAAIoM,GAAKS,EAAKE,EACvBb,EAAKQ,EAAI1M,EAAIoM,GAAKU,EAAKE,EAGnBhN,IAAM0L,IACRuB,EAAKZ,EAAQM,EAASH,EAAQI,EAE9BA,EAASP,EAAQO,EAASJ,EAAQG,EAClCA,EAASM,EAEb,CAGN,EAEA7B,EAAKzO,UAAUuQ,YAAc,SAAsBC,EAAGC,GACpD,IAAI3B,EAAqB,EAAjB9M,KAAKS,IAAIgO,EAAGD,GAChBE,EAAU,EAAJ5B,EACN5M,EAAI,EACR,IAAK4M,EAAIA,EAAI,EAAI,EAAGA,EAAGA,KAAU,EAC/B5M,IAGF,OAAO,GAAKA,EAAI,EAAIwO,CACtB,EAEAjC,EAAKzO,UAAU2Q,UAAY,SAAoBvB,EAAKC,EAAKP,GACvD,KAAIA,GAAK,GAET,IAAK,IAAI5M,EAAI,EAAGA,EAAI4M,EAAI,EAAG5M,IAAK,CAC9B,IAAI4E,EAAIsI,EAAIlN,GAEZkN,EAAIlN,GAAKkN,EAAIN,EAAI5M,EAAI,GACrBkN,EAAIN,EAAI5M,EAAI,GAAK4E,EAEjBA,EAAIuI,EAAInN,GAERmN,EAAInN,IAAMmN,EAAIP,EAAI5M,EAAI,GACtBmN,EAAIP,EAAI5M,EAAI,IAAM4E,CACpB,CACF,EAEA2H,EAAKzO,UAAU4Q,aAAe,SAAuBC,EAAI/B,GAEvD,IADA,IAAI5J,EAAQ,EACHhD,EAAI,EAAGA,EAAI4M,EAAI,EAAG5M,IAAK,CAC9B,IAAIoB,EAAoC,KAAhCtB,KAAK8O,MAAMD,EAAG,EAAI3O,EAAI,GAAK4M,GACjC9M,KAAK8O,MAAMD,EAAG,EAAI3O,GAAK4M,GACvB5J,EAEF2L,EAAG3O,GAAS,SAAJoB,EAGN4B,EADE5B,EAAI,SACE,EAEAA,EAAI,SAAY,CAE5B,CAEA,OAAOuN,CACT,EAEApC,EAAKzO,UAAU+Q,WAAa,SAAqBF,EAAI9O,EAAKqN,EAAKN,GAE7D,IADA,IAAI5J,EAAQ,EACHhD,EAAI,EAAGA,EAAIH,EAAKG,IACvBgD,GAAyB,EAAR2L,EAAG3O,GAEpBkN,EAAI,EAAIlN,GAAa,KAARgD,EAAgBA,KAAkB,GAC/CkK,EAAI,EAAIlN,EAAI,GAAa,KAARgD,EAAgBA,KAAkB,GAIrD,IAAKhD,EAAI,EAAIH,EAAKG,EAAI4M,IAAK5M,EACzBkN,EAAIlN,GAAK,EAGX3C,EAAiB,IAAV2F,GACP3F,EAA6B,KAAb,KAAR2F,GACV,EAEAuJ,EAAKzO,UAAUgR,KAAO,SAAelC,GAEnC,IADA,IAAImC,EAAK,IAAI1O,MAAMuM,GACV5M,EAAI,EAAGA,EAAI4M,EAAG5M,IACrB+O,EAAG/O,GAAK,EAGV,OAAO+O,CACT,EAEAxC,EAAKzO,UAAUkR,KAAO,SAAexC,EAAGC,EAAG5J,GACzC,IAAI+J,EAAI,EAAIvO,KAAKgQ,YAAY7B,EAAEhO,OAAQiO,EAAEjO,QAErCyO,EAAM5O,KAAKsO,QAAQC,GAEnBqC,EAAI5Q,KAAKyQ,KAAKlC,GAEdM,EAAM,IAAI7M,MAAMuM,GAChBsC,EAAO,IAAI7O,MAAMuM,GACjBuC,EAAO,IAAI9O,MAAMuM,GAEjBwC,EAAO,IAAI/O,MAAMuM,GACjByC,EAAQ,IAAIhP,MAAMuM,GAClB0C,EAAQ,IAAIjP,MAAMuM,GAElB2C,EAAO1M,EAAItE,MACfgR,EAAK/Q,OAASoO,EAEdvO,KAAKwQ,WAAWrC,EAAEjO,MAAOiO,EAAEhO,OAAQ0O,EAAKN,GACxCvO,KAAKwQ,WAAWpC,EAAElO,MAAOkO,EAAEjO,OAAQ4Q,EAAMxC,GAEzCvO,KAAKiP,UAAUJ,EAAK+B,EAAGC,EAAMC,EAAMvC,EAAGK,GACtC5O,KAAKiP,UAAU8B,EAAMH,EAAGI,EAAOC,EAAO1C,EAAGK,GAEzC,IAAK,IAAIjN,EAAI,EAAGA,EAAI4M,EAAG5M,IAAK,CAC1B,IAAIoO,EAAKc,EAAKlP,GAAKqP,EAAMrP,GAAKmP,EAAKnP,GAAKsP,EAAMtP,GAC9CmP,EAAKnP,GAAKkP,EAAKlP,GAAKsP,EAAMtP,GAAKmP,EAAKnP,GAAKqP,EAAMrP,GAC/CkP,EAAKlP,GAAKoO,CACZ,CASA,OAPA/P,KAAKoQ,UAAUS,EAAMC,EAAMvC,GAC3BvO,KAAKiP,UAAU4B,EAAMC,EAAMI,EAAMN,EAAGrC,EAAGK,GACvC5O,KAAKoQ,UAAUc,EAAMN,EAAGrC,GACxBvO,KAAKqQ,aAAaa,EAAM3C,GAExB/J,EAAIvE,SAAWkO,EAAElO,SAAWmO,EAAEnO,SAC9BuE,EAAIrE,OAASgO,EAAEhO,OAASiO,EAAEjO,OACnBqE,EAAIvB,QACb,EAGAtD,EAAGF,UAAU6B,IAAM,SAAcS,GAC/B,IAAIyC,EAAM,IAAI7E,EAAG,MAEjB,OADA6E,EAAItE,MAAQ,IAAI8B,MAAMhC,KAAKG,OAAS4B,EAAI5B,QACjCH,KAAKqO,MAAMtM,EAAKyC,EACzB,EAGA7E,EAAGF,UAAU0R,KAAO,SAAepP,GACjC,IAAIyC,EAAM,IAAI7E,EAAG,MAEjB,OADA6E,EAAItE,MAAQ,IAAI8B,MAAMhC,KAAKG,OAAS4B,EAAI5B,QACjC8N,EAAWjO,KAAM+B,EAAKyC,EAC/B,EAGA7E,EAAGF,UAAUmN,KAAO,SAAe7K,GACjC,OAAO/B,KAAK4D,QAAQyK,MAAMtM,EAAK/B,KACjC,EAEAL,EAAGF,UAAU8D,MAAQ,SAAgBxB,GACnC,IAAIqP,EAAWrP,EAAM,EACjBqP,IAAUrP,GAAOA,GAErB/C,EAAsB,iBAAR+C,GACd/C,EAAO+C,EAAM,UAIb,IADA,IAAI4C,EAAQ,EACHhD,EAAI,EAAGA,EAAI3B,KAAKG,OAAQwB,IAAK,CACpC,IAAIoB,GAAqB,EAAhB/C,KAAKE,MAAMyB,IAAUI,EAC1B2C,GAAU,SAAJ3B,IAA0B,SAAR4B,GAC5BA,IAAU,GACVA,GAAU5B,EAAI,SAAa,EAE3B4B,GAASD,IAAO,GAChB1E,KAAKE,MAAMyB,GAAU,SAAL+C,CAClB,CAOA,OALc,IAAVC,IACF3E,KAAKE,MAAMyB,GAAKgD,EAChB3E,KAAKG,UAGAiR,EAAWpR,KAAKoH,OAASpH,IAClC,EAEAL,EAAGF,UAAU4R,KAAO,SAAetP,GACjC,OAAO/B,KAAK4D,QAAQL,MAAMxB,EAC5B,EAGApC,EAAGF,UAAU6R,IAAM,WACjB,OAAOtR,KAAKsB,IAAItB,KAClB,EAGAL,EAAGF,UAAU8R,KAAO,WAClB,OAAOvR,KAAK4M,KAAK5M,KAAK4D,QACxB,EAGAjE,EAAGF,UAAUgE,IAAM,SAAc1B,GAC/B,IAAIgB,EA7xCN,SAAqBhB,GAGnB,IAFA,IAAIgB,EAAI,IAAIf,MAAMD,EAAI0E,aAEb6B,EAAM,EAAGA,EAAMvF,EAAE5C,OAAQmI,IAAO,CACvC,IAAItF,EAAOsF,EAAM,GAAM,EACnBC,EAAOD,EAAM,GAEjBvF,EAAEuF,GAAQvG,EAAI7B,MAAM8C,KAASuF,EAAQ,CACvC,CAEA,OAAOxF,CACT,CAkxCUyO,CAAWzP,GACnB,GAAiB,IAAbgB,EAAE5C,OAAc,OAAO,IAAIR,EAAG,GAIlC,IADA,IAAImG,EAAM9F,KACD2B,EAAI,EAAGA,EAAIoB,EAAE5C,QACP,IAAT4C,EAAEpB,GADsBA,IAAKmE,EAAMA,EAAIwL,OAI7C,KAAM3P,EAAIoB,EAAE5C,OACV,IAAK,IAAIsR,EAAI3L,EAAIwL,MAAO3P,EAAIoB,EAAE5C,OAAQwB,IAAK8P,EAAIA,EAAEH,MAClC,IAATvO,EAAEpB,KAENmE,EAAMA,EAAIxE,IAAImQ,IAIlB,OAAO3L,CACT,EAGAnG,EAAGF,UAAUiS,OAAS,SAAiBC,GACrC3S,EAAuB,iBAAT2S,GAAqBA,GAAQ,GAC3C,IAGIhQ,EAHAV,EAAI0Q,EAAO,GACXzC,GAAKyC,EAAO1Q,GAAK,GACjB2Q,EAAa,WAAe,GAAK3Q,GAAQ,GAAKA,EAGlD,GAAU,IAANA,EAAS,CACX,IAAI0D,EAAQ,EAEZ,IAAKhD,EAAI,EAAGA,EAAI3B,KAAKG,OAAQwB,IAAK,CAChC,IAAIkQ,EAAW7R,KAAKE,MAAMyB,GAAKiQ,EAC3B/Q,GAAsB,EAAhBb,KAAKE,MAAMyB,IAAUkQ,GAAa5Q,EAC5CjB,KAAKE,MAAMyB,GAAKd,EAAI8D,EACpBA,EAAQkN,IAAc,GAAK5Q,CAC7B,CAEI0D,IACF3E,KAAKE,MAAMyB,GAAKgD,EAChB3E,KAAKG,SAET,CAEA,GAAU,IAAN+O,EAAS,CACX,IAAKvN,EAAI3B,KAAKG,OAAS,EAAGwB,GAAK,EAAGA,IAChC3B,KAAKE,MAAMyB,EAAIuN,GAAKlP,KAAKE,MAAMyB,GAGjC,IAAKA,EAAI,EAAGA,EAAIuN,EAAGvN,IACjB3B,KAAKE,MAAMyB,GAAK,EAGlB3B,KAAKG,QAAU+O,CACjB,CAEA,OAAOlP,KAAKiD,QACd,EAEAtD,EAAGF,UAAUqS,MAAQ,SAAgBH,GAGnC,OADA3S,EAAyB,IAAlBgB,KAAKC,UACLD,KAAK0R,OAAOC,EACrB,EAKAhS,EAAGF,UAAUsS,OAAS,SAAiBJ,EAAMK,EAAMC,GAEjD,IAAIC,EADJlT,EAAuB,iBAAT2S,GAAqBA,GAAQ,GAGzCO,EADEF,GACGA,EAAQA,EAAO,IAAO,GAEvB,EAGN,IAAI/Q,EAAI0Q,EAAO,GACXzC,EAAIzN,KAAKC,KAAKiQ,EAAO1Q,GAAK,GAAIjB,KAAKG,QACnCgS,EAAO,SAAc,WAAclR,GAAMA,EACzCmR,EAAcH,EAMlB,GAJAC,GAAKhD,EACLgD,EAAIzQ,KAAKS,IAAI,EAAGgQ,GAGZE,EAAa,CACf,IAAK,IAAIzQ,EAAI,EAAGA,EAAIuN,EAAGvN,IACrByQ,EAAYlS,MAAMyB,GAAK3B,KAAKE,MAAMyB,GAEpCyQ,EAAYjS,OAAS+O,CACvB,CAEA,GAAU,IAANA,QAEG,GAAIlP,KAAKG,OAAS+O,EAEvB,IADAlP,KAAKG,QAAU+O,EACVvN,EAAI,EAAGA,EAAI3B,KAAKG,OAAQwB,IAC3B3B,KAAKE,MAAMyB,GAAK3B,KAAKE,MAAMyB,EAAIuN,QAGjClP,KAAKE,MAAM,GAAK,EAChBF,KAAKG,OAAS,EAGhB,IAAIwE,EAAQ,EACZ,IAAKhD,EAAI3B,KAAKG,OAAS,EAAGwB,GAAK,IAAgB,IAAVgD,GAAehD,GAAKuQ,GAAIvQ,IAAK,CAChE,IAAI2B,EAAuB,EAAhBtD,KAAKE,MAAMyB,GACtB3B,KAAKE,MAAMyB,GAAMgD,GAAU,GAAK1D,EAAOqC,IAASrC,EAChD0D,EAAQrB,EAAO6O,CACjB,CAYA,OATIC,GAAyB,IAAVzN,IACjByN,EAAYlS,MAAMkS,EAAYjS,UAAYwE,GAGxB,IAAhB3E,KAAKG,SACPH,KAAKE,MAAM,GAAK,EAChBF,KAAKG,OAAS,GAGTH,KAAKiD,QACd,EAEAtD,EAAGF,UAAU4S,MAAQ,SAAgBV,EAAMK,EAAMC,GAG/C,OADAjT,EAAyB,IAAlBgB,KAAKC,UACLD,KAAK+R,OAAOJ,EAAMK,EAAMC,EACjC,EAGAtS,EAAGF,UAAU6S,KAAO,SAAeX,GACjC,OAAO3R,KAAK4D,QAAQkO,MAAMH,EAC5B,EAEAhS,EAAGF,UAAU8S,MAAQ,SAAgBZ,GACnC,OAAO3R,KAAK4D,QAAQ8N,OAAOC,EAC7B,EAGAhS,EAAGF,UAAU+S,KAAO,SAAeb,GACjC,OAAO3R,KAAK4D,QAAQyO,MAAMV,EAC5B,EAEAhS,EAAGF,UAAUgT,MAAQ,SAAgBd,GACnC,OAAO3R,KAAK4D,QAAQmO,OAAOJ,EAC7B,EAGAhS,EAAGF,UAAUyH,MAAQ,SAAgBoB,GACnCtJ,EAAsB,iBAARsJ,GAAoBA,GAAO,GACzC,IAAIrH,EAAIqH,EAAM,GACV4G,GAAK5G,EAAMrH,GAAK,GAChBwQ,EAAI,GAAKxQ,EAGb,QAAIjB,KAAKG,QAAU+O,KAGXlP,KAAKE,MAAMgP,GAELuC,GAChB,EAGA9R,EAAGF,UAAUiT,OAAS,SAAiBf,GACrC3S,EAAuB,iBAAT2S,GAAqBA,GAAQ,GAC3C,IAAI1Q,EAAI0Q,EAAO,GACXzC,GAAKyC,EAAO1Q,GAAK,GAIrB,GAFAjC,EAAyB,IAAlBgB,KAAKC,SAAgB,2CAExBD,KAAKG,QAAU+O,EACjB,OAAOlP,KAQT,GALU,IAANiB,GACFiO,IAEFlP,KAAKG,OAASsB,KAAKC,IAAIwN,EAAGlP,KAAKG,QAErB,IAANc,EAAS,CACX,IAAIkR,EAAO,SAAc,WAAclR,GAAMA,EAC7CjB,KAAKE,MAAMF,KAAKG,OAAS,IAAMgS,CACjC,CAEA,OAAOnS,KAAKiD,QACd,EAGAtD,EAAGF,UAAUkT,MAAQ,SAAgBhB,GACnC,OAAO3R,KAAK4D,QAAQ8O,OAAOf,EAC7B,EAGAhS,EAAGF,UAAUuH,MAAQ,SAAgBjF,GAGnC,OAFA/C,EAAsB,iBAAR+C,GACd/C,EAAO+C,EAAM,UACTA,EAAM,EAAU/B,KAAK4S,OAAO7Q,GAGV,IAAlB/B,KAAKC,SACa,IAAhBD,KAAKG,SAAiC,EAAhBH,KAAKE,MAAM,KAAW6B,GAC9C/B,KAAKE,MAAM,GAAK6B,GAAuB,EAAhB/B,KAAKE,MAAM,IAClCF,KAAKC,SAAW,EACTD,OAGTA,KAAKC,SAAW,EAChBD,KAAK4S,MAAM7Q,GACX/B,KAAKC,SAAW,EACTD,MAIFA,KAAKwD,OAAOzB,EACrB,EAEApC,EAAGF,UAAU+D,OAAS,SAAiBzB,GACrC/B,KAAKE,MAAM,IAAM6B,EAGjB,IAAK,IAAIJ,EAAI,EAAGA,EAAI3B,KAAKG,QAAUH,KAAKE,MAAMyB,IAAM,SAAWA,IAC7D3B,KAAKE,MAAMyB,IAAM,SACbA,IAAM3B,KAAKG,OAAS,EACtBH,KAAKE,MAAMyB,EAAI,GAAK,EAEpB3B,KAAKE,MAAMyB,EAAI,KAKnB,OAFA3B,KAAKG,OAASsB,KAAKS,IAAIlC,KAAKG,OAAQwB,EAAI,GAEjC3B,IACT,EAGAL,EAAGF,UAAUmT,MAAQ,SAAgB7Q,GAGnC,GAFA/C,EAAsB,iBAAR+C,GACd/C,EAAO+C,EAAM,UACTA,EAAM,EAAG,OAAO/B,KAAKgH,OAAOjF,GAEhC,GAAsB,IAAlB/B,KAAKC,SAIP,OAHAD,KAAKC,SAAW,EAChBD,KAAKgH,MAAMjF,GACX/B,KAAKC,SAAW,EACTD,KAKT,GAFAA,KAAKE,MAAM,IAAM6B,EAEG,IAAhB/B,KAAKG,QAAgBH,KAAKE,MAAM,GAAK,EACvCF,KAAKE,MAAM,IAAMF,KAAKE,MAAM,GAC5BF,KAAKC,SAAW,OAGhB,IAAK,IAAI0B,EAAI,EAAGA,EAAI3B,KAAKG,QAAUH,KAAKE,MAAMyB,GAAK,EAAGA,IACpD3B,KAAKE,MAAMyB,IAAM,SACjB3B,KAAKE,MAAMyB,EAAI,IAAM,EAIzB,OAAO3B,KAAKiD,QACd,EAEAtD,EAAGF,UAAUoT,KAAO,SAAe9Q,GACjC,OAAO/B,KAAK4D,QAAQoD,MAAMjF,EAC5B,EAEApC,EAAGF,UAAUqT,KAAO,SAAe/Q,GACjC,OAAO/B,KAAK4D,QAAQgP,MAAM7Q,EAC5B,EAEApC,EAAGF,UAAUsT,KAAO,WAGlB,OAFA/S,KAAKC,SAAW,EAETD,IACT,EAEAL,EAAGF,UAAUqH,IAAM,WACjB,OAAO9G,KAAK4D,QAAQmP,MACtB,EAEApT,EAAGF,UAAUuT,aAAe,SAAuBjR,EAAKT,EAAK6E,GAC3D,IACIxE,EAIAoB,EALAvB,EAAMO,EAAI5B,OAASgG,EAGvBnG,KAAK6D,QAAQrC,GAGb,IAAImD,EAAQ,EACZ,IAAKhD,EAAI,EAAGA,EAAII,EAAI5B,OAAQwB,IAAK,CAC/BoB,GAA6B,EAAxB/C,KAAKE,MAAMyB,EAAIwE,IAAcxB,EAClC,IAAIvC,GAAwB,EAAfL,EAAI7B,MAAMyB,IAAUL,EAEjCqD,IADA5B,GAAa,SAARX,IACS,KAAQA,EAAQ,SAAa,GAC3CpC,KAAKE,MAAMyB,EAAIwE,GAAa,SAAJpD,CAC1B,CACA,KAAOpB,EAAI3B,KAAKG,OAASgG,EAAOxE,IAE9BgD,GADA5B,GAA6B,EAAxB/C,KAAKE,MAAMyB,EAAIwE,IAAcxB,IACrB,GACb3E,KAAKE,MAAMyB,EAAIwE,GAAa,SAAJpD,EAG1B,GAAc,IAAV4B,EAAa,OAAO3E,KAAKiD,SAK7B,IAFAjE,GAAkB,IAAX2F,GACPA,EAAQ,EACHhD,EAAI,EAAGA,EAAI3B,KAAKG,OAAQwB,IAE3BgD,GADA5B,IAAsB,EAAhB/C,KAAKE,MAAMyB,IAAUgD,IACd,GACb3E,KAAKE,MAAMyB,GAAS,SAAJoB,EAIlB,OAFA/C,KAAKC,SAAW,EAETD,KAAKiD,QACd,EAEAtD,EAAGF,UAAUwT,SAAW,SAAmBlR,EAAKmR,GAC9C,IAAI/M,GAAQnG,KAAKG,OAAS4B,EAAI5B,QAE1BsE,EAAIzE,KAAK4D,QACTrC,EAAIQ,EAGJoR,EAA8B,EAAxB5R,EAAErB,MAAMqB,EAAEpB,OAAS,GAGf,IADdgG,EAAQ,GADMnG,KAAKsG,WAAW6M,MAG5B5R,EAAIA,EAAEgR,MAAMpM,GACZ1B,EAAEiN,OAAOvL,GACTgN,EAA8B,EAAxB5R,EAAErB,MAAMqB,EAAEpB,OAAS,IAI3B,IACIsR,EADAvB,EAAIzL,EAAEtE,OAASoB,EAAEpB,OAGrB,GAAa,QAAT+S,EAAgB,EAClBzB,EAAI,IAAI9R,EAAG,OACTQ,OAAS+P,EAAI,EACfuB,EAAEvR,MAAQ,IAAI8B,MAAMyP,EAAEtR,QACtB,IAAK,IAAIwB,EAAI,EAAGA,EAAI8P,EAAEtR,OAAQwB,IAC5B8P,EAAEvR,MAAMyB,GAAK,CAEjB,CAEA,IAAIyR,EAAO3O,EAAEb,QAAQoP,aAAazR,EAAG,EAAG2O,GAClB,IAAlBkD,EAAKnT,WACPwE,EAAI2O,EACA3B,IACFA,EAAEvR,MAAMgQ,GAAK,IAIjB,IAAK,IAAIpN,EAAIoN,EAAI,EAAGpN,GAAK,EAAGA,IAAK,CAC/B,IAAIuQ,EAAmC,UAAL,EAAxB5O,EAAEvE,MAAMqB,EAAEpB,OAAS2C,KACE,EAA5B2B,EAAEvE,MAAMqB,EAAEpB,OAAS2C,EAAI,IAO1B,IAHAuQ,EAAK5R,KAAKC,IAAK2R,EAAKF,EAAO,EAAG,UAE9B1O,EAAEuO,aAAazR,EAAG8R,EAAIvQ,GACA,IAAf2B,EAAExE,UACPoT,IACA5O,EAAExE,SAAW,EACbwE,EAAEuO,aAAazR,EAAG,EAAGuB,GAChB2B,EAAEU,WACLV,EAAExE,UAAY,GAGdwR,IACFA,EAAEvR,MAAM4C,GAAKuQ,EAEjB,CAWA,OAVI5B,GACFA,EAAExO,SAEJwB,EAAExB,SAGW,QAATiQ,GAA4B,IAAV/M,GACpB1B,EAAEsN,OAAO5L,GAGJ,CACLmN,IAAK7B,GAAK,KACVpO,IAAKoB,EAET,EAMA9E,EAAGF,UAAU8T,OAAS,SAAiBxR,EAAKmR,EAAMM,GAGhD,OAFAxU,GAAQ+C,EAAIoD,UAERnF,KAAKmF,SACA,CACLmO,IAAK,IAAI3T,EAAG,GACZ0D,IAAK,IAAI1D,EAAG,IAKM,IAAlBK,KAAKC,UAAmC,IAAjB8B,EAAI9B,UAC7B6F,EAAM9F,KAAKsH,MAAMiM,OAAOxR,EAAKmR,GAEhB,QAATA,IACFI,EAAMxN,EAAIwN,IAAIhM,OAGH,QAAT4L,IACF7P,EAAMyC,EAAIzC,IAAIiE,MACVkM,GAA6B,IAAjBnQ,EAAIpD,UAClBoD,EAAImF,KAAKzG,IAIN,CACLuR,IAAKA,EACLjQ,IAAKA,IAIa,IAAlBrD,KAAKC,UAAmC,IAAjB8B,EAAI9B,UAC7B6F,EAAM9F,KAAKuT,OAAOxR,EAAIuF,MAAO4L,GAEhB,QAATA,IACFI,EAAMxN,EAAIwN,IAAIhM,OAGT,CACLgM,IAAKA,EACLjQ,IAAKyC,EAAIzC,MAI0B,IAAlCrD,KAAKC,SAAW8B,EAAI9B,WACvB6F,EAAM9F,KAAKsH,MAAMiM,OAAOxR,EAAIuF,MAAO4L,GAEtB,QAATA,IACF7P,EAAMyC,EAAIzC,IAAIiE,MACVkM,GAA6B,IAAjBnQ,EAAIpD,UAClBoD,EAAIoF,KAAK1G,IAIN,CACLuR,IAAKxN,EAAIwN,IACTjQ,IAAKA,IAOLtB,EAAI5B,OAASH,KAAKG,QAAUH,KAAKqC,IAAIN,GAAO,EACvC,CACLuR,IAAK,IAAI3T,EAAG,GACZ0D,IAAKrD,MAKU,IAAf+B,EAAI5B,OACO,QAAT+S,EACK,CACLI,IAAKtT,KAAKyT,KAAK1R,EAAI7B,MAAM,IACzBmD,IAAK,MAII,QAAT6P,EACK,CACLI,IAAK,KACLjQ,IAAK,IAAI1D,EAAGK,KAAKoF,MAAMrD,EAAI7B,MAAM,MAI9B,CACLoT,IAAKtT,KAAKyT,KAAK1R,EAAI7B,MAAM,IACzBmD,IAAK,IAAI1D,EAAGK,KAAKoF,MAAMrD,EAAI7B,MAAM,MAI9BF,KAAKiT,SAASlR,EAAKmR,GAlF1B,IAAII,EAAKjQ,EAAKyC,CAmFhB,EAGAnG,EAAGF,UAAU6T,IAAM,SAAcvR,GAC/B,OAAO/B,KAAKuT,OAAOxR,EAAK,OAAO,GAAOuR,GACxC,EAGA3T,EAAGF,UAAU4D,IAAM,SAActB,GAC/B,OAAO/B,KAAKuT,OAAOxR,EAAK,OAAO,GAAOsB,GACxC,EAEA1D,EAAGF,UAAUiU,KAAO,SAAe3R,GACjC,OAAO/B,KAAKuT,OAAOxR,EAAK,OAAO,GAAMsB,GACvC,EAGA1D,EAAGF,UAAUkU,SAAW,SAAmB5R,GACzC,IAAI6R,EAAK5T,KAAKuT,OAAOxR,GAGrB,GAAI6R,EAAGvQ,IAAI8B,SAAU,OAAOyO,EAAGN,IAE/B,IAAIjQ,EAA0B,IAApBuQ,EAAGN,IAAIrT,SAAiB2T,EAAGvQ,IAAIoF,KAAK1G,GAAO6R,EAAGvQ,IAEpDwQ,EAAO9R,EAAI0Q,MAAM,GACjBqB,EAAK/R,EAAIgS,MAAM,GACf1R,EAAMgB,EAAIhB,IAAIwR,GAGlB,OAAIxR,EAAM,GAAa,IAAPyR,GAAoB,IAARzR,EAAmBuR,EAAGN,IAGvB,IAApBM,EAAGN,IAAIrT,SAAiB2T,EAAGN,IAAIV,MAAM,GAAKgB,EAAGN,IAAItM,MAAM,EAChE,EAEArH,EAAGF,UAAU2F,MAAQ,SAAgBrD,GACnC,IAAIqP,EAAWrP,EAAM,EACjBqP,IAAUrP,GAAOA,GAErB/C,EAAO+C,GAAO,UAId,IAHA,IAAIyN,GAAK,GAAK,IAAMzN,EAEhBiS,EAAM,EACDrS,EAAI3B,KAAKG,OAAS,EAAGwB,GAAK,EAAGA,IACpCqS,GAAOxE,EAAIwE,GAAuB,EAAhBhU,KAAKE,MAAMyB,KAAWI,EAG1C,OAAOqP,GAAY4C,EAAMA,CAC3B,EAGArU,EAAGF,UAAUwU,KAAO,SAAelS,GACjC,OAAO/B,KAAKoF,MAAMrD,EACpB,EAGApC,EAAGF,UAAU4F,MAAQ,SAAgBtD,GACnC,IAAIqP,EAAWrP,EAAM,EACjBqP,IAAUrP,GAAOA,GAErB/C,EAAO+C,GAAO,UAGd,IADA,IAAI4C,EAAQ,EACHhD,EAAI3B,KAAKG,OAAS,EAAGwB,GAAK,EAAGA,IAAK,CACzC,IAAIoB,GAAqB,EAAhB/C,KAAKE,MAAMyB,IAAkB,SAARgD,EAC9B3E,KAAKE,MAAMyB,GAAMoB,EAAIhB,EAAO,EAC5B4C,EAAQ5B,EAAIhB,CACd,CAGA,OADA/B,KAAKiD,SACEmO,EAAWpR,KAAKoH,OAASpH,IAClC,EAEAL,EAAGF,UAAUgU,KAAO,SAAe1R,GACjC,OAAO/B,KAAK4D,QAAQyB,MAAMtD,EAC5B,EAEApC,EAAGF,UAAUyU,KAAO,SAAe1E,GACjCxQ,EAAsB,IAAfwQ,EAAEvP,UACTjB,GAAQwQ,EAAErK,UAEV,IAAIgJ,EAAInO,KACJoO,EAAIoB,EAAE5L,QAGRuK,EADiB,IAAfA,EAAElO,SACAkO,EAAEuF,KAAKlE,GAEPrB,EAAEvK,QAaR,IATA,IAAIuQ,EAAI,IAAIxU,EAAG,GACXyU,EAAI,IAAIzU,EAAG,GAGX0U,EAAI,IAAI1U,EAAG,GACX2U,EAAI,IAAI3U,EAAG,GAEX4U,EAAI,EAEDpG,EAAEqG,UAAYpG,EAAEoG,UACrBrG,EAAE4D,OAAO,GACT3D,EAAE2D,OAAO,KACPwC,EAMJ,IAHA,IAAIE,EAAKrG,EAAExK,QACP8Q,EAAKvG,EAAEvK,SAEHuK,EAAEhJ,UAAU,CAClB,IAAK,IAAIxD,EAAI,EAAGgT,EAAK,EAAyB,IAArBxG,EAAEjO,MAAM,GAAKyU,IAAahT,EAAI,KAAMA,EAAGgT,IAAO,GACvE,GAAIhT,EAAI,EAEN,IADAwM,EAAE4D,OAAOpQ,GACFA,KAAM,IACPwS,EAAES,SAAWR,EAAEQ,WACjBT,EAAE3L,KAAKiM,GACPL,EAAE3L,KAAKiM,IAGTP,EAAEpC,OAAO,GACTqC,EAAErC,OAAO,GAIb,IAAK,IAAIjP,EAAI,EAAG+R,EAAK,EAAyB,IAArBzG,EAAElO,MAAM,GAAK2U,IAAa/R,EAAI,KAAMA,EAAG+R,IAAO,GACvE,GAAI/R,EAAI,EAEN,IADAsL,EAAE2D,OAAOjP,GACFA,KAAM,IACPuR,EAAEO,SAAWN,EAAEM,WACjBP,EAAE7L,KAAKiM,GACPH,EAAE7L,KAAKiM,IAGTL,EAAEtC,OAAO,GACTuC,EAAEvC,OAAO,GAIT5D,EAAE9L,IAAI+L,IAAM,GACdD,EAAE1F,KAAK2F,GACP+F,EAAE1L,KAAK4L,GACPD,EAAE3L,KAAK6L,KAEPlG,EAAE3F,KAAK0F,GACPkG,EAAE5L,KAAK0L,GACPG,EAAE7L,KAAK2L,GAEX,CAEA,MAAO,CACL3P,EAAG4P,EACH9S,EAAG+S,EACHQ,IAAK1G,EAAEsD,OAAO6C,GAElB,EAKA5U,EAAGF,UAAUsV,OAAS,SAAiBvF,GACrCxQ,EAAsB,IAAfwQ,EAAEvP,UACTjB,GAAQwQ,EAAErK,UAEV,IAAIV,EAAIzE,KACJuB,EAAIiO,EAAE5L,QAGRa,EADiB,IAAfA,EAAExE,SACAwE,EAAEiP,KAAKlE,GAEP/K,EAAEb,QAQR,IALA,IAuCIkC,EAvCAkP,EAAK,IAAIrV,EAAG,GACZsV,EAAK,IAAItV,EAAG,GAEZuV,EAAQ3T,EAAEqC,QAEPa,EAAE0Q,KAAK,GAAK,GAAK5T,EAAE4T,KAAK,GAAK,GAAG,CACrC,IAAK,IAAIxT,EAAI,EAAGgT,EAAK,EAAyB,IAArBlQ,EAAEvE,MAAM,GAAKyU,IAAahT,EAAI,KAAMA,EAAGgT,IAAO,GACvE,GAAIhT,EAAI,EAEN,IADA8C,EAAEsN,OAAOpQ,GACFA,KAAM,GACPqT,EAAGJ,SACLI,EAAGxM,KAAK0M,GAGVF,EAAGjD,OAAO,GAId,IAAK,IAAIjP,EAAI,EAAG+R,EAAK,EAAyB,IAArBtT,EAAErB,MAAM,GAAK2U,IAAa/R,EAAI,KAAMA,EAAG+R,IAAO,GACvE,GAAI/R,EAAI,EAEN,IADAvB,EAAEwQ,OAAOjP,GACFA,KAAM,GACPmS,EAAGL,SACLK,EAAGzM,KAAK0M,GAGVD,EAAGlD,OAAO,GAIVtN,EAAEpC,IAAId,IAAM,GACdkD,EAAEgE,KAAKlH,GACPyT,EAAGvM,KAAKwM,KAER1T,EAAEkH,KAAKhE,GACPwQ,EAAGxM,KAAKuM,GAEZ,CAaA,OATElP,EADgB,IAAdrB,EAAE0Q,KAAK,GACHH,EAEAC,GAGAE,KAAK,GAAK,GAChBrP,EAAI0C,KAAKgH,GAGJ1J,CACT,EAEAnG,EAAGF,UAAUqV,IAAM,SAAc/S,GAC/B,GAAI/B,KAAKmF,SAAU,OAAOpD,EAAI+E,MAC9B,GAAI/E,EAAIoD,SAAU,OAAOnF,KAAK8G,MAE9B,IAAIrC,EAAIzE,KAAK4D,QACTrC,EAAIQ,EAAI6B,QACZa,EAAExE,SAAW,EACbsB,EAAEtB,SAAW,EAGb,IAAK,IAAIkG,EAAQ,EAAG1B,EAAE+P,UAAYjT,EAAEiT,SAAUrO,IAC5C1B,EAAEsN,OAAO,GACTxQ,EAAEwQ,OAAO,GAGX,OAAG,CACD,KAAOtN,EAAE+P,UACP/P,EAAEsN,OAAO,GAEX,KAAOxQ,EAAEiT,UACPjT,EAAEwQ,OAAO,GAGX,IAAI9Q,EAAIwD,EAAEpC,IAAId,GACd,GAAIN,EAAI,EAAG,CAET,IAAIsF,EAAI9B,EACRA,EAAIlD,EACJA,EAAIgF,CACN,MAAO,GAAU,IAANtF,GAAyB,IAAdM,EAAE4T,KAAK,GAC3B,MAGF1Q,EAAEgE,KAAKlH,EACT,CAEA,OAAOA,EAAEmQ,OAAOvL,EAClB,EAGAxG,EAAGF,UAAU2V,KAAO,SAAerT,GACjC,OAAO/B,KAAKkU,KAAKnS,GAAK0C,EAAEiP,KAAK3R,EAC/B,EAEApC,EAAGF,UAAU+U,OAAS,WACpB,OAA+B,IAAP,EAAhBxU,KAAKE,MAAM,GACrB,EAEAP,EAAGF,UAAUmV,MAAQ,WACnB,OAA+B,IAAP,EAAhB5U,KAAKE,MAAM,GACrB,EAGAP,EAAGF,UAAUsU,MAAQ,SAAgBhS,GACnC,OAAO/B,KAAKE,MAAM,GAAK6B,CACzB,EAGApC,EAAGF,UAAU4V,MAAQ,SAAgB/M,GACnCtJ,EAAsB,iBAARsJ,GACd,IAAIrH,EAAIqH,EAAM,GACV4G,GAAK5G,EAAMrH,GAAK,GAChBwQ,EAAI,GAAKxQ,EAGb,GAAIjB,KAAKG,QAAU+O,EAGjB,OAFAlP,KAAK6D,QAAQqL,EAAI,GACjBlP,KAAKE,MAAMgP,IAAMuC,EACVzR,KAKT,IADA,IAAI2E,EAAQ8M,EACH9P,EAAIuN,EAAa,IAAVvK,GAAehD,EAAI3B,KAAKG,OAAQwB,IAAK,CACnD,IAAIoB,EAAoB,EAAhB/C,KAAKE,MAAMyB,GAEnBgD,GADA5B,GAAK4B,KACS,GACd5B,GAAK,SACL/C,KAAKE,MAAMyB,GAAKoB,CAClB,CAKA,OAJc,IAAV4B,IACF3E,KAAKE,MAAMyB,GAAKgD,EAChB3E,KAAKG,UAEAH,IACT,EAEAL,EAAGF,UAAU0F,OAAS,WACpB,OAAuB,IAAhBnF,KAAKG,QAAkC,IAAlBH,KAAKE,MAAM,EACzC,EAEAP,EAAGF,UAAU0V,KAAO,SAAepT,GACjC,IAOI+D,EAPA7F,EAAW8B,EAAM,EAErB,GAAsB,IAAlB/B,KAAKC,WAAmBA,EAAU,OAAQ,EAC9C,GAAsB,IAAlBD,KAAKC,UAAkBA,EAAU,OAAO,EAK5C,GAHAD,KAAKiD,SAGDjD,KAAKG,OAAS,EAChB2F,EAAM,MACD,CACD7F,IACF8B,GAAOA,GAGT/C,EAAO+C,GAAO,SAAW,qBAEzB,IAAIgB,EAAoB,EAAhB/C,KAAKE,MAAM,GACnB4F,EAAM/C,IAAMhB,EAAM,EAAIgB,EAAIhB,GAAO,EAAI,CACvC,CACA,OAAsB,IAAlB/B,KAAKC,SAA8B,GAAN6F,EAC1BA,CACT,EAMAnG,EAAGF,UAAU4C,IAAM,SAAcN,GAC/B,GAAsB,IAAlB/B,KAAKC,UAAmC,IAAjB8B,EAAI9B,SAAgB,OAAQ,EACvD,GAAsB,IAAlBD,KAAKC,UAAmC,IAAjB8B,EAAI9B,SAAgB,OAAO,EAEtD,IAAI6F,EAAM9F,KAAKsV,KAAKvT,GACpB,OAAsB,IAAlB/B,KAAKC,SAA8B,GAAN6F,EAC1BA,CACT,EAGAnG,EAAGF,UAAU6V,KAAO,SAAevT,GAEjC,GAAI/B,KAAKG,OAAS4B,EAAI5B,OAAQ,OAAO,EACrC,GAAIH,KAAKG,OAAS4B,EAAI5B,OAAQ,OAAQ,EAGtC,IADA,IAAI2F,EAAM,EACDnE,EAAI3B,KAAKG,OAAS,EAAGwB,GAAK,EAAGA,IAAK,CACzC,IAAI8C,EAAoB,EAAhBzE,KAAKE,MAAMyB,GACfJ,EAAmB,EAAfQ,EAAI7B,MAAMyB,GAElB,GAAI8C,IAAMlD,EAAV,CACIkD,EAAIlD,EACNuE,GAAO,EACErB,EAAIlD,IACbuE,EAAM,GAER,KANqB,CAOvB,CACA,OAAOA,CACT,EAEAnG,EAAGF,UAAU8V,IAAM,SAAcxT,GAC/B,OAA0B,IAAnB/B,KAAKmV,KAAKpT,EACnB,EAEApC,EAAGF,UAAU+V,GAAK,SAAazT,GAC7B,OAAyB,IAAlB/B,KAAKqC,IAAIN,EAClB,EAEApC,EAAGF,UAAUgW,KAAO,SAAe1T,GACjC,OAAO/B,KAAKmV,KAAKpT,IAAQ,CAC3B,EAEApC,EAAGF,UAAUiW,IAAM,SAAc3T,GAC/B,OAAO/B,KAAKqC,IAAIN,IAAQ,CAC1B,EAEApC,EAAGF,UAAUkW,IAAM,SAAc5T,GAC/B,OAA2B,IAApB/B,KAAKmV,KAAKpT,EACnB,EAEApC,EAAGF,UAAUmW,GAAK,SAAa7T,GAC7B,OAA0B,IAAnB/B,KAAKqC,IAAIN,EAClB,EAEApC,EAAGF,UAAUoW,KAAO,SAAe9T,GACjC,OAAO/B,KAAKmV,KAAKpT,IAAQ,CAC3B,EAEApC,EAAGF,UAAUqW,IAAM,SAAc/T,GAC/B,OAAO/B,KAAKqC,IAAIN,IAAQ,CAC1B,EAEApC,EAAGF,UAAUsW,IAAM,SAAchU,GAC/B,OAA0B,IAAnB/B,KAAKmV,KAAKpT,EACnB,EAEApC,EAAGF,UAAUuW,GAAK,SAAajU,GAC7B,OAAyB,IAAlB/B,KAAKqC,IAAIN,EAClB,EAMApC,EAAGS,IAAM,SAAc2B,GACrB,OAAO,IAAIkU,EAAIlU,EACjB,EAEApC,EAAGF,UAAUyW,MAAQ,SAAgBC,GAGnC,OAFAnX,GAAQgB,KAAKI,IAAK,yCAClBpB,EAAyB,IAAlBgB,KAAKC,SAAgB,iCACrBkW,EAAIC,UAAUpW,MAAMqW,UAAUF,EACvC,EAEAxW,EAAGF,UAAU6W,QAAU,WAErB,OADAtX,EAAOgB,KAAKI,IAAK,wDACVJ,KAAKI,IAAImW,YAAYvW,KAC9B,EAEAL,EAAGF,UAAU4W,UAAY,SAAoBF,GAE3C,OADAnW,KAAKI,IAAM+V,EACJnW,IACT,EAEAL,EAAGF,UAAU+W,SAAW,SAAmBL,GAEzC,OADAnX,GAAQgB,KAAKI,IAAK,yCACXJ,KAAKqW,UAAUF,EACxB,EAEAxW,EAAGF,UAAUgX,OAAS,SAAiB1U,GAErC,OADA/C,EAAOgB,KAAKI,IAAK,sCACVJ,KAAKI,IAAIsI,IAAI1I,KAAM+B,EAC5B,EAEApC,EAAGF,UAAUiX,QAAU,SAAkB3U,GAEvC,OADA/C,EAAOgB,KAAKI,IAAK,uCACVJ,KAAKI,IAAIoI,KAAKxI,KAAM+B,EAC7B,EAEApC,EAAGF,UAAUkX,OAAS,SAAiB5U,GAErC,OADA/C,EAAOgB,KAAKI,IAAK,sCACVJ,KAAKI,IAAIuI,IAAI3I,KAAM+B,EAC5B,EAEApC,EAAGF,UAAUmX,QAAU,SAAkB7U,GAEvC,OADA/C,EAAOgB,KAAKI,IAAK,uCACVJ,KAAKI,IAAIqI,KAAKzI,KAAM+B,EAC7B,EAEApC,EAAGF,UAAUoX,OAAS,SAAiB9U,GAErC,OADA/C,EAAOgB,KAAKI,IAAK,sCACVJ,KAAKI,IAAI0W,IAAI9W,KAAM+B,EAC5B,EAEApC,EAAGF,UAAUsX,OAAS,SAAiBhV,GAGrC,OAFA/C,EAAOgB,KAAKI,IAAK,sCACjBJ,KAAKI,IAAI4W,SAAShX,KAAM+B,GACjB/B,KAAKI,IAAIkB,IAAItB,KAAM+B,EAC5B,EAEApC,EAAGF,UAAUwX,QAAU,SAAkBlV,GAGvC,OAFA/C,EAAOgB,KAAKI,IAAK,sCACjBJ,KAAKI,IAAI4W,SAAShX,KAAM+B,GACjB/B,KAAKI,IAAIwM,KAAK5M,KAAM+B,EAC7B,EAEApC,EAAGF,UAAUyX,OAAS,WAGpB,OAFAlY,EAAOgB,KAAKI,IAAK,sCACjBJ,KAAKI,IAAI+W,SAASnX,MACXA,KAAKI,IAAIkR,IAAItR,KACtB,EAEAL,EAAGF,UAAU2X,QAAU,WAGrB,OAFApY,EAAOgB,KAAKI,IAAK,uCACjBJ,KAAKI,IAAI+W,SAASnX,MACXA,KAAKI,IAAImR,KAAKvR,KACvB,EAGAL,EAAGF,UAAU4X,QAAU,WAGrB,OAFArY,EAAOgB,KAAKI,IAAK,uCACjBJ,KAAKI,IAAI+W,SAASnX,MACXA,KAAKI,IAAIkX,KAAKtX,KACvB,EAEAL,EAAGF,UAAU8X,QAAU,WAGrB,OAFAvY,EAAOgB,KAAKI,IAAK,uCACjBJ,KAAKI,IAAI+W,SAASnX,MACXA,KAAKI,IAAIgV,KAAKpV,KACvB,EAGAL,EAAGF,UAAU+X,OAAS,WAGpB,OAFAxY,EAAOgB,KAAKI,IAAK,sCACjBJ,KAAKI,IAAI+W,SAASnX,MACXA,KAAKI,IAAIkH,IAAItH,KACtB,EAEAL,EAAGF,UAAUgY,OAAS,SAAiB1V,GAGrC,OAFA/C,EAAOgB,KAAKI,MAAQ2B,EAAI3B,IAAK,qBAC7BJ,KAAKI,IAAI+W,SAASnX,MACXA,KAAKI,IAAIqD,IAAIzD,KAAM+B,EAC5B,EAGA,IAAI2V,EAAS,CACXC,KAAM,KACNC,KAAM,KACNC,KAAM,KACNC,OAAQ,MAIV,SAASC,EAAQC,EAAMxI,GAErBxP,KAAKgY,KAAOA,EACZhY,KAAKwP,EAAI,IAAI7P,EAAG6P,EAAG,IACnBxP,KAAKiQ,EAAIjQ,KAAKwP,EAAE/I,YAChBzG,KAAK4E,EAAI,IAAIjF,EAAG,GAAG+R,OAAO1R,KAAKiQ,GAAGxH,KAAKzI,KAAKwP,GAE5CxP,KAAKiY,IAAMjY,KAAKkY,MAClB,CAgDA,SAASC,IACPJ,EAAOK,KACLpY,KACA,OACA,0EACJ,CA8DA,SAASqY,IACPN,EAAOK,KACLpY,KACA,OACA,iEACJ,CAGA,SAASsY,IACPP,EAAOK,KACLpY,KACA,OACA,wDACJ,CAGA,SAASuY,IAEPR,EAAOK,KACLpY,KACA,QACA,sEACJ,CA6CA,SAASiW,EAAK/F,GACZ,GAAiB,iBAANA,EAAgB,CACzB,IAAIsI,EAAQ7Y,EAAG8Y,OAAOvI,GACtBlQ,KAAKkQ,EAAIsI,EAAMhJ,EACfxP,KAAKwY,MAAQA,CACf,MACExZ,EAAOkR,EAAEqF,IAAI,GAAI,kCACjBvV,KAAKkQ,EAAIA,EACTlQ,KAAKwY,MAAQ,IAEjB,CAkOA,SAASE,EAAMxI,GACb+F,EAAImC,KAAKpY,KAAMkQ,GAEflQ,KAAKmG,MAAQnG,KAAKkQ,EAAEzJ,YAChBzG,KAAKmG,MAAQ,IAAO,IACtBnG,KAAKmG,OAAS,GAAMnG,KAAKmG,MAAQ,IAGnCnG,KAAKiB,EAAI,IAAItB,EAAG,GAAG+R,OAAO1R,KAAKmG,OAC/BnG,KAAK8T,GAAK9T,KAAK2Y,KAAK3Y,KAAKiB,EAAEqQ,OAC3BtR,KAAK4Y,KAAO5Y,KAAKiB,EAAE8T,OAAO/U,KAAKkQ,GAE/BlQ,KAAK6Y,KAAO7Y,KAAK4Y,KAAKtX,IAAItB,KAAKiB,GAAG2R,MAAM,GAAGU,IAAItT,KAAKkQ,GACpDlQ,KAAK6Y,KAAO7Y,KAAK6Y,KAAKnF,KAAK1T,KAAKiB,GAChCjB,KAAK6Y,KAAO7Y,KAAKiB,EAAE0H,IAAI3I,KAAK6Y,KAC9B,CA/aAd,EAAOtY,UAAUyY,KAAO,WACtB,IAAID,EAAM,IAAItY,EAAG,MAEjB,OADAsY,EAAI/X,MAAQ,IAAI8B,MAAMP,KAAKoB,KAAK7C,KAAKiQ,EAAI,KAClCgI,CACT,EAEAF,EAAOtY,UAAUqZ,QAAU,SAAkB/W,GAG3C,IACIgX,EADA9X,EAAIc,EAGR,GACE/B,KAAKgZ,MAAM/X,EAAGjB,KAAKiY,KAGnBc,GADA9X,GADAA,EAAIjB,KAAKiZ,MAAMhY,IACTuH,KAAKxI,KAAKiY,MACPxR,kBACFsS,EAAO/Y,KAAKiQ,GAErB,IAAI5N,EAAM0W,EAAO/Y,KAAKiQ,GAAK,EAAIhP,EAAEqU,KAAKtV,KAAKwP,GAgB3C,OAfY,IAARnN,GACFpB,EAAEf,MAAM,GAAK,EACbe,EAAEd,OAAS,GACFkC,EAAM,EACfpB,EAAEwH,KAAKzI,KAAKwP,QAEI0J,IAAZjY,EAAEkY,MAEJlY,EAAEkY,QAGFlY,EAAEgC,SAIChC,CACT,EAEA8W,EAAOtY,UAAUuZ,MAAQ,SAAgBI,EAAO5U,GAC9C4U,EAAMrH,OAAO/R,KAAKiQ,EAAG,EAAGzL,EAC1B,EAEAuT,EAAOtY,UAAUwZ,MAAQ,SAAgBlX,GACvC,OAAOA,EAAI6K,KAAK5M,KAAK4E,EACvB,EAQAxF,EAAS+Y,EAAMJ,GAEfI,EAAK1Y,UAAUuZ,MAAQ,SAAgBI,EAAOC,GAK5C,IAHA,IAAIlH,EAAO,QAEPmH,EAAS7X,KAAKC,IAAI0X,EAAMjZ,OAAQ,GAC3BwB,EAAI,EAAGA,EAAI2X,EAAQ3X,IAC1B0X,EAAOnZ,MAAMyB,GAAKyX,EAAMlZ,MAAMyB,GAIhC,GAFA0X,EAAOlZ,OAASmZ,EAEZF,EAAMjZ,QAAU,EAGlB,OAFAiZ,EAAMlZ,MAAM,GAAK,OACjBkZ,EAAMjZ,OAAS,GAKjB,IAAIoZ,EAAOH,EAAMlZ,MAAM,GAGvB,IAFAmZ,EAAOnZ,MAAMmZ,EAAOlZ,UAAYoZ,EAAOpH,EAElCxQ,EAAI,GAAIA,EAAIyX,EAAMjZ,OAAQwB,IAAK,CAClC,IAAI6X,EAAwB,EAAjBJ,EAAMlZ,MAAMyB,GACvByX,EAAMlZ,MAAMyB,EAAI,KAAQ6X,EAAOrH,IAAS,EAAMoH,IAAS,GACvDA,EAAOC,CACT,CACAD,KAAU,GACVH,EAAMlZ,MAAMyB,EAAI,IAAM4X,EACT,IAATA,GAAcH,EAAMjZ,OAAS,GAC/BiZ,EAAMjZ,QAAU,GAEhBiZ,EAAMjZ,QAAU,CAEpB,EAEAgY,EAAK1Y,UAAUwZ,MAAQ,SAAgBlX,GAErCA,EAAI7B,MAAM6B,EAAI5B,QAAU,EACxB4B,EAAI7B,MAAM6B,EAAI5B,OAAS,GAAK,EAC5B4B,EAAI5B,QAAU,EAId,IADA,IAAIuE,EAAK,EACA/C,EAAI,EAAGA,EAAII,EAAI5B,OAAQwB,IAAK,CACnC,IAAIoB,EAAmB,EAAfhB,EAAI7B,MAAMyB,GAClB+C,GAAU,IAAJ3B,EACNhB,EAAI7B,MAAMyB,GAAU,SAAL+C,EACfA,EAAS,GAAJ3B,GAAa2B,EAAK,SAAa,EACtC,CASA,OANkC,IAA9B3C,EAAI7B,MAAM6B,EAAI5B,OAAS,KACzB4B,EAAI5B,SAC8B,IAA9B4B,EAAI7B,MAAM6B,EAAI5B,OAAS,IACzB4B,EAAI5B,UAGD4B,CACT,EAQA3C,EAASiZ,EAAMN,GAQf3Y,EAASkZ,EAAMP,GASf3Y,EAASmZ,EAAQR,GAEjBQ,EAAO9Y,UAAUwZ,MAAQ,SAAgBlX,GAGvC,IADA,IAAI4C,EAAQ,EACHhD,EAAI,EAAGA,EAAII,EAAI5B,OAAQwB,IAAK,CACnC,IAAI+E,EAA0B,IAAL,EAAf3E,EAAI7B,MAAMyB,IAAiBgD,EACjCD,EAAU,SAALgC,EACTA,KAAQ,GAER3E,EAAI7B,MAAMyB,GAAK+C,EACfC,EAAQ+B,CACV,CAIA,OAHc,IAAV/B,IACF5C,EAAI7B,MAAM6B,EAAI5B,UAAYwE,GAErB5C,CACT,EAGApC,EAAG8Y,OAAS,SAAgBT,GAE1B,GAAIN,EAAOM,GAAO,OAAON,EAAOM,GAEhC,IAAIQ,EACJ,GAAa,SAATR,EACFQ,EAAQ,IAAIL,OACP,GAAa,SAATH,EACTQ,EAAQ,IAAIH,OACP,GAAa,SAATL,EACTQ,EAAQ,IAAIF,MACP,IAAa,WAATN,EAGT,MAAM,IAAI7Y,MAAM,iBAAmB6Y,GAFnCQ,EAAQ,IAAID,CAGd,CAGA,OAFAb,EAAOM,GAAQQ,EAERA,CACT,EAiBAvC,EAAIxW,UAAU0X,SAAW,SAAmB1S,GAC1CzF,EAAsB,IAAfyF,EAAExE,SAAgB,iCACzBjB,EAAOyF,EAAErE,IAAK,kCAChB,EAEA6V,EAAIxW,UAAUuX,SAAW,SAAmBvS,EAAGlD,GAC7CvC,EAAqC,IAA7ByF,EAAExE,SAAWsB,EAAEtB,UAAiB,iCACxCjB,EAAOyF,EAAErE,KAAOqE,EAAErE,MAAQmB,EAAEnB,IAC1B,kCACJ,EAEA6V,EAAIxW,UAAUkZ,KAAO,SAAelU,GAClC,OAAIzE,KAAKwY,MAAcxY,KAAKwY,MAAMM,QAAQrU,GAAG4R,UAAUrW,OAEvD4B,EAAK6C,EAAGA,EAAEiP,KAAK1T,KAAKkQ,GAAGmG,UAAUrW,OAC1ByE,EACT,EAEAwR,EAAIxW,UAAU6H,IAAM,SAAc7C,GAChC,OAAIA,EAAEU,SACGV,EAAEb,QAGJ5D,KAAKkQ,EAAEvH,IAAIlE,GAAG4R,UAAUrW,KACjC,EAEAiW,EAAIxW,UAAUiJ,IAAM,SAAcjE,EAAGlD,GACnCvB,KAAKgX,SAASvS,EAAGlD,GAEjB,IAAIuE,EAAMrB,EAAEiE,IAAInH,GAIhB,OAHIuE,EAAIzD,IAAIrC,KAAKkQ,IAAM,GACrBpK,EAAI2C,KAAKzI,KAAKkQ,GAETpK,EAAIuQ,UAAUrW,KACvB,EAEAiW,EAAIxW,UAAU+I,KAAO,SAAe/D,EAAGlD,GACrCvB,KAAKgX,SAASvS,EAAGlD,GAEjB,IAAIuE,EAAMrB,EAAE+D,KAAKjH,GAIjB,OAHIuE,EAAIzD,IAAIrC,KAAKkQ,IAAM,GACrBpK,EAAI2C,KAAKzI,KAAKkQ,GAETpK,CACT,EAEAmQ,EAAIxW,UAAUkJ,IAAM,SAAclE,EAAGlD,GACnCvB,KAAKgX,SAASvS,EAAGlD,GAEjB,IAAIuE,EAAMrB,EAAEkE,IAAIpH,GAIhB,OAHIuE,EAAIqP,KAAK,GAAK,GAChBrP,EAAI0C,KAAKxI,KAAKkQ,GAETpK,EAAIuQ,UAAUrW,KACvB,EAEAiW,EAAIxW,UAAUgJ,KAAO,SAAehE,EAAGlD,GACrCvB,KAAKgX,SAASvS,EAAGlD,GAEjB,IAAIuE,EAAMrB,EAAEgE,KAAKlH,GAIjB,OAHIuE,EAAIqP,KAAK,GAAK,GAChBrP,EAAI0C,KAAKxI,KAAKkQ,GAETpK,CACT,EAEAmQ,EAAIxW,UAAUqX,IAAM,SAAcrS,EAAG1C,GAEnC,OADA/B,KAAKmX,SAAS1S,GACPzE,KAAK2Y,KAAKlU,EAAE8N,MAAMxQ,GAC3B,EAEAkU,EAAIxW,UAAUmN,KAAO,SAAenI,EAAGlD,GAErC,OADAvB,KAAKgX,SAASvS,EAAGlD,GACVvB,KAAK2Y,KAAKlU,EAAEmI,KAAKrL,GAC1B,EAEA0U,EAAIxW,UAAU6B,IAAM,SAAcmD,EAAGlD,GAEnC,OADAvB,KAAKgX,SAASvS,EAAGlD,GACVvB,KAAK2Y,KAAKlU,EAAEnD,IAAIC,GACzB,EAEA0U,EAAIxW,UAAU8R,KAAO,SAAe9M,GAClC,OAAOzE,KAAK4M,KAAKnI,EAAGA,EAAEb,QACxB,EAEAqS,EAAIxW,UAAU6R,IAAM,SAAc7M,GAChC,OAAOzE,KAAKsB,IAAImD,EAAGA,EACrB,EAEAwR,EAAIxW,UAAU6X,KAAO,SAAe7S,GAClC,GAAIA,EAAEU,SAAU,OAAOV,EAAEb,QAEzB,IAAI6V,EAAOzZ,KAAKkQ,EAAE6D,MAAM,GAIxB,GAHA/U,EAAOya,EAAO,GAAM,GAGP,IAATA,EAAY,CACd,IAAIhW,EAAMzD,KAAKkQ,EAAExH,IAAI,IAAI/I,EAAG,IAAIoS,OAAO,GACvC,OAAO/R,KAAKyD,IAAIgB,EAAGhB,EACrB,CAOA,IAFA,IAAIgO,EAAIzR,KAAKkQ,EAAE4C,KAAK,GAChB5D,EAAI,GACAuC,EAAEtM,UAA2B,IAAfsM,EAAEsC,MAAM,IAC5B7E,IACAuC,EAAEM,OAAO,GAEX/S,GAAQyS,EAAEtM,UAEV,IAAIuU,EAAM,IAAI/Z,EAAG,GAAGuW,MAAMlW,MACtB2Z,EAAOD,EAAIlC,SAIXoC,EAAO5Z,KAAKkQ,EAAE4C,KAAK,GAAGf,OAAO,GAC7B8H,EAAI7Z,KAAKkQ,EAAEzJ,YAGf,IAFAoT,EAAI,IAAIla,EAAG,EAAIka,EAAIA,GAAG3D,MAAMlW,MAEW,IAAhCA,KAAKyD,IAAIoW,EAAGD,GAAMvX,IAAIsX,IAC3BE,EAAEnD,QAAQiD,GAOZ,IAJA,IAAI9Y,EAAIb,KAAKyD,IAAIoW,EAAGpI,GAChBxQ,EAAIjB,KAAKyD,IAAIgB,EAAGgN,EAAEoB,KAAK,GAAGd,OAAO,IACjCxL,EAAIvG,KAAKyD,IAAIgB,EAAGgN,GAChBvB,EAAIhB,EACc,IAAf3I,EAAElE,IAAIqX,IAAY,CAEvB,IADA,IAAIzB,EAAM1R,EACD5E,EAAI,EAAoB,IAAjBsW,EAAI5V,IAAIqX,GAAY/X,IAClCsW,EAAMA,EAAIf,SAEZlY,EAAO2C,EAAIuO,GACX,IAAI3O,EAAIvB,KAAKyD,IAAI5C,EAAG,IAAIlB,EAAG,GAAG+R,OAAOxB,EAAIvO,EAAI,IAE7CV,EAAIA,EAAE8V,OAAOxV,GACbV,EAAIU,EAAE2V,SACN3Q,EAAIA,EAAEwQ,OAAOlW,GACbqP,EAAIvO,CACN,CAEA,OAAOV,CACT,EAEAgV,EAAIxW,UAAU2V,KAAO,SAAe3Q,GAClC,IAAIqV,EAAMrV,EAAEsQ,OAAO/U,KAAKkQ,GACxB,OAAqB,IAAjB4J,EAAI7Z,UACN6Z,EAAI7Z,SAAW,EACRD,KAAK2Y,KAAKmB,GAAKtC,UAEfxX,KAAK2Y,KAAKmB,EAErB,EAEA7D,EAAIxW,UAAUgE,IAAM,SAAcgB,EAAG1C,GACnC,GAAIA,EAAIoD,SAAU,OAAO,IAAIxF,EAAG,GAAGuW,MAAMlW,MACzC,GAAoB,IAAhB+B,EAAIoT,KAAK,GAAU,OAAO1Q,EAAEb,QAEhC,IACImW,EAAM,IAAI/X,MAAM,IACpB+X,EAAI,GAAK,IAAIpa,EAAG,GAAGuW,MAAMlW,MACzB+Z,EAAI,GAAKtV,EACT,IAAK,IAAI9C,EAAI,EAAGA,EAAIoY,EAAI5Z,OAAQwB,IAC9BoY,EAAIpY,GAAK3B,KAAKsB,IAAIyY,EAAIpY,EAAI,GAAI8C,GAGhC,IAAIqB,EAAMiU,EAAI,GACVC,EAAU,EACVC,EAAa,EACb7Y,EAAQW,EAAI0E,YAAc,GAK9B,IAJc,IAAVrF,IACFA,EAAQ,IAGLO,EAAII,EAAI5B,OAAS,EAAGwB,GAAK,EAAGA,IAAK,CAEpC,IADA,IAAI2B,EAAOvB,EAAI7B,MAAMyB,GACZmB,EAAI1B,EAAQ,EAAG0B,GAAK,EAAGA,IAAK,CACnC,IAAIwF,EAAOhF,GAAQR,EAAK,EACpBgD,IAAQiU,EAAI,KACdjU,EAAM9F,KAAKsR,IAAIxL,IAGL,IAARwC,GAAyB,IAAZ0R,GAKjBA,IAAY,EACZA,GAAW1R,GA9BE,KA+Bb2R,GACwC,IAANtY,GAAiB,IAANmB,KAE7CgD,EAAM9F,KAAKsB,IAAIwE,EAAKiU,EAAIC,IACxBC,EAAa,EACbD,EAAU,IAXRC,EAAa,CAYjB,CACA7Y,EAAQ,EACV,CAEA,OAAO0E,CACT,EAEAmQ,EAAIxW,UAAU2W,UAAY,SAAoBrU,GAC5C,IAAId,EAAIc,EAAI2R,KAAK1T,KAAKkQ,GAEtB,OAAOjP,IAAMc,EAAMd,EAAE2C,QAAU3C,CACjC,EAEAgV,EAAIxW,UAAU8W,YAAc,SAAsBxU,GAChD,IAAI+D,EAAM/D,EAAI6B,QAEd,OADAkC,EAAI1F,IAAM,KACH0F,CACT,EAMAnG,EAAGua,KAAO,SAAenY,GACvB,OAAO,IAAI2W,EAAK3W,EAClB,EAkBA3C,EAASsZ,EAAMzC,GAEfyC,EAAKjZ,UAAU2W,UAAY,SAAoBrU,GAC7C,OAAO/B,KAAK2Y,KAAK5W,EAAIwQ,MAAMvS,KAAKmG,OAClC,EAEAuS,EAAKjZ,UAAU8W,YAAc,SAAsBxU,GACjD,IAAId,EAAIjB,KAAK2Y,KAAK5W,EAAIT,IAAItB,KAAK4Y,OAE/B,OADA3X,EAAEb,IAAM,KACDa,CACT,EAEAyX,EAAKjZ,UAAUmN,KAAO,SAAenI,EAAGlD,GACtC,GAAIkD,EAAEU,UAAY5D,EAAE4D,SAGlB,OAFAV,EAAEvE,MAAM,GAAK,EACbuE,EAAEtE,OAAS,EACJsE,EAGT,IAAI8B,EAAI9B,EAAEmI,KAAKrL,GACXV,EAAI0F,EAAEoM,MAAM3S,KAAKmG,OAAO7E,IAAItB,KAAK6Y,MAAMnG,OAAO1S,KAAKmG,OAAO7E,IAAItB,KAAKkQ,GACnEiK,EAAI5T,EAAEkC,KAAK5H,GAAGkR,OAAO/R,KAAKmG,OAC1BL,EAAMqU,EAQV,OANIA,EAAE9X,IAAIrC,KAAKkQ,IAAM,EACnBpK,EAAMqU,EAAE1R,KAAKzI,KAAKkQ,GACTiK,EAAEhF,KAAK,GAAK,IACrBrP,EAAMqU,EAAE3R,KAAKxI,KAAKkQ,IAGbpK,EAAIuQ,UAAUrW,KACvB,EAEA0Y,EAAKjZ,UAAU6B,IAAM,SAAcmD,EAAGlD,GACpC,GAAIkD,EAAEU,UAAY5D,EAAE4D,SAAU,OAAO,IAAIxF,EAAG,GAAG0W,UAAUrW,MAEzD,IAAIuG,EAAI9B,EAAEnD,IAAIC,GACVV,EAAI0F,EAAEoM,MAAM3S,KAAKmG,OAAO7E,IAAItB,KAAK6Y,MAAMnG,OAAO1S,KAAKmG,OAAO7E,IAAItB,KAAKkQ,GACnEiK,EAAI5T,EAAEkC,KAAK5H,GAAGkR,OAAO/R,KAAKmG,OAC1BL,EAAMqU,EAOV,OANIA,EAAE9X,IAAIrC,KAAKkQ,IAAM,EACnBpK,EAAMqU,EAAE1R,KAAKzI,KAAKkQ,GACTiK,EAAEhF,KAAK,GAAK,IACrBrP,EAAMqU,EAAE3R,KAAKxI,KAAKkQ,IAGbpK,EAAIuQ,UAAUrW,KACvB,EAEA0Y,EAAKjZ,UAAU2V,KAAO,SAAe3Q,GAGnC,OADUzE,KAAK2Y,KAAKlU,EAAEsQ,OAAO/U,KAAKkQ,GAAG5O,IAAItB,KAAK8T,KACnCuC,UAAUrW,KACvB,CACD,CA19GD,C,WA09G4CA,K,8CCh8G5C,SAASoa,EAAWC,GAClB,GAAoB,iBAATA,EACT,MAAM,IAAIC,UAAU,mCAAqCC,KAAKC,UAAUH,GAE5E,CAGA,SAASI,EAAqBJ,EAAMK,GAMlC,IALA,IAIIC,EAJA7U,EAAM,GACN8U,EAAoB,EACpBC,GAAa,EACbC,EAAO,EAEFnZ,EAAI,EAAGA,GAAK0Y,EAAKla,SAAUwB,EAAG,CACrC,GAAIA,EAAI0Y,EAAKla,OACXwa,EAAON,EAAKvZ,WAAWa,OACpB,IAAa,KAATgZ,EACP,MAEAA,EAAO,EAAQ,CACjB,GAAa,KAATA,EAAmB,CACrB,GAAIE,IAAclZ,EAAI,GAAc,IAATmZ,QAEpB,GAAID,IAAclZ,EAAI,GAAc,IAATmZ,EAAY,CAC5C,GAAIhV,EAAI3F,OAAS,GAA2B,IAAtBya,GAA8D,KAAnC9U,EAAIhF,WAAWgF,EAAI3F,OAAS,IAAsD,KAAnC2F,EAAIhF,WAAWgF,EAAI3F,OAAS,GAC1H,GAAI2F,EAAI3F,OAAS,EAAG,CAClB,IAAI4a,EAAiBjV,EAAIkV,YAAY,KACrC,GAAID,IAAmBjV,EAAI3F,OAAS,EAAG,EACb,IAApB4a,GACFjV,EAAM,GACN8U,EAAoB,GAGpBA,GADA9U,EAAMA,EAAImV,MAAM,EAAGF,IACK5a,OAAS,EAAI2F,EAAIkV,YAAY,KAEvDH,EAAYlZ,EACZmZ,EAAO,EACP,QACF,CACF,MAAO,GAAmB,IAAfhV,EAAI3F,QAA+B,IAAf2F,EAAI3F,OAAc,CAC/C2F,EAAM,GACN8U,EAAoB,EACpBC,EAAYlZ,EACZmZ,EAAO,EACP,QACF,CAEEJ,IACE5U,EAAI3F,OAAS,EACf2F,GAAO,MAEPA,EAAM,KACR8U,EAAoB,EAExB,MACM9U,EAAI3F,OAAS,EACf2F,GAAO,IAAMuU,EAAKY,MAAMJ,EAAY,EAAGlZ,GAEvCmE,EAAMuU,EAAKY,MAAMJ,EAAY,EAAGlZ,GAClCiZ,EAAoBjZ,EAAIkZ,EAAY,EAEtCA,EAAYlZ,EACZmZ,EAAO,CACT,MAAoB,KAATH,IAA+B,IAAVG,IAC5BA,EAEFA,GAAQ,CAEZ,CACA,OAAOhV,CACT,CAcA,IAAIoV,EAAQ,CAEVC,QAAS,WAKP,IAJA,IAEIC,EAFAC,EAAe,GACfC,GAAmB,EAGd3Z,EAAI4Z,UAAUpb,OAAS,EAAGwB,IAAM,IAAM2Z,EAAkB3Z,IAAK,CACpE,IAAI0Y,EACA1Y,GAAK,EACP0Y,EAAOkB,UAAU5Z,SAELuX,IAARkC,IACFA,EAAMI,EAAQJ,OAChBf,EAAOe,GAGThB,EAAWC,GAGS,IAAhBA,EAAKla,SAITkb,EAAehB,EAAO,IAAMgB,EAC5BC,EAA0C,KAAvBjB,EAAKvZ,WAAW,GACrC,CAQA,OAFAua,EAAeZ,EAAqBY,GAAeC,GAE/CA,EACED,EAAalb,OAAS,EACjB,IAAMkb,EAEN,IACAA,EAAalb,OAAS,EACxBkb,EAEA,GAEX,EAEAI,UAAW,SAAmBpB,GAG5B,GAFAD,EAAWC,GAES,IAAhBA,EAAKla,OAAc,MAAO,IAE9B,IAAIub,EAAoC,KAAvBrB,EAAKvZ,WAAW,GAC7B6a,EAAyD,KAArCtB,EAAKvZ,WAAWuZ,EAAKla,OAAS,GAQtD,OAHoB,KAFpBka,EAAOI,EAAqBJ,GAAOqB,IAE1Bvb,QAAiBub,IAAYrB,EAAO,KACzCA,EAAKla,OAAS,GAAKwb,IAAmBtB,GAAQ,KAE9CqB,EAAmB,IAAMrB,EACtBA,CACT,EAEAqB,WAAY,SAAoBrB,GAE9B,OADAD,EAAWC,GACJA,EAAKla,OAAS,GAA4B,KAAvBka,EAAKvZ,WAAW,EAC5C,EAEA8a,KAAM,WACJ,GAAyB,IAArBL,UAAUpb,OACZ,MAAO,IAET,IADA,IAAI0b,EACKla,EAAI,EAAGA,EAAI4Z,UAAUpb,SAAUwB,EAAG,CACzC,IAAIma,EAAMP,UAAU5Z,GACpByY,EAAW0B,GACPA,EAAI3b,OAAS,SACA+Y,IAAX2C,EACFA,EAASC,EAETD,GAAU,IAAMC,EAEtB,CACA,YAAe5C,IAAX2C,EACK,IACFX,EAAMO,UAAUI,EACzB,EAEAE,SAAU,SAAkBC,EAAMC,GAIhC,GAHA7B,EAAW4B,GACX5B,EAAW6B,GAEPD,IAASC,EAAI,MAAO,GAKxB,IAHAD,EAAOd,EAAMC,QAAQa,OACrBC,EAAKf,EAAMC,QAAQc,IAEF,MAAO,GAIxB,IADA,IAAIC,EAAY,EACTA,EAAYF,EAAK7b,QACa,KAA/B6b,EAAKlb,WAAWob,KADYA,GASlC,IALA,IAAIC,EAAUH,EAAK7b,OACfic,EAAUD,EAAUD,EAGpBG,EAAU,EACPA,EAAUJ,EAAG9b,QACa,KAA3B8b,EAAGnb,WAAWub,KADUA,GAW9B,IAPA,IACIC,EADQL,EAAG9b,OACKkc,EAGhBlc,EAASic,EAAUE,EAAQF,EAAUE,EACrCC,GAAiB,EACjB5a,EAAI,EACDA,GAAKxB,IAAUwB,EAAG,CACvB,GAAIA,IAAMxB,EAAQ,CAChB,GAAImc,EAAQnc,EAAQ,CAClB,GAAmC,KAA/B8b,EAAGnb,WAAWub,EAAU1a,GAG1B,OAAOsa,EAAGhB,MAAMoB,EAAU1a,EAAI,GACzB,GAAU,IAANA,EAGT,OAAOsa,EAAGhB,MAAMoB,EAAU1a,EAE9B,MAAWya,EAAUjc,IACoB,KAAnC6b,EAAKlb,WAAWob,EAAYva,GAG9B4a,EAAgB5a,EACD,IAANA,IAGT4a,EAAgB,IAGpB,KACF,CACA,IAAIC,EAAWR,EAAKlb,WAAWob,EAAYva,GAE3C,GAAI6a,IADSP,EAAGnb,WAAWub,EAAU1a,GAEnC,MACoB,KAAb6a,IACPD,EAAgB5a,EACpB,CAEA,IAAI6C,EAAM,GAGV,IAAK7C,EAAIua,EAAYK,EAAgB,EAAG5a,GAAKwa,IAAWxa,EAClDA,IAAMwa,GAAkC,KAAvBH,EAAKlb,WAAWa,KAChB,IAAf6C,EAAIrE,OACNqE,GAAO,KAEPA,GAAO,OAMb,OAAIA,EAAIrE,OAAS,EACRqE,EAAMyX,EAAGhB,MAAMoB,EAAUE,IAEhCF,GAAWE,EACoB,KAA3BN,EAAGnb,WAAWub,MACdA,EACGJ,EAAGhB,MAAMoB,GAEpB,EAEAI,UAAW,SAAmBpC,GAC5B,OAAOA,CACT,EAEAqC,QAAS,SAAiBrC,GAExB,GADAD,EAAWC,GACS,IAAhBA,EAAKla,OAAc,MAAO,IAK9B,IAJA,IAAIwa,EAAON,EAAKvZ,WAAW,GACvB6b,EAAmB,KAAThC,EACVtZ,GAAO,EACPub,GAAe,EACVjb,EAAI0Y,EAAKla,OAAS,EAAGwB,GAAK,IAAKA,EAEtC,GAAa,MADbgZ,EAAON,EAAKvZ,WAAWa,KAEnB,IAAKib,EAAc,CACjBvb,EAAMM,EACN,KACF,OAGFib,GAAe,EAInB,OAAa,IAATvb,EAAmBsb,EAAU,IAAM,IACnCA,GAAmB,IAARtb,EAAkB,KAC1BgZ,EAAKY,MAAM,EAAG5Z,EACvB,EAEAwb,SAAU,SAAkBxC,EAAMyC,GAChC,QAAY5D,IAAR4D,GAAoC,iBAARA,EAAkB,MAAM,IAAIxC,UAAU,mCACtEF,EAAWC,GAEX,IAGI1Y,EAHAP,EAAQ,EACRC,GAAO,EACPub,GAAe,EAGnB,QAAY1D,IAAR4D,GAAqBA,EAAI3c,OAAS,GAAK2c,EAAI3c,QAAUka,EAAKla,OAAQ,CACpE,GAAI2c,EAAI3c,SAAWka,EAAKla,QAAU2c,IAAQzC,EAAM,MAAO,GACvD,IAAI0C,EAASD,EAAI3c,OAAS,EACtB6c,GAAoB,EACxB,IAAKrb,EAAI0Y,EAAKla,OAAS,EAAGwB,GAAK,IAAKA,EAAG,CACrC,IAAIgZ,EAAON,EAAKvZ,WAAWa,GAC3B,GAAa,KAATgZ,GAGA,IAAKiC,EAAc,CACjBxb,EAAQO,EAAI,EACZ,KACF,OAEwB,IAAtBqb,IAGFJ,GAAe,EACfI,EAAmBrb,EAAI,GAErBob,GAAU,IAERpC,IAASmC,EAAIhc,WAAWic,IACR,KAAZA,IAGJ1b,EAAMM,IAKRob,GAAU,EACV1b,EAAM2b,GAId,CAGA,OADI5b,IAAUC,EAAKA,EAAM2b,GAAmC,IAAT3b,IAAYA,EAAMgZ,EAAKla,QACnEka,EAAKY,MAAM7Z,EAAOC,EAC3B,CACE,IAAKM,EAAI0Y,EAAKla,OAAS,EAAGwB,GAAK,IAAKA,EAClC,GAA2B,KAAvB0Y,EAAKvZ,WAAWa,IAGhB,IAAKib,EAAc,CACjBxb,EAAQO,EAAI,EACZ,KACF,OACkB,IAATN,IAGXub,GAAe,EACfvb,EAAMM,EAAI,GAId,OAAa,IAATN,EAAmB,GAChBgZ,EAAKY,MAAM7Z,EAAOC,EAE7B,EAEA4b,QAAS,SAAiB5C,GACxBD,EAAWC,GAQX,IAPA,IAAI6C,GAAY,EACZC,EAAY,EACZ9b,GAAO,EACPub,GAAe,EAGfQ,EAAc,EACTzb,EAAI0Y,EAAKla,OAAS,EAAGwB,GAAK,IAAKA,EAAG,CACzC,IAAIgZ,EAAON,EAAKvZ,WAAWa,GAC3B,GAAa,KAATgZ,GASS,IAATtZ,IAGFub,GAAe,EACfvb,EAAMM,EAAI,GAEC,KAATgZ,GAEkB,IAAduC,EACFA,EAAWvb,EACY,IAAhByb,IACPA,EAAc,IACK,IAAdF,IAGTE,GAAe,QArBb,IAAKR,EAAc,CACjBO,EAAYxb,EAAI,EAChB,KACF,CAoBN,CAEA,OAAkB,IAAdub,IAA4B,IAAT7b,GAEH,IAAhB+b,GAEgB,IAAhBA,GAAqBF,IAAa7b,EAAM,GAAK6b,IAAaC,EAAY,EACjE,GAEF9C,EAAKY,MAAMiC,EAAU7b,EAC9B,EAEAgc,OAAQ,SAAgBC,GACtB,GAAmB,OAAfA,GAA6C,iBAAfA,EAChC,MAAM,IAAIhD,UAAU,0EAA4EgD,GAElG,OAvVJ,SAAiBC,EAAKD,GACpB,IAAIE,EAAMF,EAAWE,KAAOF,EAAWG,KACnC5d,EAAOyd,EAAWzd,OAASyd,EAAWtF,MAAQ,KAAOsF,EAAWR,KAAO,IAC3E,OAAKU,EAGDA,IAAQF,EAAWG,KACdD,EAAM3d,EAER2d,EA8UU,IA9UE3d,EALVA,CAMX,CA6UW6d,CAAQ,EAAKJ,EACtB,EAEAK,MAAO,SAAetD,GACpBD,EAAWC,GAEX,IAAI9U,EAAM,CAAEkY,KAAM,GAAID,IAAK,GAAI3d,KAAM,GAAIid,IAAK,GAAI9E,KAAM,IACxD,GAAoB,IAAhBqC,EAAKla,OAAc,OAAOoF,EAC9B,IAEInE,EAFAuZ,EAAON,EAAKvZ,WAAW,GACvB4a,EAAsB,KAATf,EAEbe,GACFnW,EAAIkY,KAAO,IACXrc,EAAQ,GAERA,EAAQ,EAaV,IAXA,IAAI8b,GAAY,EACZC,EAAY,EACZ9b,GAAO,EACPub,GAAe,EACfjb,EAAI0Y,EAAKla,OAAS,EAIlBid,EAAc,EAGXzb,GAAKP,IAASO,EAEnB,GAAa,MADbgZ,EAAON,EAAKvZ,WAAWa,KAUV,IAATN,IAGFub,GAAe,EACfvb,EAAMM,EAAI,GAEC,KAATgZ,GAEkB,IAAduC,EAAiBA,EAAWvb,EAA2B,IAAhByb,IAAmBA,EAAc,IACrD,IAAdF,IAGXE,GAAe,QAlBb,IAAKR,EAAc,CACjBO,EAAYxb,EAAI,EAChB,KACF,CAwCN,OArBkB,IAAdub,IAA4B,IAAT7b,GAEP,IAAhB+b,GAEgB,IAAhBA,GAAqBF,IAAa7b,EAAM,GAAK6b,IAAaC,EAAY,GACvD,IAAT9b,IACiCkE,EAAI1F,KAAO0F,EAAIyS,KAAhC,IAAdmF,GAAmBzB,EAAkCrB,EAAKY,MAAM,EAAG5Z,GAAgCgZ,EAAKY,MAAMkC,EAAW9b,KAG7G,IAAd8b,GAAmBzB,GACrBnW,EAAIyS,KAAOqC,EAAKY,MAAM,EAAGiC,GACzB3X,EAAI1F,KAAOwa,EAAKY,MAAM,EAAG5Z,KAEzBkE,EAAIyS,KAAOqC,EAAKY,MAAMkC,EAAWD,GACjC3X,EAAI1F,KAAOwa,EAAKY,MAAMkC,EAAW9b,IAEnCkE,EAAIuX,IAAMzC,EAAKY,MAAMiC,EAAU7b,IAG7B8b,EAAY,EAAG5X,EAAIiY,IAAMnD,EAAKY,MAAM,EAAGkC,EAAY,GAAYzB,IAAYnW,EAAIiY,IAAM,KAElFjY,CACT,EAEAgY,IAAK,IACLK,UAAW,IACXC,MAAO,KACP3C,MAAO,MAGTA,EAAMA,MAAQA,EAEdpc,EAAOC,QAAUmc,C","sources":["webpack://httptoolkit-ui/./node_modules/bn.js/lib/bn.js","webpack://httptoolkit-ui/./node_modules/path-browserify/index.js"],"sourcesContent":["(function (module, exports) {\n  'use strict';\n\n  // Utils\n  function assert (val, msg) {\n    if (!val) throw new Error(msg || 'Assertion failed');\n  }\n\n  // Could use `inherits` module, but don't want to move from single file\n  // architecture yet.\n  function inherits (ctor, superCtor) {\n    ctor.super_ = superCtor;\n    var TempCtor = function () {};\n    TempCtor.prototype = superCtor.prototype;\n    ctor.prototype = new TempCtor();\n    ctor.prototype.constructor = ctor;\n  }\n\n  // BN\n\n  function BN (number, base, endian) {\n    if (BN.isBN(number)) {\n      return number;\n    }\n\n    this.negative = 0;\n    this.words = null;\n    this.length = 0;\n\n    // Reduction context\n    this.red = null;\n\n    if (number !== null) {\n      if (base === 'le' || base === 'be') {\n        endian = base;\n        base = 10;\n      }\n\n      this._init(number || 0, base || 10, endian || 'be');\n    }\n  }\n  if (typeof module === 'object') {\n    module.exports = BN;\n  } else {\n    exports.BN = BN;\n  }\n\n  BN.BN = BN;\n  BN.wordSize = 26;\n\n  var Buffer;\n  try {\n    if (typeof window !== 'undefined' && typeof window.Buffer !== 'undefined') {\n      Buffer = window.Buffer;\n    } else {\n      Buffer = require('buffer').Buffer;\n    }\n  } catch (e) {\n  }\n\n  BN.isBN = function isBN (num) {\n    if (num instanceof BN) {\n      return true;\n    }\n\n    return num !== null && typeof num === 'object' &&\n      num.constructor.wordSize === BN.wordSize && Array.isArray(num.words);\n  };\n\n  BN.max = function max (left, right) {\n    if (left.cmp(right) > 0) return left;\n    return right;\n  };\n\n  BN.min = function min (left, right) {\n    if (left.cmp(right) < 0) return left;\n    return right;\n  };\n\n  BN.prototype._init = function init (number, base, endian) {\n    if (typeof number === 'number') {\n      return this._initNumber(number, base, endian);\n    }\n\n    if (typeof number === 'object') {\n      return this._initArray(number, base, endian);\n    }\n\n    if (base === 'hex') {\n      base = 16;\n    }\n    assert(base === (base | 0) && base >= 2 && base <= 36);\n\n    number = number.toString().replace(/\\s+/g, '');\n    var start = 0;\n    if (number[0] === '-') {\n      start++;\n      this.negative = 1;\n    }\n\n    if (start < number.length) {\n      if (base === 16) {\n        this._parseHex(number, start, endian);\n      } else {\n        this._parseBase(number, base, start);\n        if (endian === 'le') {\n          this._initArray(this.toArray(), base, endian);\n        }\n      }\n    }\n  };\n\n  BN.prototype._initNumber = function _initNumber (number, base, endian) {\n    if (number < 0) {\n      this.negative = 1;\n      number = -number;\n    }\n    if (number < 0x4000000) {\n      this.words = [number & 0x3ffffff];\n      this.length = 1;\n    } else if (number < 0x10000000000000) {\n      this.words = [\n        number & 0x3ffffff,\n        (number / 0x4000000) & 0x3ffffff\n      ];\n      this.length = 2;\n    } else {\n      assert(number < 0x20000000000000); // 2 ^ 53 (unsafe)\n      this.words = [\n        number & 0x3ffffff,\n        (number / 0x4000000) & 0x3ffffff,\n        1\n      ];\n      this.length = 3;\n    }\n\n    if (endian !== 'le') return;\n\n    // Reverse the bytes\n    this._initArray(this.toArray(), base, endian);\n  };\n\n  BN.prototype._initArray = function _initArray (number, base, endian) {\n    // Perhaps a Uint8Array\n    assert(typeof number.length === 'number');\n    if (number.length <= 0) {\n      this.words = [0];\n      this.length = 1;\n      return this;\n    }\n\n    this.length = Math.ceil(number.length / 3);\n    this.words = new Array(this.length);\n    for (var i = 0; i < this.length; i++) {\n      this.words[i] = 0;\n    }\n\n    var j, w;\n    var off = 0;\n    if (endian === 'be') {\n      for (i = number.length - 1, j = 0; i >= 0; i -= 3) {\n        w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16);\n        this.words[j] |= (w << off) & 0x3ffffff;\n        this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff;\n        off += 24;\n        if (off >= 26) {\n          off -= 26;\n          j++;\n        }\n      }\n    } else if (endian === 'le') {\n      for (i = 0, j = 0; i < number.length; i += 3) {\n        w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16);\n        this.words[j] |= (w << off) & 0x3ffffff;\n        this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff;\n        off += 24;\n        if (off >= 26) {\n          off -= 26;\n          j++;\n        }\n      }\n    }\n    return this._strip();\n  };\n\n  function parseHex4Bits (string, index) {\n    var c = string.charCodeAt(index);\n    // '0' - '9'\n    if (c >= 48 && c <= 57) {\n      return c - 48;\n    // 'A' - 'F'\n    } else if (c >= 65 && c <= 70) {\n      return c - 55;\n    // 'a' - 'f'\n    } else if (c >= 97 && c <= 102) {\n      return c - 87;\n    } else {\n      assert(false, 'Invalid character in ' + string);\n    }\n  }\n\n  function parseHexByte (string, lowerBound, index) {\n    var r = parseHex4Bits(string, index);\n    if (index - 1 >= lowerBound) {\n      r |= parseHex4Bits(string, index - 1) << 4;\n    }\n    return r;\n  }\n\n  BN.prototype._parseHex = function _parseHex (number, start, endian) {\n    // Create possibly bigger array to ensure that it fits the number\n    this.length = Math.ceil((number.length - start) / 6);\n    this.words = new Array(this.length);\n    for (var i = 0; i < this.length; i++) {\n      this.words[i] = 0;\n    }\n\n    // 24-bits chunks\n    var off = 0;\n    var j = 0;\n\n    var w;\n    if (endian === 'be') {\n      for (i = number.length - 1; i >= start; i -= 2) {\n        w = parseHexByte(number, start, i) << off;\n        this.words[j] |= w & 0x3ffffff;\n        if (off >= 18) {\n          off -= 18;\n          j += 1;\n          this.words[j] |= w >>> 26;\n        } else {\n          off += 8;\n        }\n      }\n    } else {\n      var parseLength = number.length - start;\n      for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2) {\n        w = parseHexByte(number, start, i) << off;\n        this.words[j] |= w & 0x3ffffff;\n        if (off >= 18) {\n          off -= 18;\n          j += 1;\n          this.words[j] |= w >>> 26;\n        } else {\n          off += 8;\n        }\n      }\n    }\n\n    this._strip();\n  };\n\n  function parseBase (str, start, end, mul) {\n    var r = 0;\n    var b = 0;\n    var len = Math.min(str.length, end);\n    for (var i = start; i < len; i++) {\n      var c = str.charCodeAt(i) - 48;\n\n      r *= mul;\n\n      // 'a'\n      if (c >= 49) {\n        b = c - 49 + 0xa;\n\n      // 'A'\n      } else if (c >= 17) {\n        b = c - 17 + 0xa;\n\n      // '0' - '9'\n      } else {\n        b = c;\n      }\n      assert(c >= 0 && b < mul, 'Invalid character');\n      r += b;\n    }\n    return r;\n  }\n\n  BN.prototype._parseBase = function _parseBase (number, base, start) {\n    // Initialize as zero\n    this.words = [0];\n    this.length = 1;\n\n    // Find length of limb in base\n    for (var limbLen = 0, limbPow = 1; limbPow <= 0x3ffffff; limbPow *= base) {\n      limbLen++;\n    }\n    limbLen--;\n    limbPow = (limbPow / base) | 0;\n\n    var total = number.length - start;\n    var mod = total % limbLen;\n    var end = Math.min(total, total - mod) + start;\n\n    var word = 0;\n    for (var i = start; i < end; i += limbLen) {\n      word = parseBase(number, i, i + limbLen, base);\n\n      this.imuln(limbPow);\n      if (this.words[0] + word < 0x4000000) {\n        this.words[0] += word;\n      } else {\n        this._iaddn(word);\n      }\n    }\n\n    if (mod !== 0) {\n      var pow = 1;\n      word = parseBase(number, i, number.length, base);\n\n      for (i = 0; i < mod; i++) {\n        pow *= base;\n      }\n\n      this.imuln(pow);\n      if (this.words[0] + word < 0x4000000) {\n        this.words[0] += word;\n      } else {\n        this._iaddn(word);\n      }\n    }\n\n    this._strip();\n  };\n\n  BN.prototype.copy = function copy (dest) {\n    dest.words = new Array(this.length);\n    for (var i = 0; i < this.length; i++) {\n      dest.words[i] = this.words[i];\n    }\n    dest.length = this.length;\n    dest.negative = this.negative;\n    dest.red = this.red;\n  };\n\n  function move (dest, src) {\n    dest.words = src.words;\n    dest.length = src.length;\n    dest.negative = src.negative;\n    dest.red = src.red;\n  }\n\n  BN.prototype._move = function _move (dest) {\n    move(dest, this);\n  };\n\n  BN.prototype.clone = function clone () {\n    var r = new BN(null);\n    this.copy(r);\n    return r;\n  };\n\n  BN.prototype._expand = function _expand (size) {\n    while (this.length < size) {\n      this.words[this.length++] = 0;\n    }\n    return this;\n  };\n\n  // Remove leading `0` from `this`\n  BN.prototype._strip = function strip () {\n    while (this.length > 1 && this.words[this.length - 1] === 0) {\n      this.length--;\n    }\n    return this._normSign();\n  };\n\n  BN.prototype._normSign = function _normSign () {\n    // -0 = 0\n    if (this.length === 1 && this.words[0] === 0) {\n      this.negative = 0;\n    }\n    return this;\n  };\n\n  // Check Symbol.for because not everywhere where Symbol defined\n  // See https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Symbol#Browser_compatibility\n  if (typeof Symbol !== 'undefined' && typeof Symbol.for === 'function') {\n    try {\n      BN.prototype[Symbol.for('nodejs.util.inspect.custom')] = inspect;\n    } catch (e) {\n      BN.prototype.inspect = inspect;\n    }\n  } else {\n    BN.prototype.inspect = inspect;\n  }\n\n  function inspect () {\n    return (this.red ? '<BN-R: ' : '<BN: ') + this.toString(16) + '>';\n  }\n\n  /*\n\n  var zeros = [];\n  var groupSizes = [];\n  var groupBases = [];\n\n  var s = '';\n  var i = -1;\n  while (++i < BN.wordSize) {\n    zeros[i] = s;\n    s += '0';\n  }\n  groupSizes[0] = 0;\n  groupSizes[1] = 0;\n  groupBases[0] = 0;\n  groupBases[1] = 0;\n  var base = 2 - 1;\n  while (++base < 36 + 1) {\n    var groupSize = 0;\n    var groupBase = 1;\n    while (groupBase < (1 << BN.wordSize) / base) {\n      groupBase *= base;\n      groupSize += 1;\n    }\n    groupSizes[base] = groupSize;\n    groupBases[base] = groupBase;\n  }\n\n  */\n\n  var zeros = [\n    '',\n    '0',\n    '00',\n    '000',\n    '0000',\n    '00000',\n    '000000',\n    '0000000',\n    '00000000',\n    '000000000',\n    '0000000000',\n    '00000000000',\n    '000000000000',\n    '0000000000000',\n    '00000000000000',\n    '000000000000000',\n    '0000000000000000',\n    '00000000000000000',\n    '000000000000000000',\n    '0000000000000000000',\n    '00000000000000000000',\n    '000000000000000000000',\n    '0000000000000000000000',\n    '00000000000000000000000',\n    '000000000000000000000000',\n    '0000000000000000000000000'\n  ];\n\n  var groupSizes = [\n    0, 0,\n    25, 16, 12, 11, 10, 9, 8,\n    8, 7, 7, 7, 7, 6, 6,\n    6, 6, 6, 6, 6, 5, 5,\n    5, 5, 5, 5, 5, 5, 5,\n    5, 5, 5, 5, 5, 5, 5\n  ];\n\n  var groupBases = [\n    0, 0,\n    33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216,\n    43046721, 10000000, 19487171, 35831808, 62748517, 7529536, 11390625,\n    16777216, 24137569, 34012224, 47045881, 64000000, 4084101, 5153632,\n    6436343, 7962624, 9765625, 11881376, 14348907, 17210368, 20511149,\n    24300000, 28629151, 33554432, 39135393, 45435424, 52521875, 60466176\n  ];\n\n  BN.prototype.toString = function toString (base, padding) {\n    base = base || 10;\n    padding = padding | 0 || 1;\n\n    var out;\n    if (base === 16 || base === 'hex') {\n      out = '';\n      var off = 0;\n      var carry = 0;\n      for (var i = 0; i < this.length; i++) {\n        var w = this.words[i];\n        var word = (((w << off) | carry) & 0xffffff).toString(16);\n        carry = (w >>> (24 - off)) & 0xffffff;\n        off += 2;\n        if (off >= 26) {\n          off -= 26;\n          i--;\n        }\n        if (carry !== 0 || i !== this.length - 1) {\n          out = zeros[6 - word.length] + word + out;\n        } else {\n          out = word + out;\n        }\n      }\n      if (carry !== 0) {\n        out = carry.toString(16) + out;\n      }\n      while (out.length % padding !== 0) {\n        out = '0' + out;\n      }\n      if (this.negative !== 0) {\n        out = '-' + out;\n      }\n      return out;\n    }\n\n    if (base === (base | 0) && base >= 2 && base <= 36) {\n      // var groupSize = Math.floor(BN.wordSize * Math.LN2 / Math.log(base));\n      var groupSize = groupSizes[base];\n      // var groupBase = Math.pow(base, groupSize);\n      var groupBase = groupBases[base];\n      out = '';\n      var c = this.clone();\n      c.negative = 0;\n      while (!c.isZero()) {\n        var r = c.modrn(groupBase).toString(base);\n        c = c.idivn(groupBase);\n\n        if (!c.isZero()) {\n          out = zeros[groupSize - r.length] + r + out;\n        } else {\n          out = r + out;\n        }\n      }\n      if (this.isZero()) {\n        out = '0' + out;\n      }\n      while (out.length % padding !== 0) {\n        out = '0' + out;\n      }\n      if (this.negative !== 0) {\n        out = '-' + out;\n      }\n      return out;\n    }\n\n    assert(false, 'Base should be between 2 and 36');\n  };\n\n  BN.prototype.toNumber = function toNumber () {\n    var ret = this.words[0];\n    if (this.length === 2) {\n      ret += this.words[1] * 0x4000000;\n    } else if (this.length === 3 && this.words[2] === 0x01) {\n      // NOTE: at this stage it is known that the top bit is set\n      ret += 0x10000000000000 + (this.words[1] * 0x4000000);\n    } else if (this.length > 2) {\n      assert(false, 'Number can only safely store up to 53 bits');\n    }\n    return (this.negative !== 0) ? -ret : ret;\n  };\n\n  BN.prototype.toJSON = function toJSON () {\n    return this.toString(16, 2);\n  };\n\n  if (Buffer) {\n    BN.prototype.toBuffer = function toBuffer (endian, length) {\n      return this.toArrayLike(Buffer, endian, length);\n    };\n  }\n\n  BN.prototype.toArray = function toArray (endian, length) {\n    return this.toArrayLike(Array, endian, length);\n  };\n\n  var allocate = function allocate (ArrayType, size) {\n    if (ArrayType.allocUnsafe) {\n      return ArrayType.allocUnsafe(size);\n    }\n    return new ArrayType(size);\n  };\n\n  BN.prototype.toArrayLike = function toArrayLike (ArrayType, endian, length) {\n    this._strip();\n\n    var byteLength = this.byteLength();\n    var reqLength = length || Math.max(1, byteLength);\n    assert(byteLength <= reqLength, 'byte array longer than desired length');\n    assert(reqLength > 0, 'Requested array length <= 0');\n\n    var res = allocate(ArrayType, reqLength);\n    var postfix = endian === 'le' ? 'LE' : 'BE';\n    this['_toArrayLike' + postfix](res, byteLength);\n    return res;\n  };\n\n  BN.prototype._toArrayLikeLE = function _toArrayLikeLE (res, byteLength) {\n    var position = 0;\n    var carry = 0;\n\n    for (var i = 0, shift = 0; i < this.length; i++) {\n      var word = (this.words[i] << shift) | carry;\n\n      res[position++] = word & 0xff;\n      if (position < res.length) {\n        res[position++] = (word >> 8) & 0xff;\n      }\n      if (position < res.length) {\n        res[position++] = (word >> 16) & 0xff;\n      }\n\n      if (shift === 6) {\n        if (position < res.length) {\n          res[position++] = (word >> 24) & 0xff;\n        }\n        carry = 0;\n        shift = 0;\n      } else {\n        carry = word >>> 24;\n        shift += 2;\n      }\n    }\n\n    if (position < res.length) {\n      res[position++] = carry;\n\n      while (position < res.length) {\n        res[position++] = 0;\n      }\n    }\n  };\n\n  BN.prototype._toArrayLikeBE = function _toArrayLikeBE (res, byteLength) {\n    var position = res.length - 1;\n    var carry = 0;\n\n    for (var i = 0, shift = 0; i < this.length; i++) {\n      var word = (this.words[i] << shift) | carry;\n\n      res[position--] = word & 0xff;\n      if (position >= 0) {\n        res[position--] = (word >> 8) & 0xff;\n      }\n      if (position >= 0) {\n        res[position--] = (word >> 16) & 0xff;\n      }\n\n      if (shift === 6) {\n        if (position >= 0) {\n          res[position--] = (word >> 24) & 0xff;\n        }\n        carry = 0;\n        shift = 0;\n      } else {\n        carry = word >>> 24;\n        shift += 2;\n      }\n    }\n\n    if (position >= 0) {\n      res[position--] = carry;\n\n      while (position >= 0) {\n        res[position--] = 0;\n      }\n    }\n  };\n\n  if (Math.clz32) {\n    BN.prototype._countBits = function _countBits (w) {\n      return 32 - Math.clz32(w);\n    };\n  } else {\n    BN.prototype._countBits = function _countBits (w) {\n      var t = w;\n      var r = 0;\n      if (t >= 0x1000) {\n        r += 13;\n        t >>>= 13;\n      }\n      if (t >= 0x40) {\n        r += 7;\n        t >>>= 7;\n      }\n      if (t >= 0x8) {\n        r += 4;\n        t >>>= 4;\n      }\n      if (t >= 0x02) {\n        r += 2;\n        t >>>= 2;\n      }\n      return r + t;\n    };\n  }\n\n  BN.prototype._zeroBits = function _zeroBits (w) {\n    // Short-cut\n    if (w === 0) return 26;\n\n    var t = w;\n    var r = 0;\n    if ((t & 0x1fff) === 0) {\n      r += 13;\n      t >>>= 13;\n    }\n    if ((t & 0x7f) === 0) {\n      r += 7;\n      t >>>= 7;\n    }\n    if ((t & 0xf) === 0) {\n      r += 4;\n      t >>>= 4;\n    }\n    if ((t & 0x3) === 0) {\n      r += 2;\n      t >>>= 2;\n    }\n    if ((t & 0x1) === 0) {\n      r++;\n    }\n    return r;\n  };\n\n  // Return number of used bits in a BN\n  BN.prototype.bitLength = function bitLength () {\n    var w = this.words[this.length - 1];\n    var hi = this._countBits(w);\n    return (this.length - 1) * 26 + hi;\n  };\n\n  function toBitArray (num) {\n    var w = new Array(num.bitLength());\n\n    for (var bit = 0; bit < w.length; bit++) {\n      var off = (bit / 26) | 0;\n      var wbit = bit % 26;\n\n      w[bit] = (num.words[off] >>> wbit) & 0x01;\n    }\n\n    return w;\n  }\n\n  // Number of trailing zero bits\n  BN.prototype.zeroBits = function zeroBits () {\n    if (this.isZero()) return 0;\n\n    var r = 0;\n    for (var i = 0; i < this.length; i++) {\n      var b = this._zeroBits(this.words[i]);\n      r += b;\n      if (b !== 26) break;\n    }\n    return r;\n  };\n\n  BN.prototype.byteLength = function byteLength () {\n    return Math.ceil(this.bitLength() / 8);\n  };\n\n  BN.prototype.toTwos = function toTwos (width) {\n    if (this.negative !== 0) {\n      return this.abs().inotn(width).iaddn(1);\n    }\n    return this.clone();\n  };\n\n  BN.prototype.fromTwos = function fromTwos (width) {\n    if (this.testn(width - 1)) {\n      return this.notn(width).iaddn(1).ineg();\n    }\n    return this.clone();\n  };\n\n  BN.prototype.isNeg = function isNeg () {\n    return this.negative !== 0;\n  };\n\n  // Return negative clone of `this`\n  BN.prototype.neg = function neg () {\n    return this.clone().ineg();\n  };\n\n  BN.prototype.ineg = function ineg () {\n    if (!this.isZero()) {\n      this.negative ^= 1;\n    }\n\n    return this;\n  };\n\n  // Or `num` with `this` in-place\n  BN.prototype.iuor = function iuor (num) {\n    while (this.length < num.length) {\n      this.words[this.length++] = 0;\n    }\n\n    for (var i = 0; i < num.length; i++) {\n      this.words[i] = this.words[i] | num.words[i];\n    }\n\n    return this._strip();\n  };\n\n  BN.prototype.ior = function ior (num) {\n    assert((this.negative | num.negative) === 0);\n    return this.iuor(num);\n  };\n\n  // Or `num` with `this`\n  BN.prototype.or = function or (num) {\n    if (this.length > num.length) return this.clone().ior(num);\n    return num.clone().ior(this);\n  };\n\n  BN.prototype.uor = function uor (num) {\n    if (this.length > num.length) return this.clone().iuor(num);\n    return num.clone().iuor(this);\n  };\n\n  // And `num` with `this` in-place\n  BN.prototype.iuand = function iuand (num) {\n    // b = min-length(num, this)\n    var b;\n    if (this.length > num.length) {\n      b = num;\n    } else {\n      b = this;\n    }\n\n    for (var i = 0; i < b.length; i++) {\n      this.words[i] = this.words[i] & num.words[i];\n    }\n\n    this.length = b.length;\n\n    return this._strip();\n  };\n\n  BN.prototype.iand = function iand (num) {\n    assert((this.negative | num.negative) === 0);\n    return this.iuand(num);\n  };\n\n  // And `num` with `this`\n  BN.prototype.and = function and (num) {\n    if (this.length > num.length) return this.clone().iand(num);\n    return num.clone().iand(this);\n  };\n\n  BN.prototype.uand = function uand (num) {\n    if (this.length > num.length) return this.clone().iuand(num);\n    return num.clone().iuand(this);\n  };\n\n  // Xor `num` with `this` in-place\n  BN.prototype.iuxor = function iuxor (num) {\n    // a.length > b.length\n    var a;\n    var b;\n    if (this.length > num.length) {\n      a = this;\n      b = num;\n    } else {\n      a = num;\n      b = this;\n    }\n\n    for (var i = 0; i < b.length; i++) {\n      this.words[i] = a.words[i] ^ b.words[i];\n    }\n\n    if (this !== a) {\n      for (; i < a.length; i++) {\n        this.words[i] = a.words[i];\n      }\n    }\n\n    this.length = a.length;\n\n    return this._strip();\n  };\n\n  BN.prototype.ixor = function ixor (num) {\n    assert((this.negative | num.negative) === 0);\n    return this.iuxor(num);\n  };\n\n  // Xor `num` with `this`\n  BN.prototype.xor = function xor (num) {\n    if (this.length > num.length) return this.clone().ixor(num);\n    return num.clone().ixor(this);\n  };\n\n  BN.prototype.uxor = function uxor (num) {\n    if (this.length > num.length) return this.clone().iuxor(num);\n    return num.clone().iuxor(this);\n  };\n\n  // Not ``this`` with ``width`` bitwidth\n  BN.prototype.inotn = function inotn (width) {\n    assert(typeof width === 'number' && width >= 0);\n\n    var bytesNeeded = Math.ceil(width / 26) | 0;\n    var bitsLeft = width % 26;\n\n    // Extend the buffer with leading zeroes\n    this._expand(bytesNeeded);\n\n    if (bitsLeft > 0) {\n      bytesNeeded--;\n    }\n\n    // Handle complete words\n    for (var i = 0; i < bytesNeeded; i++) {\n      this.words[i] = ~this.words[i] & 0x3ffffff;\n    }\n\n    // Handle the residue\n    if (bitsLeft > 0) {\n      this.words[i] = ~this.words[i] & (0x3ffffff >> (26 - bitsLeft));\n    }\n\n    // And remove leading zeroes\n    return this._strip();\n  };\n\n  BN.prototype.notn = function notn (width) {\n    return this.clone().inotn(width);\n  };\n\n  // Set `bit` of `this`\n  BN.prototype.setn = function setn (bit, val) {\n    assert(typeof bit === 'number' && bit >= 0);\n\n    var off = (bit / 26) | 0;\n    var wbit = bit % 26;\n\n    this._expand(off + 1);\n\n    if (val) {\n      this.words[off] = this.words[off] | (1 << wbit);\n    } else {\n      this.words[off] = this.words[off] & ~(1 << wbit);\n    }\n\n    return this._strip();\n  };\n\n  // Add `num` to `this` in-place\n  BN.prototype.iadd = function iadd (num) {\n    var r;\n\n    // negative + positive\n    if (this.negative !== 0 && num.negative === 0) {\n      this.negative = 0;\n      r = this.isub(num);\n      this.negative ^= 1;\n      return this._normSign();\n\n    // positive + negative\n    } else if (this.negative === 0 && num.negative !== 0) {\n      num.negative = 0;\n      r = this.isub(num);\n      num.negative = 1;\n      return r._normSign();\n    }\n\n    // a.length > b.length\n    var a, b;\n    if (this.length > num.length) {\n      a = this;\n      b = num;\n    } else {\n      a = num;\n      b = this;\n    }\n\n    var carry = 0;\n    for (var i = 0; i < b.length; i++) {\n      r = (a.words[i] | 0) + (b.words[i] | 0) + carry;\n      this.words[i] = r & 0x3ffffff;\n      carry = r >>> 26;\n    }\n    for (; carry !== 0 && i < a.length; i++) {\n      r = (a.words[i] | 0) + carry;\n      this.words[i] = r & 0x3ffffff;\n      carry = r >>> 26;\n    }\n\n    this.length = a.length;\n    if (carry !== 0) {\n      this.words[this.length] = carry;\n      this.length++;\n    // Copy the rest of the words\n    } else if (a !== this) {\n      for (; i < a.length; i++) {\n        this.words[i] = a.words[i];\n      }\n    }\n\n    return this;\n  };\n\n  // Add `num` to `this`\n  BN.prototype.add = function add (num) {\n    var res;\n    if (num.negative !== 0 && this.negative === 0) {\n      num.negative = 0;\n      res = this.sub(num);\n      num.negative ^= 1;\n      return res;\n    } else if (num.negative === 0 && this.negative !== 0) {\n      this.negative = 0;\n      res = num.sub(this);\n      this.negative = 1;\n      return res;\n    }\n\n    if (this.length > num.length) return this.clone().iadd(num);\n\n    return num.clone().iadd(this);\n  };\n\n  // Subtract `num` from `this` in-place\n  BN.prototype.isub = function isub (num) {\n    // this - (-num) = this + num\n    if (num.negative !== 0) {\n      num.negative = 0;\n      var r = this.iadd(num);\n      num.negative = 1;\n      return r._normSign();\n\n    // -this - num = -(this + num)\n    } else if (this.negative !== 0) {\n      this.negative = 0;\n      this.iadd(num);\n      this.negative = 1;\n      return this._normSign();\n    }\n\n    // At this point both numbers are positive\n    var cmp = this.cmp(num);\n\n    // Optimization - zeroify\n    if (cmp === 0) {\n      this.negative = 0;\n      this.length = 1;\n      this.words[0] = 0;\n      return this;\n    }\n\n    // a > b\n    var a, b;\n    if (cmp > 0) {\n      a = this;\n      b = num;\n    } else {\n      a = num;\n      b = this;\n    }\n\n    var carry = 0;\n    for (var i = 0; i < b.length; i++) {\n      r = (a.words[i] | 0) - (b.words[i] | 0) + carry;\n      carry = r >> 26;\n      this.words[i] = r & 0x3ffffff;\n    }\n    for (; carry !== 0 && i < a.length; i++) {\n      r = (a.words[i] | 0) + carry;\n      carry = r >> 26;\n      this.words[i] = r & 0x3ffffff;\n    }\n\n    // Copy rest of the words\n    if (carry === 0 && i < a.length && a !== this) {\n      for (; i < a.length; i++) {\n        this.words[i] = a.words[i];\n      }\n    }\n\n    this.length = Math.max(this.length, i);\n\n    if (a !== this) {\n      this.negative = 1;\n    }\n\n    return this._strip();\n  };\n\n  // Subtract `num` from `this`\n  BN.prototype.sub = function sub (num) {\n    return this.clone().isub(num);\n  };\n\n  function smallMulTo (self, num, out) {\n    out.negative = num.negative ^ self.negative;\n    var len = (self.length + num.length) | 0;\n    out.length = len;\n    len = (len - 1) | 0;\n\n    // Peel one iteration (compiler can't do it, because of code complexity)\n    var a = self.words[0] | 0;\n    var b = num.words[0] | 0;\n    var r = a * b;\n\n    var lo = r & 0x3ffffff;\n    var carry = (r / 0x4000000) | 0;\n    out.words[0] = lo;\n\n    for (var k = 1; k < len; k++) {\n      // Sum all words with the same `i + j = k` and accumulate `ncarry`,\n      // note that ncarry could be >= 0x3ffffff\n      var ncarry = carry >>> 26;\n      var rword = carry & 0x3ffffff;\n      var maxJ = Math.min(k, num.length - 1);\n      for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) {\n        var i = (k - j) | 0;\n        a = self.words[i] | 0;\n        b = num.words[j] | 0;\n        r = a * b + rword;\n        ncarry += (r / 0x4000000) | 0;\n        rword = r & 0x3ffffff;\n      }\n      out.words[k] = rword | 0;\n      carry = ncarry | 0;\n    }\n    if (carry !== 0) {\n      out.words[k] = carry | 0;\n    } else {\n      out.length--;\n    }\n\n    return out._strip();\n  }\n\n  // TODO(indutny): it may be reasonable to omit it for users who don't need\n  // to work with 256-bit numbers, otherwise it gives 20% improvement for 256-bit\n  // multiplication (like elliptic secp256k1).\n  var comb10MulTo = function comb10MulTo (self, num, out) {\n    var a = self.words;\n    var b = num.words;\n    var o = out.words;\n    var c = 0;\n    var lo;\n    var mid;\n    var hi;\n    var a0 = a[0] | 0;\n    var al0 = a0 & 0x1fff;\n    var ah0 = a0 >>> 13;\n    var a1 = a[1] | 0;\n    var al1 = a1 & 0x1fff;\n    var ah1 = a1 >>> 13;\n    var a2 = a[2] | 0;\n    var al2 = a2 & 0x1fff;\n    var ah2 = a2 >>> 13;\n    var a3 = a[3] | 0;\n    var al3 = a3 & 0x1fff;\n    var ah3 = a3 >>> 13;\n    var a4 = a[4] | 0;\n    var al4 = a4 & 0x1fff;\n    var ah4 = a4 >>> 13;\n    var a5 = a[5] | 0;\n    var al5 = a5 & 0x1fff;\n    var ah5 = a5 >>> 13;\n    var a6 = a[6] | 0;\n    var al6 = a6 & 0x1fff;\n    var ah6 = a6 >>> 13;\n    var a7 = a[7] | 0;\n    var al7 = a7 & 0x1fff;\n    var ah7 = a7 >>> 13;\n    var a8 = a[8] | 0;\n    var al8 = a8 & 0x1fff;\n    var ah8 = a8 >>> 13;\n    var a9 = a[9] | 0;\n    var al9 = a9 & 0x1fff;\n    var ah9 = a9 >>> 13;\n    var b0 = b[0] | 0;\n    var bl0 = b0 & 0x1fff;\n    var bh0 = b0 >>> 13;\n    var b1 = b[1] | 0;\n    var bl1 = b1 & 0x1fff;\n    var bh1 = b1 >>> 13;\n    var b2 = b[2] | 0;\n    var bl2 = b2 & 0x1fff;\n    var bh2 = b2 >>> 13;\n    var b3 = b[3] | 0;\n    var bl3 = b3 & 0x1fff;\n    var bh3 = b3 >>> 13;\n    var b4 = b[4] | 0;\n    var bl4 = b4 & 0x1fff;\n    var bh4 = b4 >>> 13;\n    var b5 = b[5] | 0;\n    var bl5 = b5 & 0x1fff;\n    var bh5 = b5 >>> 13;\n    var b6 = b[6] | 0;\n    var bl6 = b6 & 0x1fff;\n    var bh6 = b6 >>> 13;\n    var b7 = b[7] | 0;\n    var bl7 = b7 & 0x1fff;\n    var bh7 = b7 >>> 13;\n    var b8 = b[8] | 0;\n    var bl8 = b8 & 0x1fff;\n    var bh8 = b8 >>> 13;\n    var b9 = b[9] | 0;\n    var bl9 = b9 & 0x1fff;\n    var bh9 = b9 >>> 13;\n\n    out.negative = self.negative ^ num.negative;\n    out.length = 19;\n    /* k = 0 */\n    lo = Math.imul(al0, bl0);\n    mid = Math.imul(al0, bh0);\n    mid = (mid + Math.imul(ah0, bl0)) | 0;\n    hi = Math.imul(ah0, bh0);\n    var w0 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0;\n    w0 &= 0x3ffffff;\n    /* k = 1 */\n    lo = Math.imul(al1, bl0);\n    mid = Math.imul(al1, bh0);\n    mid = (mid + Math.imul(ah1, bl0)) | 0;\n    hi = Math.imul(ah1, bh0);\n    lo = (lo + Math.imul(al0, bl1)) | 0;\n    mid = (mid + Math.imul(al0, bh1)) | 0;\n    mid = (mid + Math.imul(ah0, bl1)) | 0;\n    hi = (hi + Math.imul(ah0, bh1)) | 0;\n    var w1 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0;\n    w1 &= 0x3ffffff;\n    /* k = 2 */\n    lo = Math.imul(al2, bl0);\n    mid = Math.imul(al2, bh0);\n    mid = (mid + Math.imul(ah2, bl0)) | 0;\n    hi = Math.imul(ah2, bh0);\n    lo = (lo + Math.imul(al1, bl1)) | 0;\n    mid = (mid + Math.imul(al1, bh1)) | 0;\n    mid = (mid + Math.imul(ah1, bl1)) | 0;\n    hi = (hi + Math.imul(ah1, bh1)) | 0;\n    lo = (lo + Math.imul(al0, bl2)) | 0;\n    mid = (mid + Math.imul(al0, bh2)) | 0;\n    mid = (mid + Math.imul(ah0, bl2)) | 0;\n    hi = (hi + Math.imul(ah0, bh2)) | 0;\n    var w2 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0;\n    w2 &= 0x3ffffff;\n    /* k = 3 */\n    lo = Math.imul(al3, bl0);\n    mid = Math.imul(al3, bh0);\n    mid = (mid + Math.imul(ah3, bl0)) | 0;\n    hi = Math.imul(ah3, bh0);\n    lo = (lo + Math.imul(al2, bl1)) | 0;\n    mid = (mid + Math.imul(al2, bh1)) | 0;\n    mid = (mid + Math.imul(ah2, bl1)) | 0;\n    hi = (hi + Math.imul(ah2, bh1)) | 0;\n    lo = (lo + Math.imul(al1, bl2)) | 0;\n    mid = (mid + Math.imul(al1, bh2)) | 0;\n    mid = (mid + Math.imul(ah1, bl2)) | 0;\n    hi = (hi + Math.imul(ah1, bh2)) | 0;\n    lo = (lo + Math.imul(al0, bl3)) | 0;\n    mid = (mid + Math.imul(al0, bh3)) | 0;\n    mid = (mid + Math.imul(ah0, bl3)) | 0;\n    hi = (hi + Math.imul(ah0, bh3)) | 0;\n    var w3 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0;\n    w3 &= 0x3ffffff;\n    /* k = 4 */\n    lo = Math.imul(al4, bl0);\n    mid = Math.imul(al4, bh0);\n    mid = (mid + Math.imul(ah4, bl0)) | 0;\n    hi = Math.imul(ah4, bh0);\n    lo = (lo + Math.imul(al3, bl1)) | 0;\n    mid = (mid + Math.imul(al3, bh1)) | 0;\n    mid = (mid + Math.imul(ah3, bl1)) | 0;\n    hi = (hi + Math.imul(ah3, bh1)) | 0;\n    lo = (lo + Math.imul(al2, bl2)) | 0;\n    mid = (mid + Math.imul(al2, bh2)) | 0;\n    mid = (mid + Math.imul(ah2, bl2)) | 0;\n    hi = (hi + Math.imul(ah2, bh2)) | 0;\n    lo = (lo + Math.imul(al1, bl3)) | 0;\n    mid = (mid + Math.imul(al1, bh3)) | 0;\n    mid = (mid + Math.imul(ah1, bl3)) | 0;\n    hi = (hi + Math.imul(ah1, bh3)) | 0;\n    lo = (lo + Math.imul(al0, bl4)) | 0;\n    mid = (mid + Math.imul(al0, bh4)) | 0;\n    mid = (mid + Math.imul(ah0, bl4)) | 0;\n    hi = (hi + Math.imul(ah0, bh4)) | 0;\n    var w4 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0;\n    w4 &= 0x3ffffff;\n    /* k = 5 */\n    lo = Math.imul(al5, bl0);\n    mid = Math.imul(al5, bh0);\n    mid = (mid + Math.imul(ah5, bl0)) | 0;\n    hi = Math.imul(ah5, bh0);\n    lo = (lo + Math.imul(al4, bl1)) | 0;\n    mid = (mid + Math.imul(al4, bh1)) | 0;\n    mid = (mid + Math.imul(ah4, bl1)) | 0;\n    hi = (hi + Math.imul(ah4, bh1)) | 0;\n    lo = (lo + Math.imul(al3, bl2)) | 0;\n    mid = (mid + Math.imul(al3, bh2)) | 0;\n    mid = (mid + Math.imul(ah3, bl2)) | 0;\n    hi = (hi + Math.imul(ah3, bh2)) | 0;\n    lo = (lo + Math.imul(al2, bl3)) | 0;\n    mid = (mid + Math.imul(al2, bh3)) | 0;\n    mid = (mid + Math.imul(ah2, bl3)) | 0;\n    hi = (hi + Math.imul(ah2, bh3)) | 0;\n    lo = (lo + Math.imul(al1, bl4)) | 0;\n    mid = (mid + Math.imul(al1, bh4)) | 0;\n    mid = (mid + Math.imul(ah1, bl4)) | 0;\n    hi = (hi + Math.imul(ah1, bh4)) | 0;\n    lo = (lo + Math.imul(al0, bl5)) | 0;\n    mid = (mid + Math.imul(al0, bh5)) | 0;\n    mid = (mid + Math.imul(ah0, bl5)) | 0;\n    hi = (hi + Math.imul(ah0, bh5)) | 0;\n    var w5 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0;\n    w5 &= 0x3ffffff;\n    /* k = 6 */\n    lo = Math.imul(al6, bl0);\n    mid = Math.imul(al6, bh0);\n    mid = (mid + Math.imul(ah6, bl0)) | 0;\n    hi = Math.imul(ah6, bh0);\n    lo = (lo + Math.imul(al5, bl1)) | 0;\n    mid = (mid + Math.imul(al5, bh1)) | 0;\n    mid = (mid + Math.imul(ah5, bl1)) | 0;\n    hi = (hi + Math.imul(ah5, bh1)) | 0;\n    lo = (lo + Math.imul(al4, bl2)) | 0;\n    mid = (mid + Math.imul(al4, bh2)) | 0;\n    mid = (mid + Math.imul(ah4, bl2)) | 0;\n    hi = (hi + Math.imul(ah4, bh2)) | 0;\n    lo = (lo + Math.imul(al3, bl3)) | 0;\n    mid = (mid + Math.imul(al3, bh3)) | 0;\n    mid = (mid + Math.imul(ah3, bl3)) | 0;\n    hi = (hi + Math.imul(ah3, bh3)) | 0;\n    lo = (lo + Math.imul(al2, bl4)) | 0;\n    mid = (mid + Math.imul(al2, bh4)) | 0;\n    mid = (mid + Math.imul(ah2, bl4)) | 0;\n    hi = (hi + Math.imul(ah2, bh4)) | 0;\n    lo = (lo + Math.imul(al1, bl5)) | 0;\n    mid = (mid + Math.imul(al1, bh5)) | 0;\n    mid = (mid + Math.imul(ah1, bl5)) | 0;\n    hi = (hi + Math.imul(ah1, bh5)) | 0;\n    lo = (lo + Math.imul(al0, bl6)) | 0;\n    mid = (mid + Math.imul(al0, bh6)) | 0;\n    mid = (mid + Math.imul(ah0, bl6)) | 0;\n    hi = (hi + Math.imul(ah0, bh6)) | 0;\n    var w6 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0;\n    w6 &= 0x3ffffff;\n    /* k = 7 */\n    lo = Math.imul(al7, bl0);\n    mid = Math.imul(al7, bh0);\n    mid = (mid + Math.imul(ah7, bl0)) | 0;\n    hi = Math.imul(ah7, bh0);\n    lo = (lo + Math.imul(al6, bl1)) | 0;\n    mid = (mid + Math.imul(al6, bh1)) | 0;\n    mid = (mid + Math.imul(ah6, bl1)) | 0;\n    hi = (hi + Math.imul(ah6, bh1)) | 0;\n    lo = (lo + Math.imul(al5, bl2)) | 0;\n    mid = (mid + Math.imul(al5, bh2)) | 0;\n    mid = (mid + Math.imul(ah5, bl2)) | 0;\n    hi = (hi + Math.imul(ah5, bh2)) | 0;\n    lo = (lo + Math.imul(al4, bl3)) | 0;\n    mid = (mid + Math.imul(al4, bh3)) | 0;\n    mid = (mid + Math.imul(ah4, bl3)) | 0;\n    hi = (hi + Math.imul(ah4, bh3)) | 0;\n    lo = (lo + Math.imul(al3, bl4)) | 0;\n    mid = (mid + Math.imul(al3, bh4)) | 0;\n    mid = (mid + Math.imul(ah3, bl4)) | 0;\n    hi = (hi + Math.imul(ah3, bh4)) | 0;\n    lo = (lo + Math.imul(al2, bl5)) | 0;\n    mid = (mid + Math.imul(al2, bh5)) | 0;\n    mid = (mid + Math.imul(ah2, bl5)) | 0;\n    hi = (hi + Math.imul(ah2, bh5)) | 0;\n    lo = (lo + Math.imul(al1, bl6)) | 0;\n    mid = (mid + Math.imul(al1, bh6)) | 0;\n    mid = (mid + Math.imul(ah1, bl6)) | 0;\n    hi = (hi + Math.imul(ah1, bh6)) | 0;\n    lo = (lo + Math.imul(al0, bl7)) | 0;\n    mid = (mid + Math.imul(al0, bh7)) | 0;\n    mid = (mid + Math.imul(ah0, bl7)) | 0;\n    hi = (hi + Math.imul(ah0, bh7)) | 0;\n    var w7 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0;\n    w7 &= 0x3ffffff;\n    /* k = 8 */\n    lo = Math.imul(al8, bl0);\n    mid = Math.imul(al8, bh0);\n    mid = (mid + Math.imul(ah8, bl0)) | 0;\n    hi = Math.imul(ah8, bh0);\n    lo = (lo + Math.imul(al7, bl1)) | 0;\n    mid = (mid + Math.imul(al7, bh1)) | 0;\n    mid = (mid + Math.imul(ah7, bl1)) | 0;\n    hi = (hi + Math.imul(ah7, bh1)) | 0;\n    lo = (lo + Math.imul(al6, bl2)) | 0;\n    mid = (mid + Math.imul(al6, bh2)) | 0;\n    mid = (mid + Math.imul(ah6, bl2)) | 0;\n    hi = (hi + Math.imul(ah6, bh2)) | 0;\n    lo = (lo + Math.imul(al5, bl3)) | 0;\n    mid = (mid + Math.imul(al5, bh3)) | 0;\n    mid = (mid + Math.imul(ah5, bl3)) | 0;\n    hi = (hi + Math.imul(ah5, bh3)) | 0;\n    lo = (lo + Math.imul(al4, bl4)) | 0;\n    mid = (mid + Math.imul(al4, bh4)) | 0;\n    mid = (mid + Math.imul(ah4, bl4)) | 0;\n    hi = (hi + Math.imul(ah4, bh4)) | 0;\n    lo = (lo + Math.imul(al3, bl5)) | 0;\n    mid = (mid + Math.imul(al3, bh5)) | 0;\n    mid = (mid + Math.imul(ah3, bl5)) | 0;\n    hi = (hi + Math.imul(ah3, bh5)) | 0;\n    lo = (lo + Math.imul(al2, bl6)) | 0;\n    mid = (mid + Math.imul(al2, bh6)) | 0;\n    mid = (mid + Math.imul(ah2, bl6)) | 0;\n    hi = (hi + Math.imul(ah2, bh6)) | 0;\n    lo = (lo + Math.imul(al1, bl7)) | 0;\n    mid = (mid + Math.imul(al1, bh7)) | 0;\n    mid = (mid + Math.imul(ah1, bl7)) | 0;\n    hi = (hi + Math.imul(ah1, bh7)) | 0;\n    lo = (lo + Math.imul(al0, bl8)) | 0;\n    mid = (mid + Math.imul(al0, bh8)) | 0;\n    mid = (mid + Math.imul(ah0, bl8)) | 0;\n    hi = (hi + Math.imul(ah0, bh8)) | 0;\n    var w8 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0;\n    w8 &= 0x3ffffff;\n    /* k = 9 */\n    lo = Math.imul(al9, bl0);\n    mid = Math.imul(al9, bh0);\n    mid = (mid + Math.imul(ah9, bl0)) | 0;\n    hi = Math.imul(ah9, bh0);\n    lo = (lo + Math.imul(al8, bl1)) | 0;\n    mid = (mid + Math.imul(al8, bh1)) | 0;\n    mid = (mid + Math.imul(ah8, bl1)) | 0;\n    hi = (hi + Math.imul(ah8, bh1)) | 0;\n    lo = (lo + Math.imul(al7, bl2)) | 0;\n    mid = (mid + Math.imul(al7, bh2)) | 0;\n    mid = (mid + Math.imul(ah7, bl2)) | 0;\n    hi = (hi + Math.imul(ah7, bh2)) | 0;\n    lo = (lo + Math.imul(al6, bl3)) | 0;\n    mid = (mid + Math.imul(al6, bh3)) | 0;\n    mid = (mid + Math.imul(ah6, bl3)) | 0;\n    hi = (hi + Math.imul(ah6, bh3)) | 0;\n    lo = (lo + Math.imul(al5, bl4)) | 0;\n    mid = (mid + Math.imul(al5, bh4)) | 0;\n    mid = (mid + Math.imul(ah5, bl4)) | 0;\n    hi = (hi + Math.imul(ah5, bh4)) | 0;\n    lo = (lo + Math.imul(al4, bl5)) | 0;\n    mid = (mid + Math.imul(al4, bh5)) | 0;\n    mid = (mid + Math.imul(ah4, bl5)) | 0;\n    hi = (hi + Math.imul(ah4, bh5)) | 0;\n    lo = (lo + Math.imul(al3, bl6)) | 0;\n    mid = (mid + Math.imul(al3, bh6)) | 0;\n    mid = (mid + Math.imul(ah3, bl6)) | 0;\n    hi = (hi + Math.imul(ah3, bh6)) | 0;\n    lo = (lo + Math.imul(al2, bl7)) | 0;\n    mid = (mid + Math.imul(al2, bh7)) | 0;\n    mid = (mid + Math.imul(ah2, bl7)) | 0;\n    hi = (hi + Math.imul(ah2, bh7)) | 0;\n    lo = (lo + Math.imul(al1, bl8)) | 0;\n    mid = (mid + Math.imul(al1, bh8)) | 0;\n    mid = (mid + Math.imul(ah1, bl8)) | 0;\n    hi = (hi + Math.imul(ah1, bh8)) | 0;\n    lo = (lo + Math.imul(al0, bl9)) | 0;\n    mid = (mid + Math.imul(al0, bh9)) | 0;\n    mid = (mid + Math.imul(ah0, bl9)) | 0;\n    hi = (hi + Math.imul(ah0, bh9)) | 0;\n    var w9 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0;\n    w9 &= 0x3ffffff;\n    /* k = 10 */\n    lo = Math.imul(al9, bl1);\n    mid = Math.imul(al9, bh1);\n    mid = (mid + Math.imul(ah9, bl1)) | 0;\n    hi = Math.imul(ah9, bh1);\n    lo = (lo + Math.imul(al8, bl2)) | 0;\n    mid = (mid + Math.imul(al8, bh2)) | 0;\n    mid = (mid + Math.imul(ah8, bl2)) | 0;\n    hi = (hi + Math.imul(ah8, bh2)) | 0;\n    lo = (lo + Math.imul(al7, bl3)) | 0;\n    mid = (mid + Math.imul(al7, bh3)) | 0;\n    mid = (mid + Math.imul(ah7, bl3)) | 0;\n    hi = (hi + Math.imul(ah7, bh3)) | 0;\n    lo = (lo + Math.imul(al6, bl4)) | 0;\n    mid = (mid + Math.imul(al6, bh4)) | 0;\n    mid = (mid + Math.imul(ah6, bl4)) | 0;\n    hi = (hi + Math.imul(ah6, bh4)) | 0;\n    lo = (lo + Math.imul(al5, bl5)) | 0;\n    mid = (mid + Math.imul(al5, bh5)) | 0;\n    mid = (mid + Math.imul(ah5, bl5)) | 0;\n    hi = (hi + Math.imul(ah5, bh5)) | 0;\n    lo = (lo + Math.imul(al4, bl6)) | 0;\n    mid = (mid + Math.imul(al4, bh6)) | 0;\n    mid = (mid + Math.imul(ah4, bl6)) | 0;\n    hi = (hi + Math.imul(ah4, bh6)) | 0;\n    lo = (lo + Math.imul(al3, bl7)) | 0;\n    mid = (mid + Math.imul(al3, bh7)) | 0;\n    mid = (mid + Math.imul(ah3, bl7)) | 0;\n    hi = (hi + Math.imul(ah3, bh7)) | 0;\n    lo = (lo + Math.imul(al2, bl8)) | 0;\n    mid = (mid + Math.imul(al2, bh8)) | 0;\n    mid = (mid + Math.imul(ah2, bl8)) | 0;\n    hi = (hi + Math.imul(ah2, bh8)) | 0;\n    lo = (lo + Math.imul(al1, bl9)) | 0;\n    mid = (mid + Math.imul(al1, bh9)) | 0;\n    mid = (mid + Math.imul(ah1, bl9)) | 0;\n    hi = (hi + Math.imul(ah1, bh9)) | 0;\n    var w10 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0;\n    w10 &= 0x3ffffff;\n    /* k = 11 */\n    lo = Math.imul(al9, bl2);\n    mid = Math.imul(al9, bh2);\n    mid = (mid + Math.imul(ah9, bl2)) | 0;\n    hi = Math.imul(ah9, bh2);\n    lo = (lo + Math.imul(al8, bl3)) | 0;\n    mid = (mid + Math.imul(al8, bh3)) | 0;\n    mid = (mid + Math.imul(ah8, bl3)) | 0;\n    hi = (hi + Math.imul(ah8, bh3)) | 0;\n    lo = (lo + Math.imul(al7, bl4)) | 0;\n    mid = (mid + Math.imul(al7, bh4)) | 0;\n    mid = (mid + Math.imul(ah7, bl4)) | 0;\n    hi = (hi + Math.imul(ah7, bh4)) | 0;\n    lo = (lo + Math.imul(al6, bl5)) | 0;\n    mid = (mid + Math.imul(al6, bh5)) | 0;\n    mid = (mid + Math.imul(ah6, bl5)) | 0;\n    hi = (hi + Math.imul(ah6, bh5)) | 0;\n    lo = (lo + Math.imul(al5, bl6)) | 0;\n    mid = (mid + Math.imul(al5, bh6)) | 0;\n    mid = (mid + Math.imul(ah5, bl6)) | 0;\n    hi = (hi + Math.imul(ah5, bh6)) | 0;\n    lo = (lo + Math.imul(al4, bl7)) | 0;\n    mid = (mid + Math.imul(al4, bh7)) | 0;\n    mid = (mid + Math.imul(ah4, bl7)) | 0;\n    hi = (hi + Math.imul(ah4, bh7)) | 0;\n    lo = (lo + Math.imul(al3, bl8)) | 0;\n    mid = (mid + Math.imul(al3, bh8)) | 0;\n    mid = (mid + Math.imul(ah3, bl8)) | 0;\n    hi = (hi + Math.imul(ah3, bh8)) | 0;\n    lo = (lo + Math.imul(al2, bl9)) | 0;\n    mid = (mid + Math.imul(al2, bh9)) | 0;\n    mid = (mid + Math.imul(ah2, bl9)) | 0;\n    hi = (hi + Math.imul(ah2, bh9)) | 0;\n    var w11 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0;\n    w11 &= 0x3ffffff;\n    /* k = 12 */\n    lo = Math.imul(al9, bl3);\n    mid = Math.imul(al9, bh3);\n    mid = (mid + Math.imul(ah9, bl3)) | 0;\n    hi = Math.imul(ah9, bh3);\n    lo = (lo + Math.imul(al8, bl4)) | 0;\n    mid = (mid + Math.imul(al8, bh4)) | 0;\n    mid = (mid + Math.imul(ah8, bl4)) | 0;\n    hi = (hi + Math.imul(ah8, bh4)) | 0;\n    lo = (lo + Math.imul(al7, bl5)) | 0;\n    mid = (mid + Math.imul(al7, bh5)) | 0;\n    mid = (mid + Math.imul(ah7, bl5)) | 0;\n    hi = (hi + Math.imul(ah7, bh5)) | 0;\n    lo = (lo + Math.imul(al6, bl6)) | 0;\n    mid = (mid + Math.imul(al6, bh6)) | 0;\n    mid = (mid + Math.imul(ah6, bl6)) | 0;\n    hi = (hi + Math.imul(ah6, bh6)) | 0;\n    lo = (lo + Math.imul(al5, bl7)) | 0;\n    mid = (mid + Math.imul(al5, bh7)) | 0;\n    mid = (mid + Math.imul(ah5, bl7)) | 0;\n    hi = (hi + Math.imul(ah5, bh7)) | 0;\n    lo = (lo + Math.imul(al4, bl8)) | 0;\n    mid = (mid + Math.imul(al4, bh8)) | 0;\n    mid = (mid + Math.imul(ah4, bl8)) | 0;\n    hi = (hi + Math.imul(ah4, bh8)) | 0;\n    lo = (lo + Math.imul(al3, bl9)) | 0;\n    mid = (mid + Math.imul(al3, bh9)) | 0;\n    mid = (mid + Math.imul(ah3, bl9)) | 0;\n    hi = (hi + Math.imul(ah3, bh9)) | 0;\n    var w12 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0;\n    w12 &= 0x3ffffff;\n    /* k = 13 */\n    lo = Math.imul(al9, bl4);\n    mid = Math.imul(al9, bh4);\n    mid = (mid + Math.imul(ah9, bl4)) | 0;\n    hi = Math.imul(ah9, bh4);\n    lo = (lo + Math.imul(al8, bl5)) | 0;\n    mid = (mid + Math.imul(al8, bh5)) | 0;\n    mid = (mid + Math.imul(ah8, bl5)) | 0;\n    hi = (hi + Math.imul(ah8, bh5)) | 0;\n    lo = (lo + Math.imul(al7, bl6)) | 0;\n    mid = (mid + Math.imul(al7, bh6)) | 0;\n    mid = (mid + Math.imul(ah7, bl6)) | 0;\n    hi = (hi + Math.imul(ah7, bh6)) | 0;\n    lo = (lo + Math.imul(al6, bl7)) | 0;\n    mid = (mid + Math.imul(al6, bh7)) | 0;\n    mid = (mid + Math.imul(ah6, bl7)) | 0;\n    hi = (hi + Math.imul(ah6, bh7)) | 0;\n    lo = (lo + Math.imul(al5, bl8)) | 0;\n    mid = (mid + Math.imul(al5, bh8)) | 0;\n    mid = (mid + Math.imul(ah5, bl8)) | 0;\n    hi = (hi + Math.imul(ah5, bh8)) | 0;\n    lo = (lo + Math.imul(al4, bl9)) | 0;\n    mid = (mid + Math.imul(al4, bh9)) | 0;\n    mid = (mid + Math.imul(ah4, bl9)) | 0;\n    hi = (hi + Math.imul(ah4, bh9)) | 0;\n    var w13 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0;\n    w13 &= 0x3ffffff;\n    /* k = 14 */\n    lo = Math.imul(al9, bl5);\n    mid = Math.imul(al9, bh5);\n    mid = (mid + Math.imul(ah9, bl5)) | 0;\n    hi = Math.imul(ah9, bh5);\n    lo = (lo + Math.imul(al8, bl6)) | 0;\n    mid = (mid + Math.imul(al8, bh6)) | 0;\n    mid = (mid + Math.imul(ah8, bl6)) | 0;\n    hi = (hi + Math.imul(ah8, bh6)) | 0;\n    lo = (lo + Math.imul(al7, bl7)) | 0;\n    mid = (mid + Math.imul(al7, bh7)) | 0;\n    mid = (mid + Math.imul(ah7, bl7)) | 0;\n    hi = (hi + Math.imul(ah7, bh7)) | 0;\n    lo = (lo + Math.imul(al6, bl8)) | 0;\n    mid = (mid + Math.imul(al6, bh8)) | 0;\n    mid = (mid + Math.imul(ah6, bl8)) | 0;\n    hi = (hi + Math.imul(ah6, bh8)) | 0;\n    lo = (lo + Math.imul(al5, bl9)) | 0;\n    mid = (mid + Math.imul(al5, bh9)) | 0;\n    mid = (mid + Math.imul(ah5, bl9)) | 0;\n    hi = (hi + Math.imul(ah5, bh9)) | 0;\n    var w14 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0;\n    w14 &= 0x3ffffff;\n    /* k = 15 */\n    lo = Math.imul(al9, bl6);\n    mid = Math.imul(al9, bh6);\n    mid = (mid + Math.imul(ah9, bl6)) | 0;\n    hi = Math.imul(ah9, bh6);\n    lo = (lo + Math.imul(al8, bl7)) | 0;\n    mid = (mid + Math.imul(al8, bh7)) | 0;\n    mid = (mid + Math.imul(ah8, bl7)) | 0;\n    hi = (hi + Math.imul(ah8, bh7)) | 0;\n    lo = (lo + Math.imul(al7, bl8)) | 0;\n    mid = (mid + Math.imul(al7, bh8)) | 0;\n    mid = (mid + Math.imul(ah7, bl8)) | 0;\n    hi = (hi + Math.imul(ah7, bh8)) | 0;\n    lo = (lo + Math.imul(al6, bl9)) | 0;\n    mid = (mid + Math.imul(al6, bh9)) | 0;\n    mid = (mid + Math.imul(ah6, bl9)) | 0;\n    hi = (hi + Math.imul(ah6, bh9)) | 0;\n    var w15 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0;\n    w15 &= 0x3ffffff;\n    /* k = 16 */\n    lo = Math.imul(al9, bl7);\n    mid = Math.imul(al9, bh7);\n    mid = (mid + Math.imul(ah9, bl7)) | 0;\n    hi = Math.imul(ah9, bh7);\n    lo = (lo + Math.imul(al8, bl8)) | 0;\n    mid = (mid + Math.imul(al8, bh8)) | 0;\n    mid = (mid + Math.imul(ah8, bl8)) | 0;\n    hi = (hi + Math.imul(ah8, bh8)) | 0;\n    lo = (lo + Math.imul(al7, bl9)) | 0;\n    mid = (mid + Math.imul(al7, bh9)) | 0;\n    mid = (mid + Math.imul(ah7, bl9)) | 0;\n    hi = (hi + Math.imul(ah7, bh9)) | 0;\n    var w16 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0;\n    w16 &= 0x3ffffff;\n    /* k = 17 */\n    lo = Math.imul(al9, bl8);\n    mid = Math.imul(al9, bh8);\n    mid = (mid + Math.imul(ah9, bl8)) | 0;\n    hi = Math.imul(ah9, bh8);\n    lo = (lo + Math.imul(al8, bl9)) | 0;\n    mid = (mid + Math.imul(al8, bh9)) | 0;\n    mid = (mid + Math.imul(ah8, bl9)) | 0;\n    hi = (hi + Math.imul(ah8, bh9)) | 0;\n    var w17 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0;\n    w17 &= 0x3ffffff;\n    /* k = 18 */\n    lo = Math.imul(al9, bl9);\n    mid = Math.imul(al9, bh9);\n    mid = (mid + Math.imul(ah9, bl9)) | 0;\n    hi = Math.imul(ah9, bh9);\n    var w18 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0;\n    w18 &= 0x3ffffff;\n    o[0] = w0;\n    o[1] = w1;\n    o[2] = w2;\n    o[3] = w3;\n    o[4] = w4;\n    o[5] = w5;\n    o[6] = w6;\n    o[7] = w7;\n    o[8] = w8;\n    o[9] = w9;\n    o[10] = w10;\n    o[11] = w11;\n    o[12] = w12;\n    o[13] = w13;\n    o[14] = w14;\n    o[15] = w15;\n    o[16] = w16;\n    o[17] = w17;\n    o[18] = w18;\n    if (c !== 0) {\n      o[19] = c;\n      out.length++;\n    }\n    return out;\n  };\n\n  // Polyfill comb\n  if (!Math.imul) {\n    comb10MulTo = smallMulTo;\n  }\n\n  function bigMulTo (self, num, out) {\n    out.negative = num.negative ^ self.negative;\n    out.length = self.length + num.length;\n\n    var carry = 0;\n    var hncarry = 0;\n    for (var k = 0; k < out.length - 1; k++) {\n      // Sum all words with the same `i + j = k` and accumulate `ncarry`,\n      // note that ncarry could be >= 0x3ffffff\n      var ncarry = hncarry;\n      hncarry = 0;\n      var rword = carry & 0x3ffffff;\n      var maxJ = Math.min(k, num.length - 1);\n      for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) {\n        var i = k - j;\n        var a = self.words[i] | 0;\n        var b = num.words[j] | 0;\n        var r = a * b;\n\n        var lo = r & 0x3ffffff;\n        ncarry = (ncarry + ((r / 0x4000000) | 0)) | 0;\n        lo = (lo + rword) | 0;\n        rword = lo & 0x3ffffff;\n        ncarry = (ncarry + (lo >>> 26)) | 0;\n\n        hncarry += ncarry >>> 26;\n        ncarry &= 0x3ffffff;\n      }\n      out.words[k] = rword;\n      carry = ncarry;\n      ncarry = hncarry;\n    }\n    if (carry !== 0) {\n      out.words[k] = carry;\n    } else {\n      out.length--;\n    }\n\n    return out._strip();\n  }\n\n  function jumboMulTo (self, num, out) {\n    // Temporary disable, see https://github.com/indutny/bn.js/issues/211\n    // var fftm = new FFTM();\n    // return fftm.mulp(self, num, out);\n    return bigMulTo(self, num, out);\n  }\n\n  BN.prototype.mulTo = function mulTo (num, out) {\n    var res;\n    var len = this.length + num.length;\n    if (this.length === 10 && num.length === 10) {\n      res = comb10MulTo(this, num, out);\n    } else if (len < 63) {\n      res = smallMulTo(this, num, out);\n    } else if (len < 1024) {\n      res = bigMulTo(this, num, out);\n    } else {\n      res = jumboMulTo(this, num, out);\n    }\n\n    return res;\n  };\n\n  // Cooley-Tukey algorithm for FFT\n  // slightly revisited to rely on looping instead of recursion\n\n  function FFTM (x, y) {\n    this.x = x;\n    this.y = y;\n  }\n\n  FFTM.prototype.makeRBT = function makeRBT (N) {\n    var t = new Array(N);\n    var l = BN.prototype._countBits(N) - 1;\n    for (var i = 0; i < N; i++) {\n      t[i] = this.revBin(i, l, N);\n    }\n\n    return t;\n  };\n\n  // Returns binary-reversed representation of `x`\n  FFTM.prototype.revBin = function revBin (x, l, N) {\n    if (x === 0 || x === N - 1) return x;\n\n    var rb = 0;\n    for (var i = 0; i < l; i++) {\n      rb |= (x & 1) << (l - i - 1);\n      x >>= 1;\n    }\n\n    return rb;\n  };\n\n  // Performs \"tweedling\" phase, therefore 'emulating'\n  // behaviour of the recursive algorithm\n  FFTM.prototype.permute = function permute (rbt, rws, iws, rtws, itws, N) {\n    for (var i = 0; i < N; i++) {\n      rtws[i] = rws[rbt[i]];\n      itws[i] = iws[rbt[i]];\n    }\n  };\n\n  FFTM.prototype.transform = function transform (rws, iws, rtws, itws, N, rbt) {\n    this.permute(rbt, rws, iws, rtws, itws, N);\n\n    for (var s = 1; s < N; s <<= 1) {\n      var l = s << 1;\n\n      var rtwdf = Math.cos(2 * Math.PI / l);\n      var itwdf = Math.sin(2 * Math.PI / l);\n\n      for (var p = 0; p < N; p += l) {\n        var rtwdf_ = rtwdf;\n        var itwdf_ = itwdf;\n\n        for (var j = 0; j < s; j++) {\n          var re = rtws[p + j];\n          var ie = itws[p + j];\n\n          var ro = rtws[p + j + s];\n          var io = itws[p + j + s];\n\n          var rx = rtwdf_ * ro - itwdf_ * io;\n\n          io = rtwdf_ * io + itwdf_ * ro;\n          ro = rx;\n\n          rtws[p + j] = re + ro;\n          itws[p + j] = ie + io;\n\n          rtws[p + j + s] = re - ro;\n          itws[p + j + s] = ie - io;\n\n          /* jshint maxdepth : false */\n          if (j !== l) {\n            rx = rtwdf * rtwdf_ - itwdf * itwdf_;\n\n            itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_;\n            rtwdf_ = rx;\n          }\n        }\n      }\n    }\n  };\n\n  FFTM.prototype.guessLen13b = function guessLen13b (n, m) {\n    var N = Math.max(m, n) | 1;\n    var odd = N & 1;\n    var i = 0;\n    for (N = N / 2 | 0; N; N = N >>> 1) {\n      i++;\n    }\n\n    return 1 << i + 1 + odd;\n  };\n\n  FFTM.prototype.conjugate = function conjugate (rws, iws, N) {\n    if (N <= 1) return;\n\n    for (var i = 0; i < N / 2; i++) {\n      var t = rws[i];\n\n      rws[i] = rws[N - i - 1];\n      rws[N - i - 1] = t;\n\n      t = iws[i];\n\n      iws[i] = -iws[N - i - 1];\n      iws[N - i - 1] = -t;\n    }\n  };\n\n  FFTM.prototype.normalize13b = function normalize13b (ws, N) {\n    var carry = 0;\n    for (var i = 0; i < N / 2; i++) {\n      var w = Math.round(ws[2 * i + 1] / N) * 0x2000 +\n        Math.round(ws[2 * i] / N) +\n        carry;\n\n      ws[i] = w & 0x3ffffff;\n\n      if (w < 0x4000000) {\n        carry = 0;\n      } else {\n        carry = w / 0x4000000 | 0;\n      }\n    }\n\n    return ws;\n  };\n\n  FFTM.prototype.convert13b = function convert13b (ws, len, rws, N) {\n    var carry = 0;\n    for (var i = 0; i < len; i++) {\n      carry = carry + (ws[i] | 0);\n\n      rws[2 * i] = carry & 0x1fff; carry = carry >>> 13;\n      rws[2 * i + 1] = carry & 0x1fff; carry = carry >>> 13;\n    }\n\n    // Pad with zeroes\n    for (i = 2 * len; i < N; ++i) {\n      rws[i] = 0;\n    }\n\n    assert(carry === 0);\n    assert((carry & ~0x1fff) === 0);\n  };\n\n  FFTM.prototype.stub = function stub (N) {\n    var ph = new Array(N);\n    for (var i = 0; i < N; i++) {\n      ph[i] = 0;\n    }\n\n    return ph;\n  };\n\n  FFTM.prototype.mulp = function mulp (x, y, out) {\n    var N = 2 * this.guessLen13b(x.length, y.length);\n\n    var rbt = this.makeRBT(N);\n\n    var _ = this.stub(N);\n\n    var rws = new Array(N);\n    var rwst = new Array(N);\n    var iwst = new Array(N);\n\n    var nrws = new Array(N);\n    var nrwst = new Array(N);\n    var niwst = new Array(N);\n\n    var rmws = out.words;\n    rmws.length = N;\n\n    this.convert13b(x.words, x.length, rws, N);\n    this.convert13b(y.words, y.length, nrws, N);\n\n    this.transform(rws, _, rwst, iwst, N, rbt);\n    this.transform(nrws, _, nrwst, niwst, N, rbt);\n\n    for (var i = 0; i < N; i++) {\n      var rx = rwst[i] * nrwst[i] - iwst[i] * niwst[i];\n      iwst[i] = rwst[i] * niwst[i] + iwst[i] * nrwst[i];\n      rwst[i] = rx;\n    }\n\n    this.conjugate(rwst, iwst, N);\n    this.transform(rwst, iwst, rmws, _, N, rbt);\n    this.conjugate(rmws, _, N);\n    this.normalize13b(rmws, N);\n\n    out.negative = x.negative ^ y.negative;\n    out.length = x.length + y.length;\n    return out._strip();\n  };\n\n  // Multiply `this` by `num`\n  BN.prototype.mul = function mul (num) {\n    var out = new BN(null);\n    out.words = new Array(this.length + num.length);\n    return this.mulTo(num, out);\n  };\n\n  // Multiply employing FFT\n  BN.prototype.mulf = function mulf (num) {\n    var out = new BN(null);\n    out.words = new Array(this.length + num.length);\n    return jumboMulTo(this, num, out);\n  };\n\n  // In-place Multiplication\n  BN.prototype.imul = function imul (num) {\n    return this.clone().mulTo(num, this);\n  };\n\n  BN.prototype.imuln = function imuln (num) {\n    var isNegNum = num < 0;\n    if (isNegNum) num = -num;\n\n    assert(typeof num === 'number');\n    assert(num < 0x4000000);\n\n    // Carry\n    var carry = 0;\n    for (var i = 0; i < this.length; i++) {\n      var w = (this.words[i] | 0) * num;\n      var lo = (w & 0x3ffffff) + (carry & 0x3ffffff);\n      carry >>= 26;\n      carry += (w / 0x4000000) | 0;\n      // NOTE: lo is 27bit maximum\n      carry += lo >>> 26;\n      this.words[i] = lo & 0x3ffffff;\n    }\n\n    if (carry !== 0) {\n      this.words[i] = carry;\n      this.length++;\n    }\n\n    return isNegNum ? this.ineg() : this;\n  };\n\n  BN.prototype.muln = function muln (num) {\n    return this.clone().imuln(num);\n  };\n\n  // `this` * `this`\n  BN.prototype.sqr = function sqr () {\n    return this.mul(this);\n  };\n\n  // `this` * `this` in-place\n  BN.prototype.isqr = function isqr () {\n    return this.imul(this.clone());\n  };\n\n  // Math.pow(`this`, `num`)\n  BN.prototype.pow = function pow (num) {\n    var w = toBitArray(num);\n    if (w.length === 0) return new BN(1);\n\n    // Skip leading zeroes\n    var res = this;\n    for (var i = 0; i < w.length; i++, res = res.sqr()) {\n      if (w[i] !== 0) break;\n    }\n\n    if (++i < w.length) {\n      for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) {\n        if (w[i] === 0) continue;\n\n        res = res.mul(q);\n      }\n    }\n\n    return res;\n  };\n\n  // Shift-left in-place\n  BN.prototype.iushln = function iushln (bits) {\n    assert(typeof bits === 'number' && bits >= 0);\n    var r = bits % 26;\n    var s = (bits - r) / 26;\n    var carryMask = (0x3ffffff >>> (26 - r)) << (26 - r);\n    var i;\n\n    if (r !== 0) {\n      var carry = 0;\n\n      for (i = 0; i < this.length; i++) {\n        var newCarry = this.words[i] & carryMask;\n        var c = ((this.words[i] | 0) - newCarry) << r;\n        this.words[i] = c | carry;\n        carry = newCarry >>> (26 - r);\n      }\n\n      if (carry) {\n        this.words[i] = carry;\n        this.length++;\n      }\n    }\n\n    if (s !== 0) {\n      for (i = this.length - 1; i >= 0; i--) {\n        this.words[i + s] = this.words[i];\n      }\n\n      for (i = 0; i < s; i++) {\n        this.words[i] = 0;\n      }\n\n      this.length += s;\n    }\n\n    return this._strip();\n  };\n\n  BN.prototype.ishln = function ishln (bits) {\n    // TODO(indutny): implement me\n    assert(this.negative === 0);\n    return this.iushln(bits);\n  };\n\n  // Shift-right in-place\n  // NOTE: `hint` is a lowest bit before trailing zeroes\n  // NOTE: if `extended` is present - it will be filled with destroyed bits\n  BN.prototype.iushrn = function iushrn (bits, hint, extended) {\n    assert(typeof bits === 'number' && bits >= 0);\n    var h;\n    if (hint) {\n      h = (hint - (hint % 26)) / 26;\n    } else {\n      h = 0;\n    }\n\n    var r = bits % 26;\n    var s = Math.min((bits - r) / 26, this.length);\n    var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r);\n    var maskedWords = extended;\n\n    h -= s;\n    h = Math.max(0, h);\n\n    // Extended mode, copy masked part\n    if (maskedWords) {\n      for (var i = 0; i < s; i++) {\n        maskedWords.words[i] = this.words[i];\n      }\n      maskedWords.length = s;\n    }\n\n    if (s === 0) {\n      // No-op, we should not move anything at all\n    } else if (this.length > s) {\n      this.length -= s;\n      for (i = 0; i < this.length; i++) {\n        this.words[i] = this.words[i + s];\n      }\n    } else {\n      this.words[0] = 0;\n      this.length = 1;\n    }\n\n    var carry = 0;\n    for (i = this.length - 1; i >= 0 && (carry !== 0 || i >= h); i--) {\n      var word = this.words[i] | 0;\n      this.words[i] = (carry << (26 - r)) | (word >>> r);\n      carry = word & mask;\n    }\n\n    // Push carried bits as a mask\n    if (maskedWords && carry !== 0) {\n      maskedWords.words[maskedWords.length++] = carry;\n    }\n\n    if (this.length === 0) {\n      this.words[0] = 0;\n      this.length = 1;\n    }\n\n    return this._strip();\n  };\n\n  BN.prototype.ishrn = function ishrn (bits, hint, extended) {\n    // TODO(indutny): implement me\n    assert(this.negative === 0);\n    return this.iushrn(bits, hint, extended);\n  };\n\n  // Shift-left\n  BN.prototype.shln = function shln (bits) {\n    return this.clone().ishln(bits);\n  };\n\n  BN.prototype.ushln = function ushln (bits) {\n    return this.clone().iushln(bits);\n  };\n\n  // Shift-right\n  BN.prototype.shrn = function shrn (bits) {\n    return this.clone().ishrn(bits);\n  };\n\n  BN.prototype.ushrn = function ushrn (bits) {\n    return this.clone().iushrn(bits);\n  };\n\n  // Test if n bit is set\n  BN.prototype.testn = function testn (bit) {\n    assert(typeof bit === 'number' && bit >= 0);\n    var r = bit % 26;\n    var s = (bit - r) / 26;\n    var q = 1 << r;\n\n    // Fast case: bit is much higher than all existing words\n    if (this.length <= s) return false;\n\n    // Check bit and return\n    var w = this.words[s];\n\n    return !!(w & q);\n  };\n\n  // Return only lowers bits of number (in-place)\n  BN.prototype.imaskn = function imaskn (bits) {\n    assert(typeof bits === 'number' && bits >= 0);\n    var r = bits % 26;\n    var s = (bits - r) / 26;\n\n    assert(this.negative === 0, 'imaskn works only with positive numbers');\n\n    if (this.length <= s) {\n      return this;\n    }\n\n    if (r !== 0) {\n      s++;\n    }\n    this.length = Math.min(s, this.length);\n\n    if (r !== 0) {\n      var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r);\n      this.words[this.length - 1] &= mask;\n    }\n\n    return this._strip();\n  };\n\n  // Return only lowers bits of number\n  BN.prototype.maskn = function maskn (bits) {\n    return this.clone().imaskn(bits);\n  };\n\n  // Add plain number `num` to `this`\n  BN.prototype.iaddn = function iaddn (num) {\n    assert(typeof num === 'number');\n    assert(num < 0x4000000);\n    if (num < 0) return this.isubn(-num);\n\n    // Possible sign change\n    if (this.negative !== 0) {\n      if (this.length === 1 && (this.words[0] | 0) <= num) {\n        this.words[0] = num - (this.words[0] | 0);\n        this.negative = 0;\n        return this;\n      }\n\n      this.negative = 0;\n      this.isubn(num);\n      this.negative = 1;\n      return this;\n    }\n\n    // Add without checks\n    return this._iaddn(num);\n  };\n\n  BN.prototype._iaddn = function _iaddn (num) {\n    this.words[0] += num;\n\n    // Carry\n    for (var i = 0; i < this.length && this.words[i] >= 0x4000000; i++) {\n      this.words[i] -= 0x4000000;\n      if (i === this.length - 1) {\n        this.words[i + 1] = 1;\n      } else {\n        this.words[i + 1]++;\n      }\n    }\n    this.length = Math.max(this.length, i + 1);\n\n    return this;\n  };\n\n  // Subtract plain number `num` from `this`\n  BN.prototype.isubn = function isubn (num) {\n    assert(typeof num === 'number');\n    assert(num < 0x4000000);\n    if (num < 0) return this.iaddn(-num);\n\n    if (this.negative !== 0) {\n      this.negative = 0;\n      this.iaddn(num);\n      this.negative = 1;\n      return this;\n    }\n\n    this.words[0] -= num;\n\n    if (this.length === 1 && this.words[0] < 0) {\n      this.words[0] = -this.words[0];\n      this.negative = 1;\n    } else {\n      // Carry\n      for (var i = 0; i < this.length && this.words[i] < 0; i++) {\n        this.words[i] += 0x4000000;\n        this.words[i + 1] -= 1;\n      }\n    }\n\n    return this._strip();\n  };\n\n  BN.prototype.addn = function addn (num) {\n    return this.clone().iaddn(num);\n  };\n\n  BN.prototype.subn = function subn (num) {\n    return this.clone().isubn(num);\n  };\n\n  BN.prototype.iabs = function iabs () {\n    this.negative = 0;\n\n    return this;\n  };\n\n  BN.prototype.abs = function abs () {\n    return this.clone().iabs();\n  };\n\n  BN.prototype._ishlnsubmul = function _ishlnsubmul (num, mul, shift) {\n    var len = num.length + shift;\n    var i;\n\n    this._expand(len);\n\n    var w;\n    var carry = 0;\n    for (i = 0; i < num.length; i++) {\n      w = (this.words[i + shift] | 0) + carry;\n      var right = (num.words[i] | 0) * mul;\n      w -= right & 0x3ffffff;\n      carry = (w >> 26) - ((right / 0x4000000) | 0);\n      this.words[i + shift] = w & 0x3ffffff;\n    }\n    for (; i < this.length - shift; i++) {\n      w = (this.words[i + shift] | 0) + carry;\n      carry = w >> 26;\n      this.words[i + shift] = w & 0x3ffffff;\n    }\n\n    if (carry === 0) return this._strip();\n\n    // Subtraction overflow\n    assert(carry === -1);\n    carry = 0;\n    for (i = 0; i < this.length; i++) {\n      w = -(this.words[i] | 0) + carry;\n      carry = w >> 26;\n      this.words[i] = w & 0x3ffffff;\n    }\n    this.negative = 1;\n\n    return this._strip();\n  };\n\n  BN.prototype._wordDiv = function _wordDiv (num, mode) {\n    var shift = this.length - num.length;\n\n    var a = this.clone();\n    var b = num;\n\n    // Normalize\n    var bhi = b.words[b.length - 1] | 0;\n    var bhiBits = this._countBits(bhi);\n    shift = 26 - bhiBits;\n    if (shift !== 0) {\n      b = b.ushln(shift);\n      a.iushln(shift);\n      bhi = b.words[b.length - 1] | 0;\n    }\n\n    // Initialize quotient\n    var m = a.length - b.length;\n    var q;\n\n    if (mode !== 'mod') {\n      q = new BN(null);\n      q.length = m + 1;\n      q.words = new Array(q.length);\n      for (var i = 0; i < q.length; i++) {\n        q.words[i] = 0;\n      }\n    }\n\n    var diff = a.clone()._ishlnsubmul(b, 1, m);\n    if (diff.negative === 0) {\n      a = diff;\n      if (q) {\n        q.words[m] = 1;\n      }\n    }\n\n    for (var j = m - 1; j >= 0; j--) {\n      var qj = (a.words[b.length + j] | 0) * 0x4000000 +\n        (a.words[b.length + j - 1] | 0);\n\n      // NOTE: (qj / bhi) is (0x3ffffff * 0x4000000 + 0x3ffffff) / 0x2000000 max\n      // (0x7ffffff)\n      qj = Math.min((qj / bhi) | 0, 0x3ffffff);\n\n      a._ishlnsubmul(b, qj, j);\n      while (a.negative !== 0) {\n        qj--;\n        a.negative = 0;\n        a._ishlnsubmul(b, 1, j);\n        if (!a.isZero()) {\n          a.negative ^= 1;\n        }\n      }\n      if (q) {\n        q.words[j] = qj;\n      }\n    }\n    if (q) {\n      q._strip();\n    }\n    a._strip();\n\n    // Denormalize\n    if (mode !== 'div' && shift !== 0) {\n      a.iushrn(shift);\n    }\n\n    return {\n      div: q || null,\n      mod: a\n    };\n  };\n\n  // NOTE: 1) `mode` can be set to `mod` to request mod only,\n  //       to `div` to request div only, or be absent to\n  //       request both div & mod\n  //       2) `positive` is true if unsigned mod is requested\n  BN.prototype.divmod = function divmod (num, mode, positive) {\n    assert(!num.isZero());\n\n    if (this.isZero()) {\n      return {\n        div: new BN(0),\n        mod: new BN(0)\n      };\n    }\n\n    var div, mod, res;\n    if (this.negative !== 0 && num.negative === 0) {\n      res = this.neg().divmod(num, mode);\n\n      if (mode !== 'mod') {\n        div = res.div.neg();\n      }\n\n      if (mode !== 'div') {\n        mod = res.mod.neg();\n        if (positive && mod.negative !== 0) {\n          mod.iadd(num);\n        }\n      }\n\n      return {\n        div: div,\n        mod: mod\n      };\n    }\n\n    if (this.negative === 0 && num.negative !== 0) {\n      res = this.divmod(num.neg(), mode);\n\n      if (mode !== 'mod') {\n        div = res.div.neg();\n      }\n\n      return {\n        div: div,\n        mod: res.mod\n      };\n    }\n\n    if ((this.negative & num.negative) !== 0) {\n      res = this.neg().divmod(num.neg(), mode);\n\n      if (mode !== 'div') {\n        mod = res.mod.neg();\n        if (positive && mod.negative !== 0) {\n          mod.isub(num);\n        }\n      }\n\n      return {\n        div: res.div,\n        mod: mod\n      };\n    }\n\n    // Both numbers are positive at this point\n\n    // Strip both numbers to approximate shift value\n    if (num.length > this.length || this.cmp(num) < 0) {\n      return {\n        div: new BN(0),\n        mod: this\n      };\n    }\n\n    // Very short reduction\n    if (num.length === 1) {\n      if (mode === 'div') {\n        return {\n          div: this.divn(num.words[0]),\n          mod: null\n        };\n      }\n\n      if (mode === 'mod') {\n        return {\n          div: null,\n          mod: new BN(this.modrn(num.words[0]))\n        };\n      }\n\n      return {\n        div: this.divn(num.words[0]),\n        mod: new BN(this.modrn(num.words[0]))\n      };\n    }\n\n    return this._wordDiv(num, mode);\n  };\n\n  // Find `this` / `num`\n  BN.prototype.div = function div (num) {\n    return this.divmod(num, 'div', false).div;\n  };\n\n  // Find `this` % `num`\n  BN.prototype.mod = function mod (num) {\n    return this.divmod(num, 'mod', false).mod;\n  };\n\n  BN.prototype.umod = function umod (num) {\n    return this.divmod(num, 'mod', true).mod;\n  };\n\n  // Find Round(`this` / `num`)\n  BN.prototype.divRound = function divRound (num) {\n    var dm = this.divmod(num);\n\n    // Fast case - exact division\n    if (dm.mod.isZero()) return dm.div;\n\n    var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod;\n\n    var half = num.ushrn(1);\n    var r2 = num.andln(1);\n    var cmp = mod.cmp(half);\n\n    // Round down\n    if (cmp < 0 || (r2 === 1 && cmp === 0)) return dm.div;\n\n    // Round up\n    return dm.div.negative !== 0 ? dm.div.isubn(1) : dm.div.iaddn(1);\n  };\n\n  BN.prototype.modrn = function modrn (num) {\n    var isNegNum = num < 0;\n    if (isNegNum) num = -num;\n\n    assert(num <= 0x3ffffff);\n    var p = (1 << 26) % num;\n\n    var acc = 0;\n    for (var i = this.length - 1; i >= 0; i--) {\n      acc = (p * acc + (this.words[i] | 0)) % num;\n    }\n\n    return isNegNum ? -acc : acc;\n  };\n\n  // WARNING: DEPRECATED\n  BN.prototype.modn = function modn (num) {\n    return this.modrn(num);\n  };\n\n  // In-place division by number\n  BN.prototype.idivn = function idivn (num) {\n    var isNegNum = num < 0;\n    if (isNegNum) num = -num;\n\n    assert(num <= 0x3ffffff);\n\n    var carry = 0;\n    for (var i = this.length - 1; i >= 0; i--) {\n      var w = (this.words[i] | 0) + carry * 0x4000000;\n      this.words[i] = (w / num) | 0;\n      carry = w % num;\n    }\n\n    this._strip();\n    return isNegNum ? this.ineg() : this;\n  };\n\n  BN.prototype.divn = function divn (num) {\n    return this.clone().idivn(num);\n  };\n\n  BN.prototype.egcd = function egcd (p) {\n    assert(p.negative === 0);\n    assert(!p.isZero());\n\n    var x = this;\n    var y = p.clone();\n\n    if (x.negative !== 0) {\n      x = x.umod(p);\n    } else {\n      x = x.clone();\n    }\n\n    // A * x + B * y = x\n    var A = new BN(1);\n    var B = new BN(0);\n\n    // C * x + D * y = y\n    var C = new BN(0);\n    var D = new BN(1);\n\n    var g = 0;\n\n    while (x.isEven() && y.isEven()) {\n      x.iushrn(1);\n      y.iushrn(1);\n      ++g;\n    }\n\n    var yp = y.clone();\n    var xp = x.clone();\n\n    while (!x.isZero()) {\n      for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n      if (i > 0) {\n        x.iushrn(i);\n        while (i-- > 0) {\n          if (A.isOdd() || B.isOdd()) {\n            A.iadd(yp);\n            B.isub(xp);\n          }\n\n          A.iushrn(1);\n          B.iushrn(1);\n        }\n      }\n\n      for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n      if (j > 0) {\n        y.iushrn(j);\n        while (j-- > 0) {\n          if (C.isOdd() || D.isOdd()) {\n            C.iadd(yp);\n            D.isub(xp);\n          }\n\n          C.iushrn(1);\n          D.iushrn(1);\n        }\n      }\n\n      if (x.cmp(y) >= 0) {\n        x.isub(y);\n        A.isub(C);\n        B.isub(D);\n      } else {\n        y.isub(x);\n        C.isub(A);\n        D.isub(B);\n      }\n    }\n\n    return {\n      a: C,\n      b: D,\n      gcd: y.iushln(g)\n    };\n  };\n\n  // This is reduced incarnation of the binary EEA\n  // above, designated to invert members of the\n  // _prime_ fields F(p) at a maximal speed\n  BN.prototype._invmp = function _invmp (p) {\n    assert(p.negative === 0);\n    assert(!p.isZero());\n\n    var a = this;\n    var b = p.clone();\n\n    if (a.negative !== 0) {\n      a = a.umod(p);\n    } else {\n      a = a.clone();\n    }\n\n    var x1 = new BN(1);\n    var x2 = new BN(0);\n\n    var delta = b.clone();\n\n    while (a.cmpn(1) > 0 && b.cmpn(1) > 0) {\n      for (var i = 0, im = 1; (a.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n      if (i > 0) {\n        a.iushrn(i);\n        while (i-- > 0) {\n          if (x1.isOdd()) {\n            x1.iadd(delta);\n          }\n\n          x1.iushrn(1);\n        }\n      }\n\n      for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n      if (j > 0) {\n        b.iushrn(j);\n        while (j-- > 0) {\n          if (x2.isOdd()) {\n            x2.iadd(delta);\n          }\n\n          x2.iushrn(1);\n        }\n      }\n\n      if (a.cmp(b) >= 0) {\n        a.isub(b);\n        x1.isub(x2);\n      } else {\n        b.isub(a);\n        x2.isub(x1);\n      }\n    }\n\n    var res;\n    if (a.cmpn(1) === 0) {\n      res = x1;\n    } else {\n      res = x2;\n    }\n\n    if (res.cmpn(0) < 0) {\n      res.iadd(p);\n    }\n\n    return res;\n  };\n\n  BN.prototype.gcd = function gcd (num) {\n    if (this.isZero()) return num.abs();\n    if (num.isZero()) return this.abs();\n\n    var a = this.clone();\n    var b = num.clone();\n    a.negative = 0;\n    b.negative = 0;\n\n    // Remove common factor of two\n    for (var shift = 0; a.isEven() && b.isEven(); shift++) {\n      a.iushrn(1);\n      b.iushrn(1);\n    }\n\n    do {\n      while (a.isEven()) {\n        a.iushrn(1);\n      }\n      while (b.isEven()) {\n        b.iushrn(1);\n      }\n\n      var r = a.cmp(b);\n      if (r < 0) {\n        // Swap `a` and `b` to make `a` always bigger than `b`\n        var t = a;\n        a = b;\n        b = t;\n      } else if (r === 0 || b.cmpn(1) === 0) {\n        break;\n      }\n\n      a.isub(b);\n    } while (true);\n\n    return b.iushln(shift);\n  };\n\n  // Invert number in the field F(num)\n  BN.prototype.invm = function invm (num) {\n    return this.egcd(num).a.umod(num);\n  };\n\n  BN.prototype.isEven = function isEven () {\n    return (this.words[0] & 1) === 0;\n  };\n\n  BN.prototype.isOdd = function isOdd () {\n    return (this.words[0] & 1) === 1;\n  };\n\n  // And first word and num\n  BN.prototype.andln = function andln (num) {\n    return this.words[0] & num;\n  };\n\n  // Increment at the bit position in-line\n  BN.prototype.bincn = function bincn (bit) {\n    assert(typeof bit === 'number');\n    var r = bit % 26;\n    var s = (bit - r) / 26;\n    var q = 1 << r;\n\n    // Fast case: bit is much higher than all existing words\n    if (this.length <= s) {\n      this._expand(s + 1);\n      this.words[s] |= q;\n      return this;\n    }\n\n    // Add bit and propagate, if needed\n    var carry = q;\n    for (var i = s; carry !== 0 && i < this.length; i++) {\n      var w = this.words[i] | 0;\n      w += carry;\n      carry = w >>> 26;\n      w &= 0x3ffffff;\n      this.words[i] = w;\n    }\n    if (carry !== 0) {\n      this.words[i] = carry;\n      this.length++;\n    }\n    return this;\n  };\n\n  BN.prototype.isZero = function isZero () {\n    return this.length === 1 && this.words[0] === 0;\n  };\n\n  BN.prototype.cmpn = function cmpn (num) {\n    var negative = num < 0;\n\n    if (this.negative !== 0 && !negative) return -1;\n    if (this.negative === 0 && negative) return 1;\n\n    this._strip();\n\n    var res;\n    if (this.length > 1) {\n      res = 1;\n    } else {\n      if (negative) {\n        num = -num;\n      }\n\n      assert(num <= 0x3ffffff, 'Number is too big');\n\n      var w = this.words[0] | 0;\n      res = w === num ? 0 : w < num ? -1 : 1;\n    }\n    if (this.negative !== 0) return -res | 0;\n    return res;\n  };\n\n  // Compare two numbers and return:\n  // 1 - if `this` > `num`\n  // 0 - if `this` == `num`\n  // -1 - if `this` < `num`\n  BN.prototype.cmp = function cmp (num) {\n    if (this.negative !== 0 && num.negative === 0) return -1;\n    if (this.negative === 0 && num.negative !== 0) return 1;\n\n    var res = this.ucmp(num);\n    if (this.negative !== 0) return -res | 0;\n    return res;\n  };\n\n  // Unsigned comparison\n  BN.prototype.ucmp = function ucmp (num) {\n    // At this point both numbers have the same sign\n    if (this.length > num.length) return 1;\n    if (this.length < num.length) return -1;\n\n    var res = 0;\n    for (var i = this.length - 1; i >= 0; i--) {\n      var a = this.words[i] | 0;\n      var b = num.words[i] | 0;\n\n      if (a === b) continue;\n      if (a < b) {\n        res = -1;\n      } else if (a > b) {\n        res = 1;\n      }\n      break;\n    }\n    return res;\n  };\n\n  BN.prototype.gtn = function gtn (num) {\n    return this.cmpn(num) === 1;\n  };\n\n  BN.prototype.gt = function gt (num) {\n    return this.cmp(num) === 1;\n  };\n\n  BN.prototype.gten = function gten (num) {\n    return this.cmpn(num) >= 0;\n  };\n\n  BN.prototype.gte = function gte (num) {\n    return this.cmp(num) >= 0;\n  };\n\n  BN.prototype.ltn = function ltn (num) {\n    return this.cmpn(num) === -1;\n  };\n\n  BN.prototype.lt = function lt (num) {\n    return this.cmp(num) === -1;\n  };\n\n  BN.prototype.lten = function lten (num) {\n    return this.cmpn(num) <= 0;\n  };\n\n  BN.prototype.lte = function lte (num) {\n    return this.cmp(num) <= 0;\n  };\n\n  BN.prototype.eqn = function eqn (num) {\n    return this.cmpn(num) === 0;\n  };\n\n  BN.prototype.eq = function eq (num) {\n    return this.cmp(num) === 0;\n  };\n\n  //\n  // A reduce context, could be using montgomery or something better, depending\n  // on the `m` itself.\n  //\n  BN.red = function red (num) {\n    return new Red(num);\n  };\n\n  BN.prototype.toRed = function toRed (ctx) {\n    assert(!this.red, 'Already a number in reduction context');\n    assert(this.negative === 0, 'red works only with positives');\n    return ctx.convertTo(this)._forceRed(ctx);\n  };\n\n  BN.prototype.fromRed = function fromRed () {\n    assert(this.red, 'fromRed works only with numbers in reduction context');\n    return this.red.convertFrom(this);\n  };\n\n  BN.prototype._forceRed = function _forceRed (ctx) {\n    this.red = ctx;\n    return this;\n  };\n\n  BN.prototype.forceRed = function forceRed (ctx) {\n    assert(!this.red, 'Already a number in reduction context');\n    return this._forceRed(ctx);\n  };\n\n  BN.prototype.redAdd = function redAdd (num) {\n    assert(this.red, 'redAdd works only with red numbers');\n    return this.red.add(this, num);\n  };\n\n  BN.prototype.redIAdd = function redIAdd (num) {\n    assert(this.red, 'redIAdd works only with red numbers');\n    return this.red.iadd(this, num);\n  };\n\n  BN.prototype.redSub = function redSub (num) {\n    assert(this.red, 'redSub works only with red numbers');\n    return this.red.sub(this, num);\n  };\n\n  BN.prototype.redISub = function redISub (num) {\n    assert(this.red, 'redISub works only with red numbers');\n    return this.red.isub(this, num);\n  };\n\n  BN.prototype.redShl = function redShl (num) {\n    assert(this.red, 'redShl works only with red numbers');\n    return this.red.shl(this, num);\n  };\n\n  BN.prototype.redMul = function redMul (num) {\n    assert(this.red, 'redMul works only with red numbers');\n    this.red._verify2(this, num);\n    return this.red.mul(this, num);\n  };\n\n  BN.prototype.redIMul = function redIMul (num) {\n    assert(this.red, 'redMul works only with red numbers');\n    this.red._verify2(this, num);\n    return this.red.imul(this, num);\n  };\n\n  BN.prototype.redSqr = function redSqr () {\n    assert(this.red, 'redSqr works only with red numbers');\n    this.red._verify1(this);\n    return this.red.sqr(this);\n  };\n\n  BN.prototype.redISqr = function redISqr () {\n    assert(this.red, 'redISqr works only with red numbers');\n    this.red._verify1(this);\n    return this.red.isqr(this);\n  };\n\n  // Square root over p\n  BN.prototype.redSqrt = function redSqrt () {\n    assert(this.red, 'redSqrt works only with red numbers');\n    this.red._verify1(this);\n    return this.red.sqrt(this);\n  };\n\n  BN.prototype.redInvm = function redInvm () {\n    assert(this.red, 'redInvm works only with red numbers');\n    this.red._verify1(this);\n    return this.red.invm(this);\n  };\n\n  // Return negative clone of `this` % `red modulo`\n  BN.prototype.redNeg = function redNeg () {\n    assert(this.red, 'redNeg works only with red numbers');\n    this.red._verify1(this);\n    return this.red.neg(this);\n  };\n\n  BN.prototype.redPow = function redPow (num) {\n    assert(this.red && !num.red, 'redPow(normalNum)');\n    this.red._verify1(this);\n    return this.red.pow(this, num);\n  };\n\n  // Prime numbers with efficient reduction\n  var primes = {\n    k256: null,\n    p224: null,\n    p192: null,\n    p25519: null\n  };\n\n  // Pseudo-Mersenne prime\n  function MPrime (name, p) {\n    // P = 2 ^ N - K\n    this.name = name;\n    this.p = new BN(p, 16);\n    this.n = this.p.bitLength();\n    this.k = new BN(1).iushln(this.n).isub(this.p);\n\n    this.tmp = this._tmp();\n  }\n\n  MPrime.prototype._tmp = function _tmp () {\n    var tmp = new BN(null);\n    tmp.words = new Array(Math.ceil(this.n / 13));\n    return tmp;\n  };\n\n  MPrime.prototype.ireduce = function ireduce (num) {\n    // Assumes that `num` is less than `P^2`\n    // num = HI * (2 ^ N - K) + HI * K + LO = HI * K + LO (mod P)\n    var r = num;\n    var rlen;\n\n    do {\n      this.split(r, this.tmp);\n      r = this.imulK(r);\n      r = r.iadd(this.tmp);\n      rlen = r.bitLength();\n    } while (rlen > this.n);\n\n    var cmp = rlen < this.n ? -1 : r.ucmp(this.p);\n    if (cmp === 0) {\n      r.words[0] = 0;\n      r.length = 1;\n    } else if (cmp > 0) {\n      r.isub(this.p);\n    } else {\n      if (r.strip !== undefined) {\n        // r is a BN v4 instance\n        r.strip();\n      } else {\n        // r is a BN v5 instance\n        r._strip();\n      }\n    }\n\n    return r;\n  };\n\n  MPrime.prototype.split = function split (input, out) {\n    input.iushrn(this.n, 0, out);\n  };\n\n  MPrime.prototype.imulK = function imulK (num) {\n    return num.imul(this.k);\n  };\n\n  function K256 () {\n    MPrime.call(\n      this,\n      'k256',\n      'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f');\n  }\n  inherits(K256, MPrime);\n\n  K256.prototype.split = function split (input, output) {\n    // 256 = 9 * 26 + 22\n    var mask = 0x3fffff;\n\n    var outLen = Math.min(input.length, 9);\n    for (var i = 0; i < outLen; i++) {\n      output.words[i] = input.words[i];\n    }\n    output.length = outLen;\n\n    if (input.length <= 9) {\n      input.words[0] = 0;\n      input.length = 1;\n      return;\n    }\n\n    // Shift by 9 limbs\n    var prev = input.words[9];\n    output.words[output.length++] = prev & mask;\n\n    for (i = 10; i < input.length; i++) {\n      var next = input.words[i] | 0;\n      input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22);\n      prev = next;\n    }\n    prev >>>= 22;\n    input.words[i - 10] = prev;\n    if (prev === 0 && input.length > 10) {\n      input.length -= 10;\n    } else {\n      input.length -= 9;\n    }\n  };\n\n  K256.prototype.imulK = function imulK (num) {\n    // K = 0x1000003d1 = [ 0x40, 0x3d1 ]\n    num.words[num.length] = 0;\n    num.words[num.length + 1] = 0;\n    num.length += 2;\n\n    // bounded at: 0x40 * 0x3ffffff + 0x3d0 = 0x100000390\n    var lo = 0;\n    for (var i = 0; i < num.length; i++) {\n      var w = num.words[i] | 0;\n      lo += w * 0x3d1;\n      num.words[i] = lo & 0x3ffffff;\n      lo = w * 0x40 + ((lo / 0x4000000) | 0);\n    }\n\n    // Fast length reduction\n    if (num.words[num.length - 1] === 0) {\n      num.length--;\n      if (num.words[num.length - 1] === 0) {\n        num.length--;\n      }\n    }\n    return num;\n  };\n\n  function P224 () {\n    MPrime.call(\n      this,\n      'p224',\n      'ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001');\n  }\n  inherits(P224, MPrime);\n\n  function P192 () {\n    MPrime.call(\n      this,\n      'p192',\n      'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff');\n  }\n  inherits(P192, MPrime);\n\n  function P25519 () {\n    // 2 ^ 255 - 19\n    MPrime.call(\n      this,\n      '25519',\n      '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed');\n  }\n  inherits(P25519, MPrime);\n\n  P25519.prototype.imulK = function imulK (num) {\n    // K = 0x13\n    var carry = 0;\n    for (var i = 0; i < num.length; i++) {\n      var hi = (num.words[i] | 0) * 0x13 + carry;\n      var lo = hi & 0x3ffffff;\n      hi >>>= 26;\n\n      num.words[i] = lo;\n      carry = hi;\n    }\n    if (carry !== 0) {\n      num.words[num.length++] = carry;\n    }\n    return num;\n  };\n\n  // Exported mostly for testing purposes, use plain name instead\n  BN._prime = function prime (name) {\n    // Cached version of prime\n    if (primes[name]) return primes[name];\n\n    var prime;\n    if (name === 'k256') {\n      prime = new K256();\n    } else if (name === 'p224') {\n      prime = new P224();\n    } else if (name === 'p192') {\n      prime = new P192();\n    } else if (name === 'p25519') {\n      prime = new P25519();\n    } else {\n      throw new Error('Unknown prime ' + name);\n    }\n    primes[name] = prime;\n\n    return prime;\n  };\n\n  //\n  // Base reduction engine\n  //\n  function Red (m) {\n    if (typeof m === 'string') {\n      var prime = BN._prime(m);\n      this.m = prime.p;\n      this.prime = prime;\n    } else {\n      assert(m.gtn(1), 'modulus must be greater than 1');\n      this.m = m;\n      this.prime = null;\n    }\n  }\n\n  Red.prototype._verify1 = function _verify1 (a) {\n    assert(a.negative === 0, 'red works only with positives');\n    assert(a.red, 'red works only with red numbers');\n  };\n\n  Red.prototype._verify2 = function _verify2 (a, b) {\n    assert((a.negative | b.negative) === 0, 'red works only with positives');\n    assert(a.red && a.red === b.red,\n      'red works only with red numbers');\n  };\n\n  Red.prototype.imod = function imod (a) {\n    if (this.prime) return this.prime.ireduce(a)._forceRed(this);\n\n    move(a, a.umod(this.m)._forceRed(this));\n    return a;\n  };\n\n  Red.prototype.neg = function neg (a) {\n    if (a.isZero()) {\n      return a.clone();\n    }\n\n    return this.m.sub(a)._forceRed(this);\n  };\n\n  Red.prototype.add = function add (a, b) {\n    this._verify2(a, b);\n\n    var res = a.add(b);\n    if (res.cmp(this.m) >= 0) {\n      res.isub(this.m);\n    }\n    return res._forceRed(this);\n  };\n\n  Red.prototype.iadd = function iadd (a, b) {\n    this._verify2(a, b);\n\n    var res = a.iadd(b);\n    if (res.cmp(this.m) >= 0) {\n      res.isub(this.m);\n    }\n    return res;\n  };\n\n  Red.prototype.sub = function sub (a, b) {\n    this._verify2(a, b);\n\n    var res = a.sub(b);\n    if (res.cmpn(0) < 0) {\n      res.iadd(this.m);\n    }\n    return res._forceRed(this);\n  };\n\n  Red.prototype.isub = function isub (a, b) {\n    this._verify2(a, b);\n\n    var res = a.isub(b);\n    if (res.cmpn(0) < 0) {\n      res.iadd(this.m);\n    }\n    return res;\n  };\n\n  Red.prototype.shl = function shl (a, num) {\n    this._verify1(a);\n    return this.imod(a.ushln(num));\n  };\n\n  Red.prototype.imul = function imul (a, b) {\n    this._verify2(a, b);\n    return this.imod(a.imul(b));\n  };\n\n  Red.prototype.mul = function mul (a, b) {\n    this._verify2(a, b);\n    return this.imod(a.mul(b));\n  };\n\n  Red.prototype.isqr = function isqr (a) {\n    return this.imul(a, a.clone());\n  };\n\n  Red.prototype.sqr = function sqr (a) {\n    return this.mul(a, a);\n  };\n\n  Red.prototype.sqrt = function sqrt (a) {\n    if (a.isZero()) return a.clone();\n\n    var mod3 = this.m.andln(3);\n    assert(mod3 % 2 === 1);\n\n    // Fast case\n    if (mod3 === 3) {\n      var pow = this.m.add(new BN(1)).iushrn(2);\n      return this.pow(a, pow);\n    }\n\n    // Tonelli-Shanks algorithm (Totally unoptimized and slow)\n    //\n    // Find Q and S, that Q * 2 ^ S = (P - 1)\n    var q = this.m.subn(1);\n    var s = 0;\n    while (!q.isZero() && q.andln(1) === 0) {\n      s++;\n      q.iushrn(1);\n    }\n    assert(!q.isZero());\n\n    var one = new BN(1).toRed(this);\n    var nOne = one.redNeg();\n\n    // Find quadratic non-residue\n    // NOTE: Max is such because of generalized Riemann hypothesis.\n    var lpow = this.m.subn(1).iushrn(1);\n    var z = this.m.bitLength();\n    z = new BN(2 * z * z).toRed(this);\n\n    while (this.pow(z, lpow).cmp(nOne) !== 0) {\n      z.redIAdd(nOne);\n    }\n\n    var c = this.pow(z, q);\n    var r = this.pow(a, q.addn(1).iushrn(1));\n    var t = this.pow(a, q);\n    var m = s;\n    while (t.cmp(one) !== 0) {\n      var tmp = t;\n      for (var i = 0; tmp.cmp(one) !== 0; i++) {\n        tmp = tmp.redSqr();\n      }\n      assert(i < m);\n      var b = this.pow(c, new BN(1).iushln(m - i - 1));\n\n      r = r.redMul(b);\n      c = b.redSqr();\n      t = t.redMul(c);\n      m = i;\n    }\n\n    return r;\n  };\n\n  Red.prototype.invm = function invm (a) {\n    var inv = a._invmp(this.m);\n    if (inv.negative !== 0) {\n      inv.negative = 0;\n      return this.imod(inv).redNeg();\n    } else {\n      return this.imod(inv);\n    }\n  };\n\n  Red.prototype.pow = function pow (a, num) {\n    if (num.isZero()) return new BN(1).toRed(this);\n    if (num.cmpn(1) === 0) return a.clone();\n\n    var windowSize = 4;\n    var wnd = new Array(1 << windowSize);\n    wnd[0] = new BN(1).toRed(this);\n    wnd[1] = a;\n    for (var i = 2; i < wnd.length; i++) {\n      wnd[i] = this.mul(wnd[i - 1], a);\n    }\n\n    var res = wnd[0];\n    var current = 0;\n    var currentLen = 0;\n    var start = num.bitLength() % 26;\n    if (start === 0) {\n      start = 26;\n    }\n\n    for (i = num.length - 1; i >= 0; i--) {\n      var word = num.words[i];\n      for (var j = start - 1; j >= 0; j--) {\n        var bit = (word >> j) & 1;\n        if (res !== wnd[0]) {\n          res = this.sqr(res);\n        }\n\n        if (bit === 0 && current === 0) {\n          currentLen = 0;\n          continue;\n        }\n\n        current <<= 1;\n        current |= bit;\n        currentLen++;\n        if (currentLen !== windowSize && (i !== 0 || j !== 0)) continue;\n\n        res = this.mul(res, wnd[current]);\n        currentLen = 0;\n        current = 0;\n      }\n      start = 26;\n    }\n\n    return res;\n  };\n\n  Red.prototype.convertTo = function convertTo (num) {\n    var r = num.umod(this.m);\n\n    return r === num ? r.clone() : r;\n  };\n\n  Red.prototype.convertFrom = function convertFrom (num) {\n    var res = num.clone();\n    res.red = null;\n    return res;\n  };\n\n  //\n  // Montgomery method engine\n  //\n\n  BN.mont = function mont (num) {\n    return new Mont(num);\n  };\n\n  function Mont (m) {\n    Red.call(this, m);\n\n    this.shift = this.m.bitLength();\n    if (this.shift % 26 !== 0) {\n      this.shift += 26 - (this.shift % 26);\n    }\n\n    this.r = new BN(1).iushln(this.shift);\n    this.r2 = this.imod(this.r.sqr());\n    this.rinv = this.r._invmp(this.m);\n\n    this.minv = this.rinv.mul(this.r).isubn(1).div(this.m);\n    this.minv = this.minv.umod(this.r);\n    this.minv = this.r.sub(this.minv);\n  }\n  inherits(Mont, Red);\n\n  Mont.prototype.convertTo = function convertTo (num) {\n    return this.imod(num.ushln(this.shift));\n  };\n\n  Mont.prototype.convertFrom = function convertFrom (num) {\n    var r = this.imod(num.mul(this.rinv));\n    r.red = null;\n    return r;\n  };\n\n  Mont.prototype.imul = function imul (a, b) {\n    if (a.isZero() || b.isZero()) {\n      a.words[0] = 0;\n      a.length = 1;\n      return a;\n    }\n\n    var t = a.imul(b);\n    var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m);\n    var u = t.isub(c).iushrn(this.shift);\n    var res = u;\n\n    if (u.cmp(this.m) >= 0) {\n      res = u.isub(this.m);\n    } else if (u.cmpn(0) < 0) {\n      res = u.iadd(this.m);\n    }\n\n    return res._forceRed(this);\n  };\n\n  Mont.prototype.mul = function mul (a, b) {\n    if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this);\n\n    var t = a.mul(b);\n    var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m);\n    var u = t.isub(c).iushrn(this.shift);\n    var res = u;\n    if (u.cmp(this.m) >= 0) {\n      res = u.isub(this.m);\n    } else if (u.cmpn(0) < 0) {\n      res = u.iadd(this.m);\n    }\n\n    return res._forceRed(this);\n  };\n\n  Mont.prototype.invm = function invm (a) {\n    // (AR)^-1 * R^2 = (A^-1 * R^-1) * R^2 = A^-1 * R\n    var res = this.imod(a._invmp(this.m).mul(this.r2));\n    return res._forceRed(this);\n  };\n})(typeof module === 'undefined' || module, this);\n","// 'path' module extracted from Node.js v8.11.1 (only the posix part)\n// transplited with Babel\n\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\n'use strict';\n\nfunction assertPath(path) {\n  if (typeof path !== 'string') {\n    throw new TypeError('Path must be a string. Received ' + JSON.stringify(path));\n  }\n}\n\n// Resolves . and .. elements in a path with directory names\nfunction normalizeStringPosix(path, allowAboveRoot) {\n  var res = '';\n  var lastSegmentLength = 0;\n  var lastSlash = -1;\n  var dots = 0;\n  var code;\n  for (var i = 0; i <= path.length; ++i) {\n    if (i < path.length)\n      code = path.charCodeAt(i);\n    else if (code === 47 /*/*/)\n      break;\n    else\n      code = 47 /*/*/;\n    if (code === 47 /*/*/) {\n      if (lastSlash === i - 1 || dots === 1) {\n        // NOOP\n      } else if (lastSlash !== i - 1 && dots === 2) {\n        if (res.length < 2 || lastSegmentLength !== 2 || res.charCodeAt(res.length - 1) !== 46 /*.*/ || res.charCodeAt(res.length - 2) !== 46 /*.*/) {\n          if (res.length > 2) {\n            var lastSlashIndex = res.lastIndexOf('/');\n            if (lastSlashIndex !== res.length - 1) {\n              if (lastSlashIndex === -1) {\n                res = '';\n                lastSegmentLength = 0;\n              } else {\n                res = res.slice(0, lastSlashIndex);\n                lastSegmentLength = res.length - 1 - res.lastIndexOf('/');\n              }\n              lastSlash = i;\n              dots = 0;\n              continue;\n            }\n          } else if (res.length === 2 || res.length === 1) {\n            res = '';\n            lastSegmentLength = 0;\n            lastSlash = i;\n            dots = 0;\n            continue;\n          }\n        }\n        if (allowAboveRoot) {\n          if (res.length > 0)\n            res += '/..';\n          else\n            res = '..';\n          lastSegmentLength = 2;\n        }\n      } else {\n        if (res.length > 0)\n          res += '/' + path.slice(lastSlash + 1, i);\n        else\n          res = path.slice(lastSlash + 1, i);\n        lastSegmentLength = i - lastSlash - 1;\n      }\n      lastSlash = i;\n      dots = 0;\n    } else if (code === 46 /*.*/ && dots !== -1) {\n      ++dots;\n    } else {\n      dots = -1;\n    }\n  }\n  return res;\n}\n\nfunction _format(sep, pathObject) {\n  var dir = pathObject.dir || pathObject.root;\n  var base = pathObject.base || (pathObject.name || '') + (pathObject.ext || '');\n  if (!dir) {\n    return base;\n  }\n  if (dir === pathObject.root) {\n    return dir + base;\n  }\n  return dir + sep + base;\n}\n\nvar posix = {\n  // path.resolve([from ...], to)\n  resolve: function resolve() {\n    var resolvedPath = '';\n    var resolvedAbsolute = false;\n    var cwd;\n\n    for (var i = arguments.length - 1; i >= -1 && !resolvedAbsolute; i--) {\n      var path;\n      if (i >= 0)\n        path = arguments[i];\n      else {\n        if (cwd === undefined)\n          cwd = process.cwd();\n        path = cwd;\n      }\n\n      assertPath(path);\n\n      // Skip empty entries\n      if (path.length === 0) {\n        continue;\n      }\n\n      resolvedPath = path + '/' + resolvedPath;\n      resolvedAbsolute = path.charCodeAt(0) === 47 /*/*/;\n    }\n\n    // At this point the path should be resolved to a full absolute path, but\n    // handle relative paths to be safe (might happen when process.cwd() fails)\n\n    // Normalize the path\n    resolvedPath = normalizeStringPosix(resolvedPath, !resolvedAbsolute);\n\n    if (resolvedAbsolute) {\n      if (resolvedPath.length > 0)\n        return '/' + resolvedPath;\n      else\n        return '/';\n    } else if (resolvedPath.length > 0) {\n      return resolvedPath;\n    } else {\n      return '.';\n    }\n  },\n\n  normalize: function normalize(path) {\n    assertPath(path);\n\n    if (path.length === 0) return '.';\n\n    var isAbsolute = path.charCodeAt(0) === 47 /*/*/;\n    var trailingSeparator = path.charCodeAt(path.length - 1) === 47 /*/*/;\n\n    // Normalize the path\n    path = normalizeStringPosix(path, !isAbsolute);\n\n    if (path.length === 0 && !isAbsolute) path = '.';\n    if (path.length > 0 && trailingSeparator) path += '/';\n\n    if (isAbsolute) return '/' + path;\n    return path;\n  },\n\n  isAbsolute: function isAbsolute(path) {\n    assertPath(path);\n    return path.length > 0 && path.charCodeAt(0) === 47 /*/*/;\n  },\n\n  join: function join() {\n    if (arguments.length === 0)\n      return '.';\n    var joined;\n    for (var i = 0; i < arguments.length; ++i) {\n      var arg = arguments[i];\n      assertPath(arg);\n      if (arg.length > 0) {\n        if (joined === undefined)\n          joined = arg;\n        else\n          joined += '/' + arg;\n      }\n    }\n    if (joined === undefined)\n      return '.';\n    return posix.normalize(joined);\n  },\n\n  relative: function relative(from, to) {\n    assertPath(from);\n    assertPath(to);\n\n    if (from === to) return '';\n\n    from = posix.resolve(from);\n    to = posix.resolve(to);\n\n    if (from === to) return '';\n\n    // Trim any leading backslashes\n    var fromStart = 1;\n    for (; fromStart < from.length; ++fromStart) {\n      if (from.charCodeAt(fromStart) !== 47 /*/*/)\n        break;\n    }\n    var fromEnd = from.length;\n    var fromLen = fromEnd - fromStart;\n\n    // Trim any leading backslashes\n    var toStart = 1;\n    for (; toStart < to.length; ++toStart) {\n      if (to.charCodeAt(toStart) !== 47 /*/*/)\n        break;\n    }\n    var toEnd = to.length;\n    var toLen = toEnd - toStart;\n\n    // Compare paths to find the longest common path from root\n    var length = fromLen < toLen ? fromLen : toLen;\n    var lastCommonSep = -1;\n    var i = 0;\n    for (; i <= length; ++i) {\n      if (i === length) {\n        if (toLen > length) {\n          if (to.charCodeAt(toStart + i) === 47 /*/*/) {\n            // We get here if `from` is the exact base path for `to`.\n            // For example: from='/foo/bar'; to='/foo/bar/baz'\n            return to.slice(toStart + i + 1);\n          } else if (i === 0) {\n            // We get here if `from` is the root\n            // For example: from='/'; to='/foo'\n            return to.slice(toStart + i);\n          }\n        } else if (fromLen > length) {\n          if (from.charCodeAt(fromStart + i) === 47 /*/*/) {\n            // We get here if `to` is the exact base path for `from`.\n            // For example: from='/foo/bar/baz'; to='/foo/bar'\n            lastCommonSep = i;\n          } else if (i === 0) {\n            // We get here if `to` is the root.\n            // For example: from='/foo'; to='/'\n            lastCommonSep = 0;\n          }\n        }\n        break;\n      }\n      var fromCode = from.charCodeAt(fromStart + i);\n      var toCode = to.charCodeAt(toStart + i);\n      if (fromCode !== toCode)\n        break;\n      else if (fromCode === 47 /*/*/)\n        lastCommonSep = i;\n    }\n\n    var out = '';\n    // Generate the relative path based on the path difference between `to`\n    // and `from`\n    for (i = fromStart + lastCommonSep + 1; i <= fromEnd; ++i) {\n      if (i === fromEnd || from.charCodeAt(i) === 47 /*/*/) {\n        if (out.length === 0)\n          out += '..';\n        else\n          out += '/..';\n      }\n    }\n\n    // Lastly, append the rest of the destination (`to`) path that comes after\n    // the common path parts\n    if (out.length > 0)\n      return out + to.slice(toStart + lastCommonSep);\n    else {\n      toStart += lastCommonSep;\n      if (to.charCodeAt(toStart) === 47 /*/*/)\n        ++toStart;\n      return to.slice(toStart);\n    }\n  },\n\n  _makeLong: function _makeLong(path) {\n    return path;\n  },\n\n  dirname: function dirname(path) {\n    assertPath(path);\n    if (path.length === 0) return '.';\n    var code = path.charCodeAt(0);\n    var hasRoot = code === 47 /*/*/;\n    var end = -1;\n    var matchedSlash = true;\n    for (var i = path.length - 1; i >= 1; --i) {\n      code = path.charCodeAt(i);\n      if (code === 47 /*/*/) {\n          if (!matchedSlash) {\n            end = i;\n            break;\n          }\n        } else {\n        // We saw the first non-path separator\n        matchedSlash = false;\n      }\n    }\n\n    if (end === -1) return hasRoot ? '/' : '.';\n    if (hasRoot && end === 1) return '//';\n    return path.slice(0, end);\n  },\n\n  basename: function basename(path, ext) {\n    if (ext !== undefined && typeof ext !== 'string') throw new TypeError('\"ext\" argument must be a string');\n    assertPath(path);\n\n    var start = 0;\n    var end = -1;\n    var matchedSlash = true;\n    var i;\n\n    if (ext !== undefined && ext.length > 0 && ext.length <= path.length) {\n      if (ext.length === path.length && ext === path) return '';\n      var extIdx = ext.length - 1;\n      var firstNonSlashEnd = -1;\n      for (i = path.length - 1; i >= 0; --i) {\n        var code = path.charCodeAt(i);\n        if (code === 47 /*/*/) {\n            // If we reached a path separator that was not part of a set of path\n            // separators at the end of the string, stop now\n            if (!matchedSlash) {\n              start = i + 1;\n              break;\n            }\n          } else {\n          if (firstNonSlashEnd === -1) {\n            // We saw the first non-path separator, remember this index in case\n            // we need it if the extension ends up not matching\n            matchedSlash = false;\n            firstNonSlashEnd = i + 1;\n          }\n          if (extIdx >= 0) {\n            // Try to match the explicit extension\n            if (code === ext.charCodeAt(extIdx)) {\n              if (--extIdx === -1) {\n                // We matched the extension, so mark this as the end of our path\n                // component\n                end = i;\n              }\n            } else {\n              // Extension does not match, so our result is the entire path\n              // component\n              extIdx = -1;\n              end = firstNonSlashEnd;\n            }\n          }\n        }\n      }\n\n      if (start === end) end = firstNonSlashEnd;else if (end === -1) end = path.length;\n      return path.slice(start, end);\n    } else {\n      for (i = path.length - 1; i >= 0; --i) {\n        if (path.charCodeAt(i) === 47 /*/*/) {\n            // If we reached a path separator that was not part of a set of path\n            // separators at the end of the string, stop now\n            if (!matchedSlash) {\n              start = i + 1;\n              break;\n            }\n          } else if (end === -1) {\n          // We saw the first non-path separator, mark this as the end of our\n          // path component\n          matchedSlash = false;\n          end = i + 1;\n        }\n      }\n\n      if (end === -1) return '';\n      return path.slice(start, end);\n    }\n  },\n\n  extname: function extname(path) {\n    assertPath(path);\n    var startDot = -1;\n    var startPart = 0;\n    var end = -1;\n    var matchedSlash = true;\n    // Track the state of characters (if any) we see before our first dot and\n    // after any path separator we find\n    var preDotState = 0;\n    for (var i = path.length - 1; i >= 0; --i) {\n      var code = path.charCodeAt(i);\n      if (code === 47 /*/*/) {\n          // If we reached a path separator that was not part of a set of path\n          // separators at the end of the string, stop now\n          if (!matchedSlash) {\n            startPart = i + 1;\n            break;\n          }\n          continue;\n        }\n      if (end === -1) {\n        // We saw the first non-path separator, mark this as the end of our\n        // extension\n        matchedSlash = false;\n        end = i + 1;\n      }\n      if (code === 46 /*.*/) {\n          // If this is our first dot, mark it as the start of our extension\n          if (startDot === -1)\n            startDot = i;\n          else if (preDotState !== 1)\n            preDotState = 1;\n      } else if (startDot !== -1) {\n        // We saw a non-dot and non-path separator before our dot, so we should\n        // have a good chance at having a non-empty extension\n        preDotState = -1;\n      }\n    }\n\n    if (startDot === -1 || end === -1 ||\n        // We saw a non-dot character immediately before the dot\n        preDotState === 0 ||\n        // The (right-most) trimmed path component is exactly '..'\n        preDotState === 1 && startDot === end - 1 && startDot === startPart + 1) {\n      return '';\n    }\n    return path.slice(startDot, end);\n  },\n\n  format: function format(pathObject) {\n    if (pathObject === null || typeof pathObject !== 'object') {\n      throw new TypeError('The \"pathObject\" argument must be of type Object. Received type ' + typeof pathObject);\n    }\n    return _format('/', pathObject);\n  },\n\n  parse: function parse(path) {\n    assertPath(path);\n\n    var ret = { root: '', dir: '', base: '', ext: '', name: '' };\n    if (path.length === 0) return ret;\n    var code = path.charCodeAt(0);\n    var isAbsolute = code === 47 /*/*/;\n    var start;\n    if (isAbsolute) {\n      ret.root = '/';\n      start = 1;\n    } else {\n      start = 0;\n    }\n    var startDot = -1;\n    var startPart = 0;\n    var end = -1;\n    var matchedSlash = true;\n    var i = path.length - 1;\n\n    // Track the state of characters (if any) we see before our first dot and\n    // after any path separator we find\n    var preDotState = 0;\n\n    // Get non-dir info\n    for (; i >= start; --i) {\n      code = path.charCodeAt(i);\n      if (code === 47 /*/*/) {\n          // If we reached a path separator that was not part of a set of path\n          // separators at the end of the string, stop now\n          if (!matchedSlash) {\n            startPart = i + 1;\n            break;\n          }\n          continue;\n        }\n      if (end === -1) {\n        // We saw the first non-path separator, mark this as the end of our\n        // extension\n        matchedSlash = false;\n        end = i + 1;\n      }\n      if (code === 46 /*.*/) {\n          // If this is our first dot, mark it as the start of our extension\n          if (startDot === -1) startDot = i;else if (preDotState !== 1) preDotState = 1;\n        } else if (startDot !== -1) {\n        // We saw a non-dot and non-path separator before our dot, so we should\n        // have a good chance at having a non-empty extension\n        preDotState = -1;\n      }\n    }\n\n    if (startDot === -1 || end === -1 ||\n    // We saw a non-dot character immediately before the dot\n    preDotState === 0 ||\n    // The (right-most) trimmed path component is exactly '..'\n    preDotState === 1 && startDot === end - 1 && startDot === startPart + 1) {\n      if (end !== -1) {\n        if (startPart === 0 && isAbsolute) ret.base = ret.name = path.slice(1, end);else ret.base = ret.name = path.slice(startPart, end);\n      }\n    } else {\n      if (startPart === 0 && isAbsolute) {\n        ret.name = path.slice(1, startDot);\n        ret.base = path.slice(1, end);\n      } else {\n        ret.name = path.slice(startPart, startDot);\n        ret.base = path.slice(startPart, end);\n      }\n      ret.ext = path.slice(startDot, end);\n    }\n\n    if (startPart > 0) ret.dir = path.slice(0, startPart - 1);else if (isAbsolute) ret.dir = '/';\n\n    return ret;\n  },\n\n  sep: '/',\n  delimiter: ':',\n  win32: null,\n  posix: null\n};\n\nposix.posix = posix;\n\nmodule.exports = posix;\n"],"names":["module","exports","assert","val","msg","Error","inherits","ctor","superCtor","super_","TempCtor","prototype","constructor","BN","number","base","endian","isBN","this","negative","words","length","red","_init","Buffer","wordSize","window","e","parseHex4Bits","string","index","c","charCodeAt","parseHexByte","lowerBound","r","parseBase","str","start","end","mul","b","len","Math","min","i","move","dest","src","num","Array","isArray","max","left","right","cmp","_initNumber","_initArray","toString","replace","_parseHex","_parseBase","toArray","ceil","j","w","off","_strip","limbLen","limbPow","total","mod","word","imuln","_iaddn","pow","copy","_move","clone","_expand","size","_normSign","Symbol","for","inspect","zeros","groupSizes","groupBases","smallMulTo","self","out","a","lo","carry","k","ncarry","rword","maxJ","padding","groupSize","groupBase","isZero","modrn","idivn","toNumber","ret","toJSON","toBuffer","toArrayLike","ArrayType","byteLength","reqLength","res","allocUnsafe","allocate","_toArrayLikeLE","position","shift","_toArrayLikeBE","clz32","_countBits","t","_zeroBits","bitLength","hi","zeroBits","toTwos","width","abs","inotn","iaddn","fromTwos","testn","notn","ineg","isNeg","neg","iuor","ior","or","uor","iuand","iand","and","uand","iuxor","ixor","xor","uxor","bytesNeeded","bitsLeft","setn","bit","wbit","iadd","isub","add","sub","comb10MulTo","mid","o","a0","al0","ah0","a1","al1","ah1","a2","al2","ah2","a3","al3","ah3","a4","al4","ah4","a5","al5","ah5","a6","al6","ah6","a7","al7","ah7","a8","al8","ah8","a9","al9","ah9","b0","bl0","bh0","b1","bl1","bh1","b2","bl2","bh2","b3","bl3","bh3","b4","bl4","bh4","b5","bl5","bh5","b6","bl6","bh6","b7","bl7","bh7","b8","bl8","bh8","b9","bl9","bh9","w0","imul","w1","w2","w3","w4","w5","w6","w7","w8","w9","w10","w11","w12","w13","w14","w15","w16","w17","w18","bigMulTo","hncarry","jumboMulTo","FFTM","x","y","mulTo","makeRBT","N","l","revBin","rb","permute","rbt","rws","iws","rtws","itws","transform","s","rtwdf","cos","PI","itwdf","sin","p","rtwdf_","itwdf_","re","ie","ro","io","rx","guessLen13b","n","m","odd","conjugate","normalize13b","ws","round","convert13b","stub","ph","mulp","_","rwst","iwst","nrws","nrwst","niwst","rmws","mulf","isNegNum","muln","sqr","isqr","toBitArray","q","iushln","bits","carryMask","newCarry","ishln","iushrn","hint","extended","h","mask","maskedWords","ishrn","shln","ushln","shrn","ushrn","imaskn","maskn","isubn","addn","subn","iabs","_ishlnsubmul","_wordDiv","mode","bhi","diff","qj","div","divmod","positive","divn","umod","divRound","dm","half","r2","andln","acc","modn","egcd","A","B","C","D","g","isEven","yp","xp","im","isOdd","jm","gcd","_invmp","x1","x2","delta","cmpn","invm","bincn","ucmp","gtn","gt","gten","gte","ltn","lt","lten","lte","eqn","eq","Red","toRed","ctx","convertTo","_forceRed","fromRed","convertFrom","forceRed","redAdd","redIAdd","redSub","redISub","redShl","shl","redMul","_verify2","redIMul","redSqr","_verify1","redISqr","redSqrt","sqrt","redInvm","redNeg","redPow","primes","k256","p224","p192","p25519","MPrime","name","tmp","_tmp","K256","call","P224","P192","P25519","prime","_prime","Mont","imod","rinv","minv","ireduce","rlen","split","imulK","undefined","strip","input","output","outLen","prev","next","mod3","one","nOne","lpow","z","inv","wnd","current","currentLen","mont","u","assertPath","path","TypeError","JSON","stringify","normalizeStringPosix","allowAboveRoot","code","lastSegmentLength","lastSlash","dots","lastSlashIndex","lastIndexOf","slice","posix","resolve","cwd","resolvedPath","resolvedAbsolute","arguments","process","normalize","isAbsolute","trailingSeparator","join","joined","arg","relative","from","to","fromStart","fromEnd","fromLen","toStart","toLen","lastCommonSep","fromCode","_makeLong","dirname","hasRoot","matchedSlash","basename","ext","extIdx","firstNonSlashEnd","extname","startDot","startPart","preDotState","format","pathObject","sep","dir","root","_format","parse","delimiter","win32"],"sourceRoot":""}